- |
-
- |
- - Home - - | -- Libraries - | -- People - | -- - FAQ - | -- More - | -
- In a word, Productivity. Use of high-quality libraries like - Boost speeds initial development, results in fewer bugs, reduces - reinvention-of-the-wheel, and cuts long-term maintenance costs. And since - Boost libraries tend to become de facto or de jure standards, many - programmers are already familiar with them. -
-- - Ten of the Boost libraries are included in the C++ - Standard Library's TR1, and so are slated for later full - standardization. More Boost libraries are in the pipeline for TR2. - Using Boost libraries gives an organization a head-start in adopting new - technologies. -
-- Many organization already use programs implemented with Boost, like Adobe - Acrobat - Reader 7.0. -
-- See the Who's Using Boost - page for a sampling. We don't know the exact numbers, but a release - gets around 100,000 downloads from SourceForge, and that is only one of - several distribution routes. -
-- "...one of the most highly regarded and expertly designed C++ library - projects in the world." -
- --- -- -- Herb Sutter and Andrei - Alexandrescu, C++ Coding - Standards -
-
- "Item 55: Familiarize yourself with Boost." -
---- -- Scott Meyers, Effective C++, 3rd - Ed. -
- -
- "The obvious solution for most programmers is to use a library that - provides an elegant and efficient platform independent to needed services. - Examples are BOOST..." -
---- -- Bjarne Stroustrup, - Abstraction, - libraries, and efficiency in C++ - -
-
- For relatively straightforward support needs, users rely on the mailing lists. One of the advantages of Boost is - the responsiveness of other users and Boost developers. -
-- - For more involved needs, Commercial - Support is available. -
-- Boost has its own license, developed with - help from the Harvard Law School. The Boost license polices encourage both commercial and - non-commercial use, and the Boost license is not related to the GPL or - other licenses - that are sometimes seen as business unfriendly. -
- -- The Boost libraries tend to be new, fresh, and creative designs. They are - not copies, clones, or derivations of proprietary libraries. Boost has a - firm policy to respect the IP rights of others. The development of Boost - libraries is publicly documented via the mailing lists and version control - repository. The source code has been inspected by many, many knowledgeable - programmers. Each Boost file has a copyright notice and license - information. IP issues have been reviewed by the legal teams from some of - the corporations which use Boost, and in some cases these lawyers have been - kind enough to give Boost feedback on IP issues. There are no guarantees, - but those factors all tend to reduce IP risk. -
-- - Businesses and other organizations often prefer to have code developed, - maintained, and improved in the open source community when it does not - contain technology specific to their application domain, because it allows - them to focus more development resources on their core business. -
-- Individuals contribute for the technical challenge, to hone their technical - skills, for the sense of community, as part of their graduate school - programs, as a way around geographic isolation, to enhance their employment - opportunities, and as advertisements for their consulting services. There - are probably as many reasons as there are individuals. Some of the - apparently individual contributions come from employees of support - companies with contracts from businesses or other organizations who have an - interest in seeing that a library is well-maintained. -
-- Boost doesn't really have any expenses! All the infrastructure is - contributed by supporters, such as the Open Systems Lab at Indiana University, - - SourceForge, Boost Consulting, MetaCommunications, and the individuals, - companies, and other organizations who run the regression tests. Borland, - HP, Intel, and Microsoft have contributed compilers. And hundreds, or even - thousands, of programmers contribute their time. That's what makes Boost - possible. -
-- Revised 07 July, 2005 - -
- -- © Copyright Beman Dawes 2005. -
-- Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or copy - at http://www.boost.org/LICENSE_1_0.txt) -
- - - diff --git a/bibliography.html b/bibliography.html deleted file mode 100644 index 3c54804..0000000 --- a/bibliography.html +++ /dev/null @@ -1,538 +0,0 @@ - - - - |
- Home | -Libraries | -People | -FAQ | -More | -
Print publications about Boost or Boost Libraries
- Online publications about Boost or Boost Libraries
- Print mentions of Boost or Boost Libraries
- Online mentions of Boost or Boost Libraries
- How to update this page
- Acknowledgements
| [MaddockCleary00] | -John Maddock and Steve Cleary, C++ Type - Traits. Dr. Dobb's Journal, Vol. 25, Issue 10, October, 2000, page 38. - www.boost.org/libs/type_traits/c++_type_traits.htm | -
| [Maddock01] | -John Maddock, Regular Expressions in C++. - Dr. Dobb's Journal, Vol. 26, Issue 10, October, 2001, page 21. | -
| [SiekLumsdaine01] | -Jeremy Siek and Andrew Lumsdaine, C++ - Concept Checking. Dr. Dobb's Journal, Vol. 26, Issue 6, June, 2001, - page 64. | -
| [Karlsson02] | -Björn Karlsson, Smart Pointers in Boost. - C/C++ Users Journal, April, 2002. - www.cuj.com/documents/s=8014/cuj0204karlsson/ - | -
| [Karlsson02a] | -Björn Karlsson, C/C++ Tip #9: Lexical - Conversions. C/C++ Users Journal, November, 2002. - www.cuj.com/documents/s=8470/cuj0211karlsson/ | -
| [Kempf02] | -Bill Kempf, The Boost.Threads Library. - C/C++ Users Journal, May, 2002. - www.cuj.com/documents/s=8013/cuj0205kempf/ | -
| [SiekLeeLumsdaine02] | -
- Jeremy Siek, Lie-Quan Lee and Andrew Lumsdaine, The Boost Graph Library.
- Addison-Wesley, 2002. ISBN: 0-201-72914-8.
- www.awprofessional.com/titles/0-201-72914-8/
- A sample chapter is available at: tinyurl.com/24666 - |
-
| [AbrahamsGrosse-Kunstleve03] | -David Abrahams and Ralf W. - Grosse-Kunstleve, Building Hybrid Systems with Boost.Python. C/C++ Users - Journal, July, 2003. - www.cuj.com/documents/s=8470/cuj0307abrahams/ | -
| [GuzmanNuffer03] | -Joel de Guzman and Dan Nuffer, The Spirit - Library: Inline Parsing in C++. C/C++ Users Journal, September, 2003, - Vol. 21, Issue 9, page 22. | -
| [Karlsson03] | -Björn Karlsson, Lambda Expressions & - C++. C/C++ Users Journal, December, 2003, Vol. 21, Issue 12, page 20. | -
| [Sutter03] | -Herb Sutter, Generalized Function Pointers. - C/C++ Users Journal, August, 2003. - www.cuj.com/documents/s=8464/cujcexp0308sutter/ - | -
| [AbrahamsGurtovoy04] | -
- David Abrahams and Aleksey Gurtovoy, C++ Template Metaprogramming: Concepts,
- Tools, and Techniques from Boost and Beyond. Addison-Wesley, November,
- 2004. ISBN: 0-321-22725-5.
- www.awprofessional.com/titles/0321227255/
- - Additional information and two sample chapters are available at: - boost-consulting.com/tmpbook/ - |
-
| [Inaba04] | -
- Kazuhiro Inaba, Boost C++ Library Programming. Shuwa System, May, 2004. ISBN: 4-7980-0786-2.
- www.shuwasystem.co.jp/books/7980/0786-2/0786-2.html
- - Additional information and a sample chapter are available at: - www.kmonos.net/pub/BoostBook/ - |
-
| [López04] | -Joaquín M López Muñoz, - The Boost Multi-Index Containers Library. C/C++ Users Journal, - September, 2004, Vol. 22, Issue 9, page 6. | -
| [Karlsson05] | -
- Björn Karlsson, Beyond the C++ Standard Library: An Introduction to Boost. Addison-Wesley, August 31, 2005. ISBN: 0-3211-3354-4.
- www.awprofessional.com/titles/0321133544/
- - A sample chapter is available at: - www.awprofessional.com/content/images/0321133544/samplechapter/karlsson_ch09.pdf - |
-
| [Brownell02] | -David Brownell, C++ Techniques for - Tomorrow That Can be Implemented Today (a.k.a. Boosting your Code). - NWCPP, November 13, 2002. www.nwcpp.org/Meetings/2002/11.html | -
| [Long02] | -Matt Long, Adding Regular Expressions to Your App with Regex++. - The Code Project, June 18, 2002. www.codeproject.com/string/regex__.asp | -
| [Siek02] | -Jeremy G. Siek, The Boost Graph Library. - InformIT, March 1, 2002. tinyurl.com/2hc27 | -
| [Siek02a] | -Jeremy G. Siek, A Boost Graph Library - Tutorial. InformIT, March 1, 2002. tinyurl.com/2sa4s | -
| [Abrahams03] | -David Abrahams, The Boost - Metaprogramming Library. ACCU, 2003. - www.boost-consulting.com/writing/ACCU_MPL_slides.ppt | -
| [Dawes03] | -Beman Dawes, Multiplatform Software - Development. 2003. www.esva.net/~beman/multiplat_dev.ppt | -
| [Halleux03] | -Jonathan de Halleux, Opening a door - towards Spirit: a parser framework. The Code Project, March 24, 2003. www.codeproject.com/cpp/spiritintro.asp | -
| [Kaiser03] | -Hartmut Kaiser, Wave: a Standard conformant C++ preprocessor library. The Code Project, March 25, 2003. www.codeproject.com/cpp/wave_preprocessor.asp | -
| [Trentini03] | -Matthew S. Trentini, Introduction to Boost. | -
| [Walker03] | -Andrew Walker, An Introduction to Boost.
- The Code Project, July 7, 2003.
- www.codeproject.com/vcpp/stl/BoostIntro.asp
- A short and straightforward introduction to Boost. |
-
| [Dawes04] | -Beman Dawes, Boost for Visual C++ - Developers. MSDN, May 17, 2004. tinyurl.com/2lzyh | -
| [D'Agostino04] | -Jim D'Agostino, Designing Robust Objects with Boost. - The Code Project, August 17, 2004. - www.codeproject.com/cpp/Designing_Robust_Objects.asp | -
| [Handley04] | -Dave Handley, An Introduction to the Boost Spirit Parser framework. - The Code Project, October 9, 2004. - www.codeproject.com/vcpp/stl/introduction_spirit.asp | -
| [Handley04a] | -Dave Handley, Implementing Semantic Actions in the Boost Spirit Parser Framework. - The Code Project, October 10, 2004. - www.codeproject.com/vcpp/stl/spirit_semantic_actions.asp | -
| [Hauptmann04] | -Peter Hauptmann, Smart Pointers to boost your - code. The Code Project, September 27, 2004. - www.codeproject.com/vcpp/stl/boostsmartptr.asp | -
| [Hauptmann04a] | -Peter Hauptmann, boost 2: shared_ptr wraps - resource handles. The Code Project, October 4, 2004. - www.codeproject.com/vcpp/stl/boostsp_handleref.asp | -
| [Wikipedia04] | -Wikipedia, Boost. - Wikipedia, The Free Encyclopedia, 2004. - en.wikipedia.org/wiki/Boost_(programming) | -
| [Witt04] | -Thomas Witt, The Boost Iterator Library. - ACCU Spring Conference, 2004. - www.accu.org/conference/presentations/Witt_-_Boost_Iterator_Library.pdf | -
| [Karlsson05a] | -Bjorn Karlsson, How the Boost Bind Library Can Improve Your C++ Programs. InformIT, August 26, 2005. - http://www.informit.com/articles/article.asp?p=412354 | -
| [Cogswell05] | -Jeff Cogswell, Adding an Easy File Save and File Load Mechanism
- to Your C++ Program. InformIT, July 1, 2005.
- http://www.informit.com/articles/article.asp?p=398702
- Explains Boost.Serialization. |
-
| [Gurtovoy05] | -Aleksey Gurtovoy and David Abrahams An In-Depth Look at Metafunctions in C++. InformIT, April 1, 2005. - http://www.informit.com/articles/article.asp?p=375705 | -
| [HyslopSutter01] | -Jim Hyslop and Herb Sutter, Conversations:
- I'd Hold Anything for You. C/C++ Users Journal, December, 2001.
- www.cuj.com/documents/s=7988/cujcexp1912hyslop/
- boost::any
- |
-
| [Meyers01] | -Scott Meyers, Item 50: Familiarize yourself with - STL-related web sites. Effective STL, Addison-Wesley, 2001, page 221. ISBN: 0-201-74962-9 - | -
| [Sutter01] | -Herb Sutter, The String Formatters of
- Manor Farm. C/C++ Users Journal, Vol. 19, November, 2001.
- www.gotw.ca/publications/mill19.htm
- boost::lexical_cast
- |
-
| [Ablavsky02] | -Vitaly Ablavsky, Applying BGL to - Computational Geometry. C/C++ Users Journal, August, 2002. - www.cuj.com/documents/s=8470/cuj0208ablavsky/ | -
| [Alexandrescu02] | -Andrei Alexandrescu, Generic<Programming>:
- Efficient Generic Sorting and Searching in C++ (I): In Search of a Better
- Search. C/C++ Users Journal, October, 2002.
- www.cuj.com/documents/s=7978/cujcexp2010alexandr/
- boost::type_traits
- |
-
| [HyslopSutter02] | -Jim Hyslop and Herb Sutter, Conversations:
- Getting to the Point. C/C++ Users Journal, July, 2002.
- www.cuj.com/documents/s=7981/cujcexp2007hyslop/
- smart pointer discussion. boost::scoped_ptr, shared_ptr, scoped_array,
- shared_array.
- |
-
| [Sutter02] | -Herb Sutter, The New C++: The Group of - Seven - Extensions under Consideration for the C++ Standard Library. - C/C++ Users Journal, April, 2002. - www.cuj.com/documents/s=7984/cujcexp2004sutter/ - | -
| [Sutter02a] | -Herb Sutter, The New C++: Smart(er) - Pointers. C/C++ Users Journal, August, 2002. - www.cuj.com/documents/s=7980/cujcexp2008sutter/ | -
| [Besser03] | -Mitch Besser, Generic Printable ENUM++.
- C/C++ Users Journal, June, 2003.
- www.cuj.com/documents/s=8470/cujboost0306besser/
- Mentions BOOST_PP
- |
-
| [Nasonov03] | -Alexander Nasonov, I/O System: dynamic_any
- Campaign. C/C++ Users Journal, September, 2003.
- www.cuj.com/documents/s=8470/cujweb0309nasonov/
- Improved boost::any
- |
-
| [Sutter03a] | -Herb Sutter, Generalizing Observer. - C/C++ Users Journal, September, 2003. - www.cuj.com/documents/s=8840/cujexp0309sutter/ - | -
| [Tan03] | -Kwee H. Tan, Exploring EDA Algorithms with - the Boost Graph Library. C/C++ Users Journal, July, 2003. - www.cuj.com/documents/s=8470/cuj0307tan/ - | -
| [VandervoordeJosuttis03] - | -David Vandevoorde and Nicolai M.
- Josuttis, Using Templates in Practice. C/C++ Users Journal, February,
- 2003.
- www.cuj.com/documents/s=8208/cujweb0302vandevoorde/web0302b.htm
- Concept Check Library - |
-
| [Meyers05] | -Scott Meyers, Item 55: Familiarize yourself - with Boost. Effective C++, 3rd Edition, Addison-Wesley, May 12, 2005. ISBN: 0-321-33487-6 - | -
| [Siek01] | -Jeremy G. Siek, An Implementation of Graph Isomorphism Testing, - December 9, 2001. - www.boost.org/libs/graph/doc/isomorphism-impl.pdf | -
| [Burnap02] | -Steven R. Burnap, Boost::any, - Kuro5hin, May 1, 2002. - www.kuro5hin.org/story/2002/5/1/142321/9513 | -
| [Carbon02] | -David S?, Boost : The handy library of - handy libraries. Kuro5hin, July 18, 2002. - www.kuro5hin.org/story/2002/7/18/3313/01429 - | -
| [Curran02] | -James Curran, Access Raw Data with
- Performance Counters in Visual C++. DevX.com, October, 2002.
- www.devx.com/cplus/article/7951
- Devotes several paragraphs to boost::shared_ptr<>.
- |
-
| [Siek02b] | -Jeremy G. Siek, Internet Packet Routing - with the Boost Graph Library. InformIT, March 1, 2002. - tinyurl.com/26dwj | -
| [Casad03] | -Joe Casad, Introducing the Boost Corner. - C/C++ Users Journal, August, 2003. - www.cuj.com/documents/s=8470/cuj0308boostcorner/ - | -
| [Lischner03] | -
- Ray Lischner, C++: Beyond the Standard Library. O'Reilly Network, May 6,
- 2003. www.oreillynet.com/lpt/a/3683
- Mentions tuples, shared_ptr, lambda, spirit.
- |
-
| [Inaba04a] | -Kazuhiro Inaba, Let's Boost. 2004. - www.kmonos.net/alang/boost/ | -
| [Stein04] | -
- Sebastian Stein, How to use Boost Test for automated testing. 2004. - www.hpfsc.de/boosttest/ - |
-
| [Lindrud05] | -Jarl Lindrud, RMI for C++.
- The Code Project, April 11, 2005. www.codeproject.com/threads/RMI_For_Cpp.asp
- Uses Boost.Serialization. |
-
Please help us keep this page updated - users can post new citations to the - mailing list, while Boost developers should update the page directly in CVS.
-Fredrik Blomqvist provided many of the initial citations.
-Revised - - 17 September, 2005
-© Copyright Beman Dawes 2003
-Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or - copy at www.boost.org/LICENSE_1_0.txt) -
- - diff --git a/blanket-permission.txt b/blanket-permission.txt index 018d5ea..6096aea 100644 --- a/blanket-permission.txt +++ b/blanket-permission.txt @@ -5,7 +5,7 @@ License, Version 1.0. (boostinspect:nolicense boostinspect:nocopyright) Aleksey Gurtovoy (agurtovoy@meta-comm.com) Andrei Alexandrescu (andrewalex - at - hotmail.com) (See Boost list message of August 12, 2004 11:06:58 AM EST) Andrew Lumsdaine () -Anthony Williams (anthony -at- justsoftwaresolutions.co.uk( +Anthony Williams (anthony -at- justsoftwaresolutions.co.uk) Beman Dawes (bdawes@acm.org) Brad King (brad.king -at- kitware.com) (See Boost list message of Wed, 21 Jul 2004 11:15:46 -0400) Brian Osman (osman -at- vvisions.com) (See CVS log) @@ -96,6 +96,9 @@ Trustees of Indiana University () University of Notre Dame () Vladimir Prus (ghost@cs.msu.su) William E. Kempf () (email to Beman Dawes, 9/14/2006 4:18 PM) +Joerg Walter (jhr.walter - at - t-online.de : email to ublas mailing list Mon, 17 Sep 2007 10:17:08 +0200) +Mathias Koch (mkoch - at - idesis.de 7 : email to boost-owner@lists.boost.org Sep 2007 13:20:09 +0200) --- end --- + diff --git a/boost_soc_06_overview.html b/boost_soc_06_overview.html new file mode 100644 index 0000000..f8d6770 --- /dev/null +++ b/boost_soc_06_overview.html @@ -0,0 +1,820 @@ + + + + + +
++For the second consecutive year, Google has conducted its +Summer of Code™ initiative, +a program by which student developers are sponsored for their contributions +within open source organizations willing to mentor the participants. The 2006 +campaign has run between April and September, with active development work +taking place between May 23 and August 21. +
+ ++Around mid April, when the program had just started, some Boost members began +considering the possibility to enter Summer of Code as a mentoring +organization. Despite the lack of time and the fact that most of us were +completely new to this initiative, Boost managed to successfully apply for +the program. As a result ten projects were selected and mentored, most of +which are expected to become full contributions to Boost in the near future. +
+ ++We give here a summary report of this experience, along with a short analysis +of the main problems we found, so that we can work at solving them and do +better next year. +
+ ++There are three types of participants in Google Summer of Code: +
+The 2006 campaign of Google Summer of Code took place between April 14 and +September 25. A total of 102 mentoring organizations participated. Of the 6,338 +applications submitted by 3,044 students around the globe, 630 were finally +selected and funded. Google has spent more than US$3 million in student stipends +and compensations to the mentoring organizations. +
+ ++On April 14, the same day Google Summer of Code started, Julio M. Merino Vidal +(later to become one of the selected students) sent a message encouraging Boost +members to participate in this program as a mentoring organization. This call +sparked the interest of the community; although time was already short for doing +all the preparation labors, Boost moderators put rapidly themselves to work and +conducted the preliminary registration steps. In the meantime, a Wiki page was +grown with project ideas provided by Boost members, totalling more than twenty +proposals. +
+ ++By the beginning of May Boost was officially accepted into the program and Boost +moderators set out to form a group of mentors, selected on an invitation basis. +As student selection is a delicate process, involving the assessment of individuals +on their technical skills, all subsequent discussions were conducted by the +selected mentors on a private mail list established for their collaboration. +
+ ++We were not prepared for the avalanche of student applications that followed. On +day two after the application period was open, we had received three proposals; +next day it was 14, and within a week the count exceeded 50. By the end of the +application period the total number of proposals received was 174, which forced +us to go through a very intensive ranking process and recruit additional mentors. +Two rules were followed so as rationalize the process of selection among dozens +of different proposals: +
+The different proposals were classified according to its related technological +area so that each cluster could be handled by an appointed mentor with the +required expertise on the subject. Mentors submitted then "focus reports" +summarizing the applications under their responsibility; these reports served as +a first filter to help reduce the number of final applications to be evaluated +jointly. Along the process, students with the most promising proposals were asked +to refine their ideas and provide further information. +
+ ++Although not enforced by the official rules, we agreed upon a one-to-one ratio +of mentors to students, which ultimately marked a hard limit on the maximum number +of eligible projects. +
+ ++Google accepted and funded the ten top-ranked projects endorsed by Boost. Of +these, eight projects are libraries or library components targeted for future +inclusion into Boost, while the remaining two consist of utility programs +heavily relying on Boost. +
+ ++C++ Coroutine Library ++ +
+Giovanni Piero Deretta, mentored by Eric Niebler. +
+Library for the management through a modern C++ interface of OS-provided +coroutine facilities. +
+Concurrency Library ++ +
+Matthew Calabrese, mentored by David Abrahams. +
+STL-inspired generic framework for high-level specification and execution of +parallelizable algorithms. +
+TR1 Math Special Functions ++ +
+Xiaogang Zhang, mentored by John Maddock. +
+Implementation of the 23 special mathematical functions specified in C++ +standard library extension proposal TR1. +
+The Boost.Process library ++ +
+Julio M. Merino Vidal, mentored by Jeff Garland. +
+Portable library for process launching and basic management. +
+Out-of-Core Graphs and Graph Algorithms ++ +
+Stéphane Zampelli, mentored by Jeremy Siek. +
+Extension of the Boost Graph Library to deal with out-of-core structures, +i.e. data sets too large to be kept in main memory at once. +
+MISC (M)ulti (I)ndex (S)pecialized (C)ontainers ++ +
+Matías Capeletto, mentored by Joaquín M López Muñoz. +
+Families of specialized containers internally based on Boost.MultiIndex. +
+Generic Tree Container ++ +
+Bernhard Reiter, mentored by René Rivera. +
+Design and implementation of a family of STL-compatible tree containers. +
+Viewer utility for FSMs ++ +
+Ioana Tibuleac, mentored by Andreas Huber Dönni. +
+Utility program for the visualization of finite state machines (FSMs) specified +with Boost.Statechart. +
+Modular C++ preprocessor, using Boost.Spirit ++ +
+Hermanpreet 'Lally' Singh, mentored by Joel de Guzman. +
+Implementation with Boost.Spirit and Boost.Wave of a front-end translator +from Modular C++ (as specified in a proposal to add modules to C++ by Daveed +Vandevoorde) to standard C++. +
+Implementing a state of the art Mincut/Maxflow algorithm. ++ +
+Stephan Diederich, mentored by Douglas Gregor. +
+Implementation of a fast mincut/maxflow routine for the Boost Graph Library +based on a new algorithm devised by Vladimir Kolmogorov. +
+Two main facilities were set up to assist students and mentors during the +development phase: a mailing list and a Trac/SVN project management system +with separate directories for each project. One of the students, Matías +Capeletto, out of personal initiative registered a Google Group aimed at giving +students with Boost a place for informal interaction and discussion of common +problems. +
+ ++After the initial warm-up period, each student-mentor pair performed development +work mostly privately. The usage of the Boost mailing lists was scarce, and +only by the end of the program did some students publicly announced their results. +
+ ++By the date the development period was officially closed, the status of the +different projects was as follows: +
+We examine the various stages of Boost participation in Summer of Code, with an +emphasis on discovering opportunities for improvement. +
+ ++In a mid project +presentation at OSCON +2006, Chris DiBona from Google provided some data about the organizations +which received the most applications: +
+ ++
| Organization | +No of applications | +
|---|---|
| KDE | +244 | +
| Ubuntu & Bazaar | +236 | +
| Python Software Foundation | +212 | +
| GNOME | +199 | +
| Apache Software Foundation | +190 | +
| Boost | +174 | +
| Gaim | +152 | +
| The GNU Project | +148 | +
| Drupal | +146 | +
+The numbers shown here have been estimated from a chart included in the +presentation slides. This chart contains an additional column labeled "Google" +which actually accounts for the applications dismissed because of their low +quality. ++ +
+The fact that Boost is ranked the sixth most attractive organization out of a +total of 102 was entirely unexpected, especially considering the wide popularity +of the rest of top-rated organizations. There is a more or less implicit +consensus among Boost members that ours is a relatively niche project, known for +its quality standards by seasoned C++ practitioners, but with a limited penetration +among entry level programmers: maybe the figures above should make us reconsider +this assumption. A cursory examination of the applications submitted to Boost reveals +that most applicants were regular users of Boost: many cite the Boost status among +the C++ community as an appealing factor in order to apply. +
+ ++If we look at the number of funded projects with respect to the applications received, +figures are not so favorable to Boost.
+ ++
| Organization | +No of projects | +Project/app ratio | +
|---|---|---|
| KDE | +24 | +9.8 % | +
| Ubuntu & Bazaar | +22 | +9.3 % | +
| Python Software Foundation | +23 | +10.8 % | +
| GNOME | +19 | +9.5 % | +
| Apache Software Foundation | +27 | +14.2 % | +
| Boost | +10 | +5.7 % | +
| Gaim | +8 | +5.3 % | +
| The GNU Project | +10 | +6.8 % | +
| Drupal | +14 | +9.6 % | +
+It turns out that the project/application ratio for almost any other organization +among the top nine is considerably higher than that of Boost. As it happens, Google +initially requested that organizations submitted the maximum number of projects they +felt they could cope with, and we got funding for exactly what we aimed for, so the +limiting factor lies entirely on Boost's side. +
+ ++Contributing to Boost relies on a fair number of guidelines and protocols for +coding, documentation, testing and maintenance. Many of the required tools are +exclusively used within Boost, and some of them are not trivial, like for instance +Boost.Build. Although the Boost web site contains information about all these tools +and procedures, this intelligence is scattered through unrelated pages and sometimes +is very hard to come by. +
+ +
+So, there is a good deal of expertise required to begin working at Boost. Some
+students have reported on startup difficulties getting to know these details and
+familiarizing themselves with the tools, most notably bjam and Quickbook. Each
+student overcome the startup difficulties on their own or resorting to their
+mentors (see the section on public
+communication issues).
+
+Once students got past the startup stage, most projects advanced without serious +complications. In the majority of cases, it was realized at some point during +the development that there was no time to complete it. Some participants had to +redefine the goals in an effort to keep the project within schedule, while others +simply decided that they would continue working after the official deadline of +Summer of Code. +
+ ++The information flow between each student and their mentor was usually reported +by both parties to be satisfactory. The projects suffering from lack of +communication have been precisely those yielding the poorest results. In general, +mentors have not felt overwhelmed by requests from their students, and even in a +couple of cases the projects were run practically unattendedly. This fact is +witness to the high competence of the students recruited into the program. +
+ ++The degree of usage of the Trac/SVN system has varied. Some students did frequent +updates, while others have just used the repository to dump the final results for +the official submission to Google. +
+ ++Students and mentors had at their disposal three different forums for the public +interchange of information and support: +
+In hindsight, it has become apparent that most projects were too ambitious to be +completed within the three months of duration of the program, and even those that +were considered a success will need weeks or months of polishing up before the +material is ready for a formal review. In contrast with other organizations +participating in the Summer of Code program, Boost has as of this writing included +no results into its code base. No formal review for any project has been requested +yet, either. +
+ ++These scope issues are very dependent on the particular type of project. We can +classify the Boost projects for Summer of Code as follows: +
+As for those projects involving the design and realization of full-fledged +libraries, there is little hope that the goals and scope can be kept modest enough +for a three-month schedule. Boost candidate libraries developed by professional +authors usually take much longer than three months to be accepted; some libraries +have been evolving through several years before being included into Boost. +So, the best we can hope for if we are to support the realization of library projects +for Boost inside Summer of Code is that the results by the end of the program can +be evaluated to constitute a viable potential contribution to Boost. When this is +the case, it is crucial that the student commits to further working on the project +up to completion and formal review. Perhaps more important than getting libraries +coded is to engage new authors into a long-term relationship with the Boost project. +
+ ++The following proposals aim to alleviate some of the problems we have identified +during the development of Summer of Code within Boost. These action points are +related only to the issues found in connection with Boost: we are not addressing +other areas of improvement associated to the Summer of Code program itself. +
+ ++Much work can be done before the actual program begins. The following preparation +activities can already be launched: +
+ ++Create a pool of ideas for projects. This action will provide valuable extra +time for evaluation and refining of ideas before the Summer of Code begins. +The experience has shown that those projects with more preparation work, especially +in the area of design, were ultimately more successful. The pool can also be used +to retain interesting ideas that arise at the mailing lists and very often are +not given proper attention and become abandoned. +
+ ++Create a student pool. Prior involvement with Boost is clearly an advantage +both in the selection phase and later during project development. Those students +with a serious interest in participating in Summer of Code with Boost can enter +the pool and begin exploring ideas and interacting with the community well in +advance of the summer, so as to put themselves in a favorable position for the +selection. Advertisement for the student pool can be initiated in the beginning of +2007 through the usual channels (web site and mailing lists): additionally, Boost +members involved with the University can spread this information locally and help +raise the interest of students in their environment. +
+ ++Create a mentor pool. Given the rush with which Boost entered the 2006 +Summer of Code campaign, the invitation of mentors has to be done on an on-demand +basis as it became all too evident that the task was growing bigger and bigger. +It is important that the organization is better prepared next year so that a +number of people with the ability and will to participate as Boost mentors are +identified in advance. +
+ ++Prepare a startup package. In order to facilitate the initial period of +getting familiarized with the various Boost guidelines, protocols and tools, it +would be extremely useful to prepare a compilation of startup material for +students. This package can consist of a single document gathering the currently +dispersed information, or go beyond this and provide some bundle of documentation +and pre-built tools, an approach that one of the students is currently working on. +
+ ++It is crucial that students get involved with the community as soon as possible +and grow to appreciate the advantages of public development with respect to +solitary coding. +
+ ++Mandate (bi)weekly reports. These reports should be directed to the public +mailing lists so as to give all Boost members an opportunity to follow the work +in progress and contribute. Reporting has the extra benefit for students of +forcing them to reflect on their own work periodically and struggle with the +often difficult task of presenting their ideas to others. +
+ ++Conduct student-mentor exclusively through public channels. This might be +too drastic a policy, as some matters need privacy, and depending on the amount +of information exchanged flooding problems may arise. Less severe variations +involve allowing for some private interchange at the mentors' discretion and +moving this kind of communication to a dedicated public mailing list different +from the general ones. +
+ ++The two most important issues to improve upon with respect to the management are: +
+Create a best practices document. This document can serve as a guideline +for project management, an area in which Boost traditionally imposes no +requirements. Students might lack the expertise in this area that is usually +taken for granted in the traditional model where contributions to Boost are +made by professional programmers. +
+ ++Mandate a design phase. Having a concrete design set up and clearly +described early in the project will help estimate the necessary effort for +completion of the work. This is also an opportunity for public discussion. +
+ ++Maintain code, docs and tests in parallel. All too often, novice +programmers do the coding in one fell swoop and only then move to testing and +documenting their work. This is unacceptable by all current methodology +standards, and can result in serious underestimations of the time to +completion. +
+ ++Encourage the KISS principle. It is much better to finish a simpler library +and then iteratively evolve it, once it has been exposed to public scrutiny and +usage. +
+ ++More Trac updates. The repository should be viewed as an everyday work +tool, not only as the place into which to dump the final results. Updating often +leads to more visibility of the work by the mentor and the public in general. +
+ ++Informal reviews. The typical Summer of Code Boost project will not be +completed by the official deadline, as have been discussed earlier. To somehow +officialize the work done within the Summer of Code proper, and also to allow +the students to reach some sort of psychological milestone, informal reviews can +be instituted where Boost members evaluate the work done at then end of Summer +of Code. +
+ ++Engage students. This experience has shown that it is possible to guide +willing and bright students to the competence levels required for contributing +to Boost. The best possible outcome of Summer of Code campaigns are the +incorporation of new people into the circle of Boost active contributors. Strive +to make the students commit to Boost. +
+ ++Despite the lack of previous experience in Boost, our participation in Google +Summer of Code has been extremely fruitful: much useful material has been produced, +and, perhaps more importantly, some of the students are likely to commit on a +long-term basis and grow to be regular Boost contributors. Traditionally, becoming +a productive Boost author has a very high entry barrier due to the extreme quality +standards, lack of public support and the very specific culture of the project. +The appeal of Summer of Code itself and the possibility of being gently mentored +into the world of Boost have most likely been key factors in lowering this entry +barrier. +
+ ++The process has not been without some difficulties, either, as it was expected of +a newcomer organization as Boost. We have tried to identify in this paper the +areas of improvement and suggest specific actions so that the upcoming Google +Summer of Code 2007 can be an even more rewarding experience. +
+ ++This paper couldn't have been written without the numerous reports and contributions +kindly provided by Boost students and mentors: Many thanks to all the participants +for sharing their experiences with me. Thank you also to the people at Google who +have promoted and conducted the Summer of Code initiative. +
+ +Revised October 17th 2006
+ +© Copyright 2006 Joaquín M López Muñoz. +Distributed under the Boost Software +License, Version 1.0. (See accompanying file +LICENSE_1_0.txt or copy at +http://www.boost.org/LICENSE_1_0.txt) +
+ + + diff --git a/borland_cpp.html b/borland_cpp.html deleted file mode 100644 index 49781ed..0000000 --- a/borland_cpp.html +++ /dev/null @@ -1,394 +0,0 @@ - - - - - - - - |
-
- Home | - -Libraries | - -People | - -FAQ | - -More | -
It is a general aim for boost libraries to be portable. The primary means for achieving - this goal is to adhere to ISO Standard C++. However, ISO C++ is a broad and - complex standard and most compilers are not fully conformant to ISO C++ - yet. In order to achieve portability in the light of this restriction, it - seems advisable to get acquainted with those language features that some - compilers do not fully implement yet.
- -This page gives portability hints on some language features of the - Borland C++ version 5.5.1 compiler. Furthermore, the appendix presents - additional problems with Borland C++ version 5.5. Borland C++ 5.5.1 is a - freely available command-line compiler for Win32 available at http://www.borland.com/.
- -Each entry in the following list describes a particular issue, complete - with sample source code to demonstrate the effect. Most sample code herein - has been verified to compile with gcc 2.95.2 and Comeau C++ 4.2.44.
- -The preprocessor symbol __BORLANDC__ is defined for all
- Borland C++ compilers. Its value is the version number of the compiler
- interpreted as a hexadecimal number. The following table lists some known
- values.
| Compiler | - -__BORLANDC__ value |
-
|---|---|
| Borland C++ Builder 4 | - -0x0540 | -
| Borland C++ Builder 5 | - -0x0550 | -
| Borland C++ 5.5 | - -0x0550 | -
| Borland C++ 5.5.1 | - -0x0551 | -
| Borland C++ Builder 6 | - -0x0560 | -
using-declarations and
- using-directivesMixing using-directives (which refer to whole namespaces)
- and namespace-level using-declarations (which refer to
- individual identifiers within foreign namespaces) causes ambiguities where
- there are none. The following code fragment illustrates this:
-namespace N {
- int x();
-}
-
-using N::x;
-using namespace N;
-
-int main()
-{
- &x; // Ambiguous overload
-}
-
-
- using-declarations for class
- templatesIdentifiers for class templates can be used as arguments to
- using-declarations as any other identifier. However, the
- following code fails to compile with Borland C++:
-template<class T>
-class X { };
-
-namespace N
-{
- // "cannot use template 'X<T>' without specifying specialization parameters"
- using ::X;
-};
-
-
- Template function type deduction should omit top-level constness. - However, this code fragment instantiates "f<const int>(int)":
-
-template<class T>
-void f(T x)
-{
- x = 1; // works
- (void) &x;
- T y = 17;
- y = 20; // "Cannot modify a const object in function f<const int>(int)"
- (void) &y;
-}
-
-int main()
-{
- const int i = 17;
- f(i);
-}
-
-
- Addresses of overloaded functions are not in all contexts properly - resolved (std:13.4 [over.over]); here is a small example:
-
-template<class Arg>
-void f( void(*g)(Arg) );
-
-void h(int);
-void h(double);
-
-template<class T>
-void h2(T);
-
-int main()
-{
- void (*p)(int) = h; // this works (std:13.4-1.1)
- void (*p2)(unsigned char) = h2; // this works as well (std:13.4-1.1)
- f<int>(h2); // this also works (std:13.4-1.3)
-
- // "Cannot generate template specialization from h(int)",
- // "Could not find a match for f<Arg>(void (*)(int))"
- f<double>(h); // should work (std:13.4-1.3)
-
- f( (void(*)(double))h); // C-style cast works (std:13.4-1.6 with 5.4)
-
- // "Overloaded 'h' ambiguous in this context"
- f(static_cast<void(*)(double)>(h)); // should work (std:13.4-1.6 with 5.2.9)
-}
-
-
- Workaround: Always use C-style casts when determining - addresses of (potentially) overloaded functions.
- -const char * to
- std::stringImplicitly converting const char * parameters to
- std::string arguments fails if template functions are
- explicitly instantiated (it works in the usual cases, though):
-#include <string>
-
-template<class T>
-void f(const std::string & s)
-{}
-
-int main()
-{
- f<double>("hello"); // "Could not find a match for f<T>(char *)"
-}
-
-
-
- Workaround: Avoid explicit template function
- instantiations (they have significant problems with Microsoft Visual C++)
- and pass default-constructed unused dummy arguments with the appropriate
- type. Alternatively, if you wish to keep to the explicit instantiation, you
- could use an explicit conversion to std::string or declare the
- template function as taking a const char * parameter.
Template value parameters which default to an expression dependent on - previous template parameters don't work:
-
-template<class T>
-struct A
-{
- static const bool value = true;
-};
-
-// "Templates must be classes or functions", "Declaration syntax error"
-template<class T, bool v = A<T>::value>
-struct B {};
-
-int main()
-{
- B<int> x;
-}
-
-
-
- Workaround: If the relevant non-type template parameter - is an implementation detail, use inheritance and a fully qualified - identifier (for example, ::N::A<T>::value).
- -Partial ordering of function templates, as described in std:14.5.5.2 - [temp.func.order], does not work:
-
-#include <iostream>
-
-template<class T> struct A {};
-
-template<class T1>
-void f(const A<T1> &)
-{
- std::cout << "f(const A<T1>&)\n";
-}
-
-template<class T>
-void f(T)
-{
- std::cout << "f(T)\n";
-}
-
-int main()
-{
- A<double> a;
- f(a); // output: f(T) (wrong)
- f(1); // output: f(T) (correct)
-}
-
-
- Workaround: Declare all such functions uniformly as - either taking a value or a reference parameter.
- -When directly instantiating a template with some member function - pointer, which is itself dependent on some template parameter, the compiler - cannot cope:
-
-template<class U> class C { };
-template<class T>
-class A
-{
- static const int v = C<void (T::*)()>::value;
-};
-
-
- Workaround: Use an intermediate
- typedef:
-template<class U> class C { };
-template<class T>
-class A
-{
- typedef void (T::*my_type)();
- static const int v = C<my_type>::value;
-};
-
-
- (Extracted from e-mail exchange of David Abrahams, Fernando Cacciola, - and Peter Dimov; not actually tested.)
- -double std::abs(double) missingThe function double std::abs(double) should be defined
- (std:26.5-5 [lib.c.math]), but it is not:
-#include <cmath>
-
-int main()
-{
- double (*p)(double) = std::abs; // error
-}
-
-
- Note that int std::abs(int) will be used without warning if
- you write std::abs(5.1).
Similar remarks apply to seemingly all of the other standard math
- functions, where Borland C++ fails to provide float and
- long double overloads.
Workaround: Use std::fabs instead if type
- genericity is not required.
These issues are documented mainly for historic reasons. If you are - still using Borland C++ version 5.5, you are strongly encouraged to obtain - an upgrade to version 5.5.1, which fixes the issues described in this - section.
- -If a friend function of some class has not been declared before the - friend function declaration, the function is declared at the namespace - scope surrounding the class definition. Together with class templates and - inline definitions of friend functions, the code in the following fragment - should declare (and define) a non-template function "bool N::f(int,int)", - which is a friend of class N::A<int>. However, Borland C++ v5.5 - expects the function f to be declared beforehand:
-
-namespace N {
-template<class T>
-class A
-{
- // "f is not a member of 'N' in function main()"
- friend bool f(T x, T y) { return x < y; }
-};
-}
-
-int main()
-{
- N::A<int> a;
-}
-
-
- This technique is extensively used in boost/operators.hpp. Giving in to - the wish of the compiler doesn't work in this case, because then the - "instantiate one template, get lots of helper functions at namespace scope" - approach doesn't work anymore. Defining BOOST_NO_OPERATORS_IN_NAMESPACE (a - define BOOST_NO_INLINE_FRIENDS_IN_CLASS_TEMPLATES would match this case - better) works around this problem and leads to another one, see - [using-template].
-Revised - 03 - December, 2006
- -Copyright © 2000-2002 Jens - Maurer
- -Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or copy - at http://www.boost.org/LICENSE_1_0.txt)
- - diff --git a/bugs.htm b/bugs.htm deleted file mode 100644 index 6d07c54..0000000 --- a/bugs.htm +++ /dev/null @@ -1,118 +0,0 @@ - - - - - - - - -|
- |
- Home | -- Libraries | -- People | -FAQ | -More | -
cvs diff -du);
- if you can, send a patch relative to the current CVS state. A canonical
-example of creating a patch file follows (let's assume that you've found
-a bug in the file intentional_bug.hpp:intentional_bug.hpp from CVS.intentional_bug.hpp to a file called intentional_bug.hpp.orig.intentional_bug.hpp.diff -du intentional_bug.hpp.orig intentional_bug.hpp > intentional_bug.hpp.patch" from the command prompt.typename,
- etc.), and you are willing to make a fix, either make your changes locally
- and contact the library author(s)/maintainer(s) about it, or go ahead and
- check the fix into CVS, but post a notification about it to the
- boost mailing
- list (if the author is not very active on the list, you also might want
- to consider cc'ing him as well); Revised 18 January, 2002 -
- -© Copyright Aleksey Gurtovoy -2002
-Distributed under the Boost Software License, Version 1.0. -(See accompanying file LICENSE_1_0.txt or -copy at www.boost.org/LICENSE_1_0.txt) -
- -Reference counting techniques? Nothing new, you might think. Every good - C++ text that takes you to an intermediate or advanced level will - introduce the concept. It has been explored with such thoroughness in the - past that you might be forgiven for thinking that everything that can be - said has been said. Well, let's start from first principles and see if we - can unearth something new....
-The principle behind reference counting is to keep a running usage - count of an object so that when it falls to zero we know the object is - unused. This is normally used to simplify the memory management for - dynamically allocated objects: keep a count of the number of references - held to that object and, on zero, delete the object.
- -How to keep a track of the number of users of an object? Well, normal - pointers are quite dumb, and so an extra level of indirection is required - to manage the count. This is essentially the PROXY - pattern described in Design Patterns [Gamma, Helm, Johnson & - Vlissides, Addison-Wesley, ISBN 0-201-63361-2]. The - intent is given as
- -Provide a surrogate or placeholder for another object to control - access to it.
-Coplien [Advanced C++ Programming Styles and Idioms, - Addison-Wesley, ISBN 0-201-56365-7] defines a set - of idioms related to this essential separation of a handle and a body - part. The Taligent Guide to Designing Programs [Addison-Wesley, - ISBN 0-201-40888-0] identifies a number of specific - categories for proxies (aka surrogates). Broadly speaking they fall into - two general categories:
- -For reference counted smart pointers there are two places the count can - exist, resulting in two different patterns, both outlined in - Software Patterns [Coplien, SIGS, ISBN - 0-884842-50-X]:
- -Even with this simple analysis, it seems that the DETACHED COUNTED HANDLE/BODY approach is ahead. Indeed, - with the increasing use of templates this is often the favourite, and is - the principle behind the common - but not standard - counted_ptr. [The Boost name is shared_ptr rather than counted_ptr.]
- -A common implementation of COUNTED BODY is to provide the counting mechanism in a base class that - the counted type is derived from. Either that, or the reference counting - mechanism is provided anew for each class that needs it. Both of these - approaches are unsatisfactory because they are quite closed, coupling a - class into a particular framework. Added to this the non-cohesiveness of - having the count lying dormant in a non-counted object, and you get the - feeling that excepting its use in widespread object models such as COM and - CORBA the COUNTED BODY - approach is perhaps only of use in specialised situations.
-It is the question of openness that convinced me to revisit the - problems with the COUNTED BODY idiom. Yes, there is a certain degree of intrusion - expected when using this idiom, but is there anyway to minimise this and - decouple the choice of counting mechanism from the smart pointer type - used?
- -In recent years the most instructive body of code and specification for - constructing open general purpose components has been the Stepanov and - Lee's STL (Standard Template Library), now part of the C++ standard - library. The STL approach makes extensive use of compile time polymorphism - based on well defined operational requirements for types. For instance, - each container, contained and iterator type is defined by the operations - that should be performable on an object of that type, often with - annotations describing additional constraints. Compile time polymorphism, - as its name suggests, resolves functions at compile time based on function - name and argument usage, i.e. overloading. This is less intrusive, - although less easily diagnosed if incorrect, than runtime poymorphism that - is based on types, names and function signatures.
- -This requirements based approach can be applied to reference counting. - The operations we need for a type to be Countable are loosely:
- -Note that the count is deduced as a part of the abstract state of this - type, and is not mentioned or defined in any other way. The openness of - this approach derives in part from the use of global functions, meaning - that no particular member functions are implied; a perfect way to wrap up - an existing counted body class without modifying the class itself. The - other aspect to the openness comes from a more precise specification of - the operations.
- -For a type to be Countable it must satisfy the following - requirements, where ptr is a non-null - pointer to a single object (i.e. not an array) of the type, and - #function indicates number of calls - to function(ptr):
- -| Expression | - -Return type | - -Semantics and notes | -
| acquire(ptr) | - -no requirement | - -post: acquired(ptr) | -
| release(ptr) | - -no requirement | - -pre: acquired(ptr) - post: acquired(ptr) == #acquire - - #release |
-
| acquired(ptr) | - -convertible to bool | - -return: #acquire > #release | -
| dispose(ptr, ptr) | - -no requirement | - -pre: !acquired(ptr) - post: *ptr no longer usable |
-
Note that the two arguments to dispose - are to support selection of the appropriate type safe version of the - function to be called. In the general case the intent is that the first - argument determines the type to be deleted, and would typically be - templated, while the second selects which template to use, e.g. by - conforming to a specific base class.
- -In addition the following requirements must also be satisfied, where - null is a null pointer to the - Countable type:
- -| Expression | - -Return type | - -Semantics and notes | -
| acquire(null) | - -no requirement | - -action: none | -
| release(null) | - -no requirement | - -action: none | -
| acquired(null) | - -convertible to bool | - -return: false | -
| dispose(null, null) | - -no requirement | - -action: none | -
Note that there are no requirements on these functions in terms of - exceptions thrown or not thrown, except that if exceptions are thrown the - functions themselves should be exception safe.
-Given the Countable requirements for a type, it is possible to - define a generic smart pointer type that uses them for reference counting:
- -
-template<typename countable_type>
-class countable_ptr
-{
-public: // construction and destruction
-
- explicit countable_ptr(countable_type *);
- countable_ptr(const countable_ptr &);
- ~countable_ptr();
-
-public: // access
-
- countable_type *operator->() const;
- countable_type &operator*() const;
- countable_type *get() const;
-
-public: // modification
-
- countable_ptr &clear();
- countable_ptr &assign(countable_type *);
- countable_ptr &assign(const countable_ptr &);
- countable_ptr &operator=(const countable_ptr &);
-
-private: // representation
-
- countable_type *body;
-
-};
-
-
- The interface to this class has been kept intentionally simple, e.g. - member templates and throw specs have been - omitted, for exposition. The majority of the functions are quite simple in - implementation, relying very much on the assign member as a keystone function:
- -
-template<typename countable_type>
-countable_ptr<countable_type>::countable_ptr(countable_type *initial)
- : body(initial)
-{
- acquire(body);
-}
-
-template<typename countable_type>
-countable_ptr<countable_type>::countable_ptr(const countable_ptr &other)
- : body(other.body)
-{
- acquire(body);
-}
-
-template<typename countable_type>
-countable_ptr<countable_type>::~countable_ptr()
-{
- clear();
-}
-
-template<typename countable_type>
-countable_type *countable_ptr<countable_type>::operator->() const
-{
- return body;
-}
-
-template<typename countable_type>
-countable_type &countable_ptr<countable_type>::operator*() const
-{
- return *body;
-}
-
-template<typename countable_type>
-countable_type *countable_ptr<countable_type>::get() const
-{
- return body;
-}
-
-template<typename countable_type>
-countable_ptr<countable_type> &countable_ptr<countable_type>::clear()
-{
- return assign(0);
-}
-
-template<typename countable_type>
-countable_ptr<countable_type> &countable_ptr<countable_type>::assign(countable_type *rhs)
-{
- // set to rhs (uses Copy Before Release idiom which is self assignment safe)
- acquire(rhs);
- countable_type *old_body = body;
- body = rhs;
-
- // tidy up
- release(old_body);
- if(!acquired(old_body))
- {
- dispose(old_body, old_body);
- }
-
- return *this;
-}
-
-template<typename countable_type>
-countable_ptr<countable_type> &countable_ptr<countable_type>::assign(const countable_ptr &rhs)
-{
- return assign(rhs.body);
-}
-
-template<typename countable_type>
-countable_ptr<countable_type> &countable_ptr<countable_type>::operator=(const countable_ptr &rhs)
-{
- return assign(rhs);
-}
-
-
- Conformance to the requirements means that a type can be used with - countable_ptr. Here is an implementation - mix-in class (mix-imp) that confers countability on its derived - classes through member functions. This class can be used as a class - adaptor:
- -
-class countability
-{
-public: // manipulation
-
- void acquire() const;
- void release() const;
- size_t acquired() const;
-
-protected: // construction and destruction
-
- countability();
- ~countability();
-
-private: // representation
-
- mutable size_t count;
-
-private: // prevention
-
- countability(const countability &);
- countability &operator=(const countability &);
-
-};
-
-
- Notice that the manipulation functions are const and that the count - member itself is mutable. This is because - countability is not a part of an object's abstract state: memory - management does not depend on the const-ness or otherwise of an object. I won't include the - definitions of the member functions here as you can probably guess them: - increment, decrement and return the current count, respectively for the - manipulation functions. In a multithreaded environment you should ensure - that such read and write operations are atomic.
- -So how do we make this class Countable? A simple set of - forwarding functions does the job:
- -
-void acquire(const countability *ptr)
-{
- if(ptr)
- {
- ptr->acquire();
- }
-}
-
-void release(const countability *ptr)
-{
- if(ptr)
- {
- ptr->release();
- }
-}
-
-size_t acquired(const countability *ptr)
-{
- return ptr ? ptr->acquired() : 0;
-}
-
-template<class countability_derived>
-void dispose(const countability_derived *ptr, const countability *)
-{
- delete ptr;
-}
-
-
- Any type that now derives from countability may now be used with countable_ptr:
- -
-class example : public countability
-{
- ...
-};
-
-void simple()
-{
- countable_ptr<example> ptr(new example);
- countable_ptr<example> qtr(ptr);
- ptr.clear(); // set ptr to point to null
-} // allocated object deleted when qtr destructs
-
-
- The challenge is to apply COUNTED BODY in a non-intrusive fashion, such that there is no overhead - when an object is not counted. What we would like to do is confer this - capability on a per object rather than on a per class basis. Effectively - we are after Countability on any object, i.e. anything pointed to - by a void *! It goes without saying that - void is perhaps the least committed of any type.
- -The forces to resolve on this are quite interesting, to say the least. - Interesting, but not insurmountable. Given that the class of a runtime - object cannot change dynamically in any well defined manner, and the - layout of the object must be fixed, we have to find a new place and time - to add the counting state. The fact that this must be added only on heap - creation suggests the following solution:
- --struct countable_new; -extern const countable_new countable; - -void *operator new(size_t, const countable_new &); -void operator delete(void *, const countable_new &); --
We have overloaded operator new with a - dummy argument to distinguish it from the regular global operator new. This is comparable to the use of the - std::nothrow_t type and std::nothrow object in the standard library. The - placement operator delete is there to - perform any tidy up in the event of failed construction. Note that this is - not yet supported on all that many compilers.
- -The result of a new expression using - countable is an object allocated on the - heap that has a header block that holds the count, i.e. we have extended - the object by prefixing it. We can provide a couple of features in an - anonymous namespace (not shown) in the implementation file for for - supporting the count and its access from a raw pointer:
- -
-struct count
-{
- size_t value;
-};
-
-count *header(const void *ptr)
-{
- return const_cast<count *>(static_cast<const count *>(ptr) - 1);
-}
-
-
- An important constraint to observe here is the alignment of - count should be such that it is suitably - aligned for any type. For the definition shown this will be the case on - almost all platforms. However, you may need to add a padding member for - those that don't, e.g. using an anonymous union to coalign count - and the most aligned type. Unfortunately, there is no portable way of - specifying this such that the minimum alignment is also observed - this is - a common problem when specifying your own allocators that do not directly - use the results of either new or - malloc.
- -Again, note that the count is not considered to be a part of the - logical state of the object, and hence the conversion from - const to non-const - count is in - effect a mutable type.
- -The allocator functions themselves are fairly straightforward:
- -
-void *operator new(size_t size, const countable_new &)
-{
- count *allocated = static_cast<count *>(::operator new(sizeof(count) + size));
- *allocated = count(); // initialise the header
- return allocated + 1; // adjust result to point to the body
-}
-
-void operator delete(void *ptr, const countable_new &)
-{
- ::operator delete(header(ptr));
-}
-
-
- Given a correctly allocated header, we now need the Countable - functions to operate on const void * to - complete the picture:
- -
-void acquire(const void *ptr)
-{
- if(ptr)
- {
- ++header(ptr)->value;
- }
-}
-
-void release(const void *ptr)
-{
- if(ptr)
- {
- --header(ptr)->value;
- }
-}
-
-size_t acquired(const void *ptr)
-{
- return ptr ? header(ptr)->value : 0;
-}
-
-template<typename countable_type>
-void dispose(const countable_type *ptr, const void *)
-{
- ptr->~countable_type();
- operator delete(const_cast<countable_type *>(ptr), countable);
-}
-
-
- The most complex of these is the dispose function that must ensure that the correct type - is destructed and also that the memory is collected from the correct - offset. It uses the value and type of first argument to perform this - correctly, and the second argument merely acts as a strategy selector, - i.e. the use of const void * - distinguishes it from the earlier dispose shown for const countability *.
-Now that we have a way of adding countability at creation for objects - of any type, what extra is needed to make this work with the - countable_ptr we defined earlier? Good - news: nothing!
- -
-class example
-{
- ...
-};
-
-void simple()
-{
- countable_ptr<example> ptr(new(countable) example);
- countable_ptr<example> qtr(ptr);
- ptr.clear(); // set ptr to point to null
-} // allocated object deleted when qtr destructs
-
-
- The new(countable) expression defines a - different policy for allocation and deallocation and, in common with other - allocators, any attempt to mix your allocation policies, e.g. call - delete on an object allocated with - new(countable), results in undefined - behaviour. This is similar to what happens when you mix new[] with delete or - malloc with delete. The whole point of Countable conformance - is that Countable objects are used with countable_ptr, and this ensures the correct use.
- -However, accidents will happen, and inevitably you may forget to - allocate using new(countable) and instead - use new. This error and others can be - detected in most cases by extending the code shown here to add a check - member to the count, validating the check - on every access. A benefit of ensuring clear separation between header and - implementation source files means that you can introduce a checking - version of this allocator without having to recompile your code.
-There are two key concepts that this article has introduced:
- -The application of the two together gives rise to a new variant of the - essential COUNTED BODY - pattern, UNINTRUSIVE COUNTED BODY. You can take this theme - even further and contrive a simple garbage collection system for C++.
- -The complete code for countable_ptr, - countability, and the countable new is also available.
-Revised - 04 December, 2006
- -Copyright © 1998-1999 Kevlin Henney
- -Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or copy - at http://www.boost.org/LICENSE_1_0.txt)
- - diff --git a/cpp_committee_meetings.html b/cpp_committee_meetings.html deleted file mode 100644 index 26bc51a..0000000 --- a/cpp_committee_meetings.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - -Who can attend C++ Committee meetings? Members of -J16 (the INCITS/ANSI committee) or of a WG21 (ISO) member country committee -("national body" in -ISO-speak). -INCITS has broadened J16 membership requirements so anyone can -join, regardless of nationality or employer.
-In addition, a small number of "technical experts" who are not committee -members can also attend meetings. The "technical expert" umbrella is broad enough to cover -the -Boost members who attend meetings.
-When and where is the next meeting? There are two meetings a year. The -Fall meeting is usually in North America, and the Spring meeting is usually -outside North America. See a general -list of meeting locations and -dates. Detailed information about a particular meeting, including hotel -information, is usually provided in a paper appearing in one of -mailings for the prior meeting. If there isn't a link to -it on the -Meetings web page, you will have to go to -the committee's -Papers page and search a bit.
-Is there a fee for attending meetings? No, but there can be a lot of -incidental expenses like travel, lodging, and meals, and there is a $US 800 a -year INCITS fee to become a voting member.
-What is the schedule? The meetings start at 9:00AM on -Monday, and 8:30AM other days, unless otherwise announced. It is best to arrive -a half-hour early to grab a good seat, some coffee, tea, or donuts, and to say -hello to people. (There is also a Sunday evening a WG21 administrative meeting, -which is closed except to delegates from national bodies.)
-The meetings generally end on Friday, although there is discussion of -extending them one extra day until the next standard ships. The last day the meeting is generally over by 11:00AM. Because -the last day's meeting is for formal votes only, it is primarily of interest only to -actual committee -members.
-Sometimes there are evening technical sessions; the details aren't -usually available until the Monday morning meeting. There may be a -reception one evening, and, yes, significant others are -invited. Again, details usually become available Monday morning.
-What actually happens at the meetings? Monday morning an hour or two -is spent in full committee on administrivia, and then the committee breaks up -into working groups (Core, Library, and Enhancements). The full committee also -gets together later in the week to hear working group progress reports.
-The working groups are where most technical activities take place. Each -active issue that appears on an issues list is discussed, as are papers from the -mailing. Most issues are non-controversial and disposed of in a few minutes. -Technical discussions are often led by long-term committee members, often -referring to past decisions or longstanding working group practice. Sometimes a -controversy erupts. It takes first-time attendees awhile to understand the -discussions and how decisions are actually made. The working group chairperson -moderates.
-Sometimes straw polls are taken. In a straw poll anyone attending can vote, -in contrast to the formal votes taken by the full committee, where only voting -members can vote.
-Lunch break is an hour and a half. Informal subgroups often lunch -together; a lot of technical problems are discussed or actually solved at lunch, -or later at dinner. In many ways these discussions involving only a few people -are the most interesting. Sometimes during the regular meetings, a working group -chair will break off a sub-group to tackle a difficult problem.
-Do I have to stay at the main hotel? No, and committee members on -tight budgets often stay at other, cheaper, hotels. (The main hotels are usually -chosen because they have large meeting rooms available, and thus tend to be pricey.) -The advantage of staying at the main hotel is that it is then easier to -participate in the off-line discussions which can be at least as interesting -as what actually happens in the scheduled meetings.
-What do people wear at meetings? Programmer casual. No neckties -to be seen.
-What should I bring to a meeting? It is almost essential to have a -laptop computer along. There is a committee LAN with a wiki and Internet connectivity. -Wireless connectivity has become the norm, although there is usually a wired hub -or two for those needed wired access.
-What should I do to prepare for a meeting? It is helpful to have -downloaded the mailing or individual papers for the -meeting, and read any papers you are interested in. Familiarize yourself with -the issues lists if you haven't done so already. Decide which of the working -groups you want to attend.
-What is a "Paper"? An electronic document containing issues, -proposals, or anything else the committee is interested in. Very little gets -discussed at a meeting, much less acted upon, unless it is presented in a paper. -Papers are available -to anyone. Papers don't just appear randomly; they become available four (lately -six) times a -year, before and after each meeting. Committee members often refer to a paper by -saying what mailing it was in: "See the pre-Redmond mailing."
-What is a "Mailing"? A mailing is the -set of papers prepared four to six times a year before and after each meeting, -or between meetings. It -is physically just a -.zip or .gz -archive of -all the papers for a meeting. Although the mailing's archive file itself is only available to committee members and technical -experts, the contents (except copies of the standard) are available to the -general public as individual papers. The ways of ISO are -inscrutable.
-What is a "Reflector"? The committee's mailing lists are -called "reflectors". There are a number of them; "all", "core", "lib", and "ext" -are the main ones. As a courtesy, Boost technical experts can be added to -committee reflectors at the request of a committee member.
-Revised -April 17, 2005
-© Copyright Beman Dawes, 2002
-- Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or copy - at http://www.boost.org/LICENSE_1_0.txt) -
- - - - diff --git a/discussion_policy.htm b/discussion_policy.htm deleted file mode 100644 index 3a584af..0000000 --- a/discussion_policy.htm +++ /dev/null @@ -1,370 +0,0 @@ - - - - - - - - - - - |
-
- Home | - -Libraries | - -People | - -FAQ | - -More | -
Email discussion is the tie that binds boost members together into a - community. If the discussion is stimulating and effective, the community - thrives. If the discussion degenerates into name calling and ill will, the - community withers and dies.
- -Other topics related to boost development may be acceptable, at the - discretion of moderators. If unsure, go ahead and post. The moderators will - let you know.
- -Most Boost mailing lists host a great deal of traffic, so your post is - usually competing for attention with many other communications. This - section describes how to make sure it has the desired impact.
- -Don't forget, you're a single writer but there are many readers, and you - want them to stay interested in what you're saying. Saving your readers a - little time and effort is usually worth the extra time you spend when - writing a message. Also, boost discussions are saved for posterity, as - rationales and history of the work we do. A post's usefulness in the future - is determined by its readability.
- -When your post is related to a particular Boost library, it's helpful to - put the library name in square brackets at the beginning of the subject - line, e.g.
- -- Subject: [Regex] Why doesn't this pattern match? -The Boost developers' list is a high-volume mailing list, and - most maintainers don't have time to read every message. A tag on the - subject line will help ensure the right people see your post. - - - -
A common and very useful approach is to cite the small fractions of the - message you are actually responding to and to put your response directly - beneath each citation, with a blank line separating them for - readability:
- --For more information about effective use of quotation in - posts, see this - helpful guide. - --Person-you're-replying-to wrote: - -> Some part of a paragraph that you wish to reply to goes -> here; there may be several lines. - -Your response to that part of the message goes here. There may, -of course, be several lines. - -> The second part of the paragraph that is relevant to your -> reply goes here; agiain there may be several lines. - -Your response to the second part of the message goes here. -... - --
Some email and news clients use poor word wrapping algorithms that leave - successive lines from the same quotation with differing numbers of leading - ">" characters. Microsoft Outlook and Outlook - Express, and some web clients, are especially bad about this. If your - client offends in this way, please take the effort to clean up the mess it - makes in quoted text. Remember, even if you didn't write the original text, - it's your posting; whether you get your point across depends on its - readability.
- -The Microsoft clients also create an unusually verbose header at the - beginning of the original message text and leave the cursor at the - beginning of the message, which encourages users to write their replies - before all of the quoted text rather than putting the reply in context. - Fortunately, Dominic Jain has written a utility that fixes all of these - problems automatically: Outlook - Quotefix for Outlook Users and OE QuoteFix for - users of Outlook Express.
- -A summary of the foregoing thread is only needed after a long - discussion, especially when the topic is drifting or a result has been - achieved in a discussion. The mail system will do the tracking that is - needed to enable mail readers to display message threads (and every decent - mail reader supports that).
- -If you ever have to refer to single message earlier in a thread or in a - different thread then you can use a URL to the message archives. To help to keep those - URLs short, you can use tinyurl.com. - Citing the relevant portion of a message you link to is often helpful (if - the citation is small).
- -When starting a new topic, always send a fresh message, rather - than beginning a reply to some other message and replacing the subject and - body. Many mailers are able to detect the thread you started with and will - show the new message as part of the original thread, which probably isn't - what you intended. Follow this guideline for your own sake as well as for - others'. Often, people scanning for relevant messages will decide they're - done with a topic and hide or kill the entire thread: your message will be - missed, and you won't get the response you're looking for.
- -By the same token, When replying to an existing message, use your - mailer's "Reply" function, so that the reply shows up as part of the - same discussion thread.
- -Do not reply to digests if you are a digest delivery subscriber. - Your reply will not be properly threaded and will probably have the wrong - subject line. Instead, you can reply through the GMane web - interface.
- -The mailing list software automatically limits message and attachment - size to a reasonable amount, typically 75K, which is adjusted from - time-to-time by the moderators. This limit is a courtesy to those who rely - on dial-up Internet access.
- -Prohibited behavior will not be tolerated. The moderators will ban - postings by abusers.
- -Personal insults, argument for the sake of argument, and all the other - behaviors which fall into the "flame war" category are prohibited. - Discussions should focus on technical arguments, not the personality traits - or motives of participants.
- -Attacks on third parties such as software vendors, hardware vendors, or - any other organizations, are prohibited. Boost exists to unite and serve - the entire C++ community, not to disparage the work of others.
- -Does this mean that we ban the occasional complaint or wry remark about - a troublesome compiler? No, but be wary of overdoing it.
- -Discussions which stray from the acceptable topics are strongly - discouraged. While off-topic posts are often well meaning and not as - individually corrosive as other abuses, cumulatively the distraction - damages the effectiveness of discussion.
- -In addition to technical skills, Boost members value collaboration, - acknowledgement of the help of others, and a certain level of politeness. - Boost membership is very international, and ranges widely in age and other - characteristics. Think of discussion as occurring among colleagues in a - widely read forum, rather than among a few close friends.
- -Always remember that the cumulative effort spent by people reading your - contribution scales with the (already large) number of boost members. Thus, - do invest time and effort to make your message as readable as possible. - Adhere to English syntax and grammar rules such as proper capitalization. - Avoid copious informalism, colloquial language, or abbreviations, they may - not be understood by all readers. Re-read your message before submitting - it.
- -Apply social engineering to prevent heated technical discussion from - degenerating into a shouting match, and to actively encourage the - cooperation upon which Boost depends.
- -Avoid Parkinson's Bicycle Shed. Parkinson described a - committee formed to oversee design of an early nuclear power plant. There - were three agenda items - when to have tea, where to put the bicycle shed, - and how to ensure nuclear safety. Tea was disposed of quickly as - trivial. Nuclear safety was discussed for only an hour - it was so - complex, scary, and technical that even among experts few felt comfortable - with the issues. Endless days were then spent discussing construction of - the bicycle shed (the parking lot would be the modern equivalent) because - everyone though they understood the issues and felt comfortable discussing - them.
- -In order to ensure a uniform presentation in books and articles, we have - adopted a convention for referring to Boost libraries. Library names can - either be written in a compact form with a dot, as "Boost.Name", or - in a long form as "the Boost Name library." For example:
- -- Boost.Python serves a very different purpose from the Boost - Graph library. -Note that the word "library" is not part of the name, and as - such isn't capitalized. - -
Please take care to avoid confusion in discussions between libraries - that have been accepted into Boost and those that have not. Acceptance as a - Boost library indicates that the code and design have passed through our - peer-review process; failing to make the distinction devalues the hard work - of library authors who've gone through that process. Here are some - suggested ways to describe potential Boost libraries:
- -Note that this policy only applies to discussions, not to the - documentation, directory structure, or even identifiers in the code of - potential Boost libraries.
-Revised - 04 December, 2006
- -Copyright © 2000-2005 Beman Dawes, Rob Stewart, and David Abrahams
- -Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or copy - at www.boost.org/LICENSE_1_0.txt)
- - diff --git a/error_handling.html b/error_handling.html deleted file mode 100644 index 1436404..0000000 --- a/error_handling.html +++ /dev/null @@ -1,240 +0,0 @@ - - - - - - - -The following paper is a good introduction to some of the issues of - writing robust generic components:
- -- D. Abrahams: ``Exception Safety - in Generic Components'', originally published in M. - Jazayeri, R. Loos, D. Musser (eds.): Generic Programming, Proc. of a - Dagstuhl Seminar, Lecture Notes on Computer Science. Volume. 1766 -- -
The simple answer is: ``whenever the semantic and performance - characteristics of exceptions are appropriate.''
- -An oft-cited guideline is to ask yourself the question ``is this an - exceptional (or unexpected) situation?'' This guideline has an attractive - ring to it, but is usually a mistake. The problem is that one person's - ``exceptional'' is another's ``expected'': when you really look at the - terms carefully, the distinction evaporates and you're left with no - guideline. After all, if you check for an error condition, then in some - sense you expect it to happen, or the check is wasted code.
- -A more appropriate question to ask is: ``do we want stack - unwinding here?'' Because actually handling an exception is likely - to be significantly slower than executing mainline code, you - should also ask: ``Can I afford stack unwinding here?'' For - example, a desktop application performing a long computation might - periodically check to see whether the user had pressed a cancel - button. Throwing an exception could allow the operation to be - cancelled gracefully. On the other hand, it would probably be - inappropriate to throw and handle exceptions in the inner - loop of this computation because that could have a significant - performance impact. The guideline mentioned above has a grain of - truth in it: in time critical code, throwing an exception - should be the exception, not the rule.
- -std::exception. Except in *very* rare
- circumstances where you can't afford the cost of a virtual
- table,
- std::exception makes a reasonable exception base class,
- and when used universally, allows programmers to catch "everything"
- without resorting to catch(...). For more about
- catch(...), see below.
-
-
-#include <iostream>
-struct my_exc1 : std::exception { char const* what() const throw(); };
-struct my_exc2 : std::exception { char const* what() const throw(); };
-struct your_exc3 : my_exc1, my_exc2 {};
-
-int main()
-{
- try { throw your_exc3(); }
- catch(std::exception const& e) {}
- catch(...) { std::cout << "whoops!" << std::endl; }
-}
-
-
-The program above prints "whoops" because the
-C++ runtime can't resolve which exception instance to
-match in the first catch clause.
-
- -- --throw some_exception(); --
There are various ways to avoid copying string objects when - exceptions are copied, including embedding a fixed-length buffer in - the exception object, or managing strings via reference-counting. - However, consider the next point before pursuing either of these - approaches.
-what() message on demand, if you
- feel you really must format the message. Formatting an exception error
- message is typically a memory-intensive operation that could
- potentially throw an exception. This is an operation best delayed until
- after stack unwinding has occurred, and presumably, released some
- resources. It's a good idea in this case to protect your
- what() function with a catch(...) block so
- that you have a fallback in case the formatting code throwswhat()
- message. It's nice to have a message that a programmer stands a
- chance of figuring out, but you're very unlikely to be able to compose
- a relevant and user-comprehensible error message at the point an
- exception is thrown. Certainly, internationalization is beyond the
- scope of the exception class author. Peter Dimov makes an excellent argument
- that the proper use of a what() string is to serve as a
- key into a table of error message formatters. Now if only we could get
- standardized what() strings for exceptions thrown by the
- standard library...what() message is likely to mean that you neglect to
- expose information someone might need in order to make a coherent
- message for users. For example, if your exception reports a numeric
- range error, it's important to have the actual numbers involved
- available as numbers in the exception class' public interface
- where error reporting code can do something intelligent with them. If
- you only expose a textual representation of those numbers in the
- what() string, you will make life very difficult for
- programmers who need to do something more (e.g. subtraction) with them
- than dumb output.As a developer, if I have violated a precondition of a library I'm - using, I don't want stack unwinding. What I want is a core dump or the - equivalent - a way to inspect the state of the program at the exact point - where the problem was detected. That usually means assert() or - something like it.
- -Sometimes it is necessary to have resilient APIs which can stand up to - nearly any kind of client abuse, but there is usually a significant cost - to this approach. For example, it usually requires that each object used - by a client be tracked so that it can be checked for validity. If you - need that sort of protection, it can usually be provided as a layer on - top of a simpler API. Beware half-measures, though. An API which promises - resilience against some, but not all abuse is an invitation to disaster. - Clients will begin to rely on the protection and their expectations will - grow to cover unprotected parts of the interface.
- -Note for Windows developers: unfortunately, the native
- exception-handling used by most Windows compilers actually throws an
- exception when you use assert(). Actually, this is true of other
- programmer errors such as segmentation faults and divide-by-zero errors.
- One problem with this is that if you use JIT (Just In Time) debugging,
- there will be collateral exception-unwinding before the debugger comes up
- because catch(...) will catch these not-really-C++
- exceptions. Fortunately, there is a simple but little-known workaround,
- which is to use the following incantation:
-
-extern "C" void straight_to_debugger(unsigned int, EXCEPTION_POINTERS*)
-{
- throw;
-}
-extern "C" void (*old_translator)(unsigned, EXCEPTION_POINTERS*)
- = _set_se_translator(straight_to_debugger);
-
-
- This technique doesn't work if the SEH is raised from within a catch
- block (or a function called from within a catch block), but it still
- eliminates the vast majority of JIT-masking problems.
-
- Often the best way to deal with exceptions is to not handle them at - all. If you can let them pass through your code and allow destructors to - handle cleanup, your code will be cleaner.
- -catch(...) when possible_set_se_translator hack described above. The result is that
- catch(...) can have the effect of making some unexpected
- system notification at a point where recovery is impossible look just
- like a C++ exception thrown from a reasonable place, invalidating the
- usual safe assumptions that destructors and catch blocks have taken valid
- steps to ensure program invariants during unwinding.
-
- I reluctantly concede this point to Hillel Y. Sims, after many
- long debates in the newsgroups: until all OSes are "fixed", if
- every exception were derived from std::exception and
- everyone substituted
- catch(std::exception&) for catch(...), the
- world would be a better place.
Sometimes, catch(...), is still the most appropriate
- pattern, in spite of bad interactions with OS/platform design choices. If
- you have no idea what kind of exception might be thrown and you really
- must stop unwinding it's probably still your best bet. One obvious
- place where this occurs is at language boundaries.
© Copyright David Abrahams 2001-2003. All rights reserved.
- -Revised - - 21 August, 2003 -
- - - diff --git a/formal_review_process.htm b/formal_review_process.htm index 2f4c161..ca9ae11 100644 --- a/formal_review_process.htm +++ b/formal_review_process.htm @@ -107,7 +107,15 @@ div.admonition p.admonition-title { needs your evaluation of the library. If you identify problems along the way, please note if they are minor, serious, or showstoppers. -Here are some questions you might want to answer in your review:
+The goal of a Boost library review is to improve the library through + constructive criticism, and at the end a decision must be made: is the + library good enough at this point to accept into Boost? If not, we hope to + have provided enough constructive criticism for it to be improved and + accepted at a later time. The Serialization library is a good example of how + constructive criticism resulted in revisions resulting in an excellent + library that was accepted in its second review.
+ +Here are some questions you might want to answer in your review:
Many reviews include questions for library authors. Authors are
+ interested in defending their library against your criticisms; otherwise
+ they would not have brought their library up for review. If you don't get a
+ response to your question quickly, be patient; if it takes too long or you
+ don't get an answer you feel is sufficient, ask again or try to rephrase the
+ question. Do remember that English is not the native language for many
+ Boosters, and that can cause misunderstandings.
+
+ E-mail is a poor communication medium, and even if messages rarely get lost
+ in transmission, they often get drowned in the deluge of other messages.
+ Don't assume that an unanswered message means you're being ignored. Given
+ constructively, criticism will be taken better and have more positive
+ effects, and you'll get the answers you want.
At the conclusion of the comment period, the Review Manager will post a message to the mailing list saying if the library has been accepted or @@ -192,9 +214,12 @@ div.admonition p.admonition-title {
Revised + 10 October, 2006
To qualify for fast track review:
diff --git a/formal_review_schedule.html b/formal_review_schedule.html index 219c4b5..d0409ab 100644 --- a/formal_review_schedule.html +++ b/formal_review_schedule.html @@ -1,17 +1,16 @@ - + - - - +|
|
@@ -34,7 +33,8 @@ track review manager assignments and libraries reviewed but not yet posted on
the web site. There is often a lag between acceptance and site posting as
authors address issues raised in the formal review.
| Submission | Submitter | @@ -46,26 +46,144 @@ authors address issues raised in the formal review.|||||||
| Function Types (Re-review) | -Tobias Schwinger | -Boost Sandbox Vault | -Tom Brinkman | +Finite State Machines | +Andrey Semashev | ++ Boost Sandbox Vault | +Martin Vuille | - |
| Message Passing | -Doug Gregor | -- - http://www.osl.iu.edu/~dgregor/boost.mpi/boost-mpi-20060628.tgz | +Floating Point Utilities | +Johan Råde | ++ Boost Sandbox Vault | Needed | - | |
| Switch | +Steven Watanabe | ++ Boost Sandbox Vault | +Stejpan Rajko | +January 5, 2008 - January 9, 2008 | +||||
| Property Map (fast-track) | +Andrew Sutton | ++ Boost Sandbox | +Jeremy Siek | +- | +||||
| Graph (fast-track) | +Andrew Sutton | ++ Boost Sandbox | +Jeremy Siek | +- | +||||
| Forward (fast-track) | +Tobias Schwinger | ++ Boost Sandbox Vault | +John Torjo | +January 14, 2008 - January 18, 2008 | +||||
| Singleton (fast-track) | +Tobias Schwinger | ++ Boost Sandbox Vault | +John Torjo | +December 3, 2007 - December 7, 2007 | +||||
| Factory (fast-track) | +Tobias Schwinger | ++ Boost Sandbox Vault | +John Torjo | +December 17, 2007 - December 21, 2007 | +||||
| Lexer | +Ben Hanson | ++ Boost Sandbox Vault | +Hartmut Kaiser | +- | +||||
| Thread-Safe Signals | +Frank Hess | ++ Boost Sandbox Vault | +Needed | +- | +||||
| Logging | +John Torjo | +http://torjo.com/log2/ | +Gennadiy Rozental | +February 4, 2008 - February 13, 2008 | +||||
| Flyweight | +Joaquín Mª López Muñoz | ++ Boost Sandbox Vault | +Ion Gaztañaga | +January 21, 2008 - January 30, 2008 | +||||
| Unordered Containers | +Daniel James | +Boost Sandbox Vault | +Ion Gaztañaga | +December 7, 2007 - December 16, 2007 | +||||
| Boost.Range (Update) | +Neil Groves | ++ Boost Sandbox Vault | +Needed | +- | +
| Submission | Submitter | @@ -76,6 +194,151 @@ authors address issues raised in the formal review.Result | |||||
| Review Wizard Status Report | ++ | Ronald Garcia | +2007 November 16 | +Report | +|||
| Exception | +Emil Dotchevski | +Tobias Schwinger | +September 27, 2007 - October 7, 2007 | ++ Accepted | +|||
| Review Wizard Status Report | ++ | Ronald Garcia | +2007 September 14 | +Report | +|||
| Scope Exit | +Alexander Nasonov | +Jody Hagins | +August 13, 2007 - August 22, 2007- | ++ Pending | +|||
| Time Series | +Eric Niebler | +John R. Phillips | +July 30, 2007 - August 13, 2007 | ++ Accepted | +|||
| Boost 1.34.1 Released | ++ | Thomas Witt | +July 24, 2007 | ++ Notes | +|||
| Boost 1.34.0 Released | ++ | Thomas Witt | +May 12, 2007 | ++ Notes | +|||
| Globally Unique Identifier | +Andy Tompkins | +Hartmut Kaiser | +April 30, 2007 - May 10, 2007 | ++ Accepted Provisionally | +|||
| Math Toolkit | +John Maddock | +Matthias Schabel | +April 11, 2007 - April 27, 2007 | ++ Accepted -- Added to SVN | +|||
| Quantitative Units | +Matthias Schabel | +John R. Phillips | +March 26, 2007 - April 4, 2007 | ++ Accepted | +|||
| Intrusive Containers | +Ion Gaztañaga | +Joaquín Mª López Muñoz | +March 12, 2007 - March 21, 2007 | ++ Accepted -- Added to CVS | +|||
| Bimap | +Matias Capeletto | +Ion Gaztañaga | +February 15 2007- March 2, 2007 | ++ Accepted -- Added to CVS | +|||
| Accumulators | +Eric Niebler | +John R. Phillips | +January 29, 2007 - February 7, 2007 | ++ Accepted | +|||
| Function Types (Re-review) | +Tobias Schwinger | +Tom Brinkman | +2006 November 6 - 2006 November 17 | ++ Accepted -- Added to CVS | +|||
| Generic Image Library | +Lubomir Bourdev | +Tom Brinkman | +2006 October 5 - 2006 October 25 | ++ Accepted -- Added to CVS | +|||
| Message Passing | +Doug Gregor | +Jeremy Siek | +2006 September 6 - 2006 September 15 | ++ Accepted -- Added to CVS | +|||
| Physical Quantities System | Andy Little | @@ -90,8 +353,8 @@ authors address issues raised in the formal review.Asger Mangaard | Rene Rivera | 2006 May 15 - 2006 May 24 | -- Pending | ++ Rejected | |
| Ronald Garcia | 2006 May 1 - 2006 May 10 | - Accepted | + Accepted -- Added to CVS|||||
| Thorsten Ottosen | 2006 April 18 - 2006 April 30 | - Accepted | + Accepted -- Added to CVS|||||
| Tobias Schwinger | 2006 April 1 - 2006 April 9 | - Accepted | + Accepted -- Added to CVS|||||
| Review Wizard Status Report | @@ -129,13 +393,13 @@ authors address issues raised in the formal review. | ||||||
| Shmem | -Ion Gaztanaga | +Shmem (now Interprocess) | +Ion Gaztañaga | Fred Bertsch | 2006 February 6 - 2006 February 15 | - Accepted | + Accepted -- Added to CVS|
| Jeff Garland | 2005 December 10 - 2005 December 30 |
- Accepted | + Accepted -- Added to CVS|||||
| John Maddock | Beman Dawes | 2005 September 24 - 2005 October 5 | -Accepted -- added to cvs | +Accepted -- Added in 1.34 | |||
| Eric Niebler | Thomas Witt | 2005 September 8 - 2005 September 18 | -Accepted -- Added to CVS | +Accepted -- Added in 1.34 | |||
| Arkadiy Vertleyb and Peder Holt | Andy Little | 2005 May 20 - 2005 May 30 | -Accepted -- Added to CVS | +Accepted -- Added in 1.34 | |||
| Eric Niebler | Gennadiy Rozental | 2005 April 25 - 2005 May 1 | -Accepted -- Added to CVS | +Accepted -- Added in 1.34 | |||
| Andreas Huber | Pavel Vozenilek | 2005 Feb 23 - 2005 March 9 | -Accepted -- Added to CVS | +Accepted -- Added in 1.34 | |||
| Wave | @@ -348,29 +612,30 @@ authors address issues raised in the formal review.Accepted -- Added in 1.32 | ||||||
| Container Traits (renamed boost.range) | +Container Traits (now Range) | Thorsten Ottosen | Hartmut Kaiser | 2004 Apr 28 - May 7 | Accepted -- Added in 1.32 | ||
| Indexed Set | -Joaqu� M L�ez Mu�z | +Indexed Set (now MultiIndex) | +Joaquín Mª López Muñoz | Pavel Vozenilek | 2004 Mar 20 - 30 | -Accepted -- Added in 1.32 | ++ Accepted -- Added in 1.32 |
| Circular Buffer | Jan Gaspar | Pavel Vozenilek | 2004 Mar 5 - 15 | -Accepted -- not added yet | +Accepted -- Added to CVS | ||
| enable_if | -Jaakko Järvi & Jeremiah Willcock & Andrew Lumsdaine | +Jaakko Järvi & Jeremiah Willcock & Andrew Lumsdaine | (fasttrack) | Dec 2003 | Accepted -- added in 1.31 | @@ -461,7 +726,7 @@ authors address issues raised in the formal review.||
| Minmax | -Hervé Bronnimann | +Hervé Bronnimann | Thomas Witt | 28 Sep - 07 Oct 2002 | Accepted -- added in 1.32 | @@ -475,7 +740,7 @@ authors address issues raised in the formal review.||
| Interval Arithmetic Library | -Hervé Bronnimann & Guillaume Melquiond & Sylvain Pion | +Hervé Bronnimann & Guillaume Melquiond & Sylvain Pion | Beman Dawes | 31 Aug - 09 Sep 2002 | Accepted -- added in 1.30 | @@ -510,7 +775,7 @@ authors address issues raised in the formal review.||
| Lambda | -Jaakko J�vi & Gary Powell | +Jaakko Järvi & Gary Powell | Aleksey Gurtovoy | 08 - 20 Mar 2002 | Accepted and added | @@ -601,7 +866,7 @@ authors address issues raised in the formal review.||
| Tuples Library | -Jaakko J�vi | +Jaakko Järvi | Beman Dawes | Jun 17 - 26 | Accepted and added | @@ -632,7 +897,9 @@ authors address issues raised in the formal review.using a special debug build of Python. | |
| d | -building a debug version of your code.7 | +building a debug version of your code.7 | |||||
| p | using the STLPort standard library rather than the default one supplied with your compiler. | ||||||
| n | -using STLPort's deprecated “native iostreams†feature.8 | +using STLPort's deprecated “native iostreams†feature.8 |
To test our subject extraction, we'll filter the following text file. Copy it out of your browser and save it as jayne.txt:
@@ -757,7 +759,7 @@ Spoil Rock Hunter?â€
This concludes your introduction to Boost and to integrating it with your programs. As you start using Boost in earnest, there are surely a few additional points you'll wish we had covered. One day @@ -786,7 +788,7 @@ mailing list.
| [4] | In this example, the caret character ^ is a -way of continuing the command on multiple lines. The command -prompt responds with More? to prompt for more input. Feel -free to omit the carets and subsequent newlines; we used them so -the example would fit on a page of reasonable width. |
| [4] | In this example, the caret character ^ is a +way of continuing the command on multiple lines, and must be the +final character used on the line to be continued (i.e. do +not follow it with spaces). The command prompt responds with +More? to prompt for more input. Feel free to omit the +carets and subsequent newlines; we used them so the example +would fit on a page of reasonable width. +The command prompt treats each bit of whitespace in the command +as an argument separator. That means quotation marks (") +are required to keep text together whenever a single +command-line argument contains spaces, as in ++--build-dir="C:\Documents_and_Settings\dave\build-boost" ++ Also, for example, you can't add spaces around the = sign as in ++--build-dir_=_"C:\Documents and Settings\dave\build-boost" ++ |
| [6] | This convention distinguishes the static version of + | ||||
| [6] | This convention distinguishes the static version of a Boost library from the import library for an identically-configured Boost DLL, which would otherwise have the same name. |
| [7] | These libraries were compiled without optimization + | ||||
| [7] | These libraries were compiled without optimization or inlining, with full debug symbols enabled, and without NDEBUG #defined. Although it's true that sometimes these choices don't affect binary compatibility with other @@ -856,7 +872,7 @@ compiled code, you can't count on that with Boost libraries. |
| [8] | This feature of STLPort is deprecated because it's + | ||||
| [8] | This feature of STLPort is deprecated because it's impossible to make it work transparently to the user; we don't recommend it. |
|
- Home | -Libraries | -People | -FAQ | -More | -
Header files are the place where a library comes into contact with user code -and other libraries. To co-exist peacefully and productively, headers must -be "good neighbors".
-Here are the standards for boost headers. Many of -these are also reasonable guidelines for general use. -
// Boost general library furball.hpp header file ---------------------------// - - < Copyright and license notice, as indicated in the license page > - -// See http://www.boost.org/ for latest version. - -#ifndef BOOST_FURBALL_HPP -#define BOOST_FURBALL_HPP - -namespace boost { - -// Furball class declaration -----------------------------------------------// - - class furball - { - public: - void throw_up(); - private: - int whatever; - }; // furball - -} // namespace - -#endif // include guard-
The alert reader will have noticed that the sample -header employs a certain coding style for indentation, positioning braces, -commenting ending braces, and similar formatting issues. These stylistic -issues are viewed as personal preferences and are not part of the Boost Header -Policy.
-Revised 02 October, 2003
- -© Copyright Beman Dawes 1998
-- Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or copy - at http://www.boost.org/LICENSE_1_0.txt) -
- - - - \ No newline at end of file diff --git a/imp_vars.htm b/imp_vars.htm deleted file mode 100644 index 0b61012..0000000 --- a/imp_vars.htm +++ /dev/null @@ -1,211 +0,0 @@ - - - - - - - - |
- Home | -Libraries | -People | -FAQ | -More | -
The interface specifications for boost.org library components (as well as for -quality software in general) are conceptually separate from implementations of -those interfaces. This may not be obvious, particularly when a component is -implemented entirely within a header, but this separation of interface and -implementation is always assumed. From the perspective of those concerned with -software design, portability, and standardization, the interface is what is -important, while the implementation is just a detail.
-Dietmar Kühl, one of the original boost.org contributors, comments "The -main contribution is the interface, which is augmented with an implementation, -proving that it is possible to implement the corresponding class and providing a -free implementation."
- -There may be a need for multiple implementations of an interface, to -accommodate either platform dependencies or performance tradeoffs. Examples of -platform dependencies include compiler shortcomings, file systems, thread -mechanisms, and graphical user interfaces. The classic example of a performance -tradeoff is a fast implementation which uses a lot of memory versus a slower -implementation which uses less memory.
-Boost libraries generally use a configuration -header, boost/config.hpp, to capture compiler and platform -dependencies. Although the use of boost/config.hpp is not required, it is -the preferred approach for simple configuration problems.
-The Boost policy is to avoid platform dependent variations in interface -specifications, but supply implementations which are usable over a wide range of -platforms and applications. That means boost libraries will use the -techniques below described as appropriate for dealing with platform -dependencies.
-The Boost policy toward implementation variations designed to enhance -performance is to avoid them unless the benefits greatly exceed the full -costs. The term "full costs" is intended to include both -tangible costs like extra maintenance, and intangible cost like increased -difficulty in user understanding.
- -Several techniques may be used to provide implementation variations. Each is -appropriate in some situations, and not appropriate in other situations.
-The first technique is to simply not provide implementation variation at -all. Instead, provide a single general purpose implementation, and forgo -the increased complexity implied by all other techniques.
-Appropriate: When it is possible to write a single portable -implementation which has reasonable performance across a wide range of -platforms. Particularly appropriate when alternative implementations differ only -in esoteric ways.
-Not appropriate: When implementation requires platform specific -features, or when there are multiple implementation possible with widely -differing performance characteristics.
-Beman Dawes comments "In design discussions some implementation is often -alleged to be much faster than another, yet a timing test discovers no -significant difference. The lesson is that while algorithmic differences may -affect speed dramatically, coding differences such as changing a class from -virtual to non-virtual members or removing a level of indirection are unlikely -to make any measurable difference unless deep in an inner loop. And even in an -inner loop, modern CPUs often execute such competing code sequences in the -same number of clock cycles! A single general purpose implementation is -often just fine."
-Or as Donald Knuth said, "Premature optimization is the root of all -evil." (Computing Surveys, vol 6, #4, p 268).
-While the evils of macros are well known, there remain a few cases where -macros are the preferred solution:
----
-- Preventing multiple inclusion of headers via #include guards.
-- Passing minor configuration information from a configuration - header to other files.
-
Appropriate: For small compile-time variations which would -otherwise be costly or confusing to install, use, or maintain. More appropriate -to communicate within and between library components than to communicate with -library users.
-Not appropriate: If other techniques will do.
-To minimize the negative aspects of macros:
----
-- Only use macros when they are clearly superior to other - techniques. They should be viewed as a last resort.
-- Names should be all uppercase, and begin with the namespace name. This - will minimize the chance of name collisions. For example, the #include - guard for a boost header called foobar.h might be named BOOST_FOOBAR_H.
-
A library component can have multiple variations, each contained in its own -separate file or files. The files for the most appropriate variation are -copied to the appropriate include or implementation directories at installation -time.
-The way to provide this approach in boost libraries is to include specialized -implementations as separate files in separate sub-directories in the .ZIP -distribution file. For example, the structure within the .ZIP distribution file -for a library named foobar which has both default and specialized variations -might look something like:
---foobar.h // The default header file -foobar.cpp // The default implementation file -readme.txt // Readme explains when to use which files -self_contained/foobar.h // A variation with everything in the header -linux/foobar.cpp // Implementation file to replace the default -win32/foobar.h // Header file to replace the default -win32/foobar.cpp // Implementation file to replace the default-
Appropriate: When different platforms require different -implementations, or when there are major performance differences between -possible implementations.
-Not appropriate: When it makes sense to use more that one of the -variations in the same installation.
-Rather than have several implementation variations of a single component,
-supply several separate components. For example, the Boost library currently
-supplies scoped_ptr and shared_ptr classes rather than
-a single smart_ptr class parameterized to distinguish between the
-two cases. There are several ways to make the component choice:
---
-- Hardwired by the programmer during coding.
-- Chosen by programmer written runtime logic (trading off some extra - space, time, and program complexity for the ability to select the - implementation at run-time.)
-
Appropriate: When the interfaces for the variations diverge, and when -it is reasonably to use more than one of the variations. When run-time selection -of implementation is called for.
-Not appropriate: When the variations are data type, traits, or -specialization variations which can be better handled by making the component a -template. Also not appropriate when choice of variation is best done by some -setup or installation mechanism outside of the program itself. Thus -usually not appropriate to cope with platform differences.
-Note: There is a related technique where the interface is specified as -an abstract (pure virtual) base class (or an interface definition language), and -the implementation choice is passed off to some third-party, such as a -dynamic-link library or object-request broker. While that is a powerful -technique, it is way beyond the scope of this discussion.
-Turning a class or function into a template is often an elegant way to cope -with variations. Template-based approaches provide optimal space and time -efficiency in return for constraining the implementation selection to compile -time.
-Important template techniques include:
----
-- Data type parameterization. This allows a single component to - operate on a variety of data types, and is why templates were originally - invented.
-- Traits parameterization. If parameterization is complex, bundling - up aspects into a single traits helper class can allow great variation - while hiding messy details. The C++ Standard Library provides - several examples of this idiom, such as
-iterator_traits<>- (24.3.1 lib.iterator.traits) and char_traits<> (21.2 - lib.char.traits).- Specialization. A template parameter can be used purely for the - purpose of selecting a specialization. For example:
-----SomeClass<fast> my_fast_object; // fast and small are empty classes -SomeClass<small> my_small_object; // used just to select specialization-
Appropriate: When the need for variation is due to data type or -traits, or is performance related like selecting among several algorithms, and -when a program might reasonably use more than one of the variations.
-Not appropriate: When the interfaces for variations are -different, or when choice of variation is best done by some mechanism outside of -the program itself. Thus usually not appropriate to cope with platform -differences.
-Revised 02 October, 2003
- -© Copyright Beman Dawes 2001
- -Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or copy - at http://www.boost.org/LICENSE_1_0.txt) -
- - - - \ No newline at end of file diff --git a/index.htm b/index.htm index 4d53dcb..5a5ff17 100644 --- a/index.htm +++ b/index.htm @@ -79,6 +79,9 @@ to request new library features.C++ Committee Meetings FAQ for Boost Members wishing to attend a standards committee meeting.
+An overview of Boost participation in + Google Summer of Code™ 2006 A report of our first experience + in this open source initiative.
Version History Changes and additions in past Boost releases.
diff --git a/int_const_guidelines.htm b/int_const_guidelines.htm deleted file mode 100644 index 6159086..0000000 --- a/int_const_guidelines.htm +++ /dev/null @@ -1,328 +0,0 @@ - - - - - - - -Integral Constant Expressions are used in many places in C++; -as array bounds, as bit-field lengths, as enumerator -initialisers, and as arguments to non-type template parameters. -However many compilers have problems handling integral constant -expressions; as a result of this, programming using non-type -template parameters in particular can be fraught with difficulty, -often leading to the incorrect assumption that non-type template -parameters are unsupported by a particular compiler. This short -article is designed to provide a set of guidelines and -workarounds that, if followed, will allow integral constant -expressions to be used in a manner portable to all the compilers -currently supported by boost. Although this article is mainly -targeted at boost library authors, it may also be useful for -users who want to understand why boost code is written in a -particular way, or who want to write portable code themselves.
- -Integral constant expressions are described in section 5.19 of -the standard, and are sometimes referred to as "compile time -constants". An integral constant expression can be one of -the following:
- -
- const int my_INTEGRAL_CONSTANT = 3;struct myclass
- { static const int value = 0; };struct myclass
- { enum{ value = 0 }; };sizeof expression, for
- example:sizeof(foo(a, b, c))static_cast, where the
- target type is an integral or enumerator type, and the
- argument is either another integral constant expression,
- or a floating-point literal.INTEGRAL_CONSTANT1 op INTEGRAL_CONSTANT2
- provided that the operator is not an assignment
- operator, or comma operator.op INTEGRAL_CONSTANT1
- provided that the operator is not the increment or
- decrement operator.- -
The following guidelines are declared in no particular order (in -other words you need to obey all of them - sorry!), and may also -be incomplete, more guidelines may be added as compilers change -and/or more problems are encountered.
- -When declaring constants that are class members always -use the macro BOOST_STATIC_CONSTANT.
- -template <class T>
-struct myclass
-{
- BOOST_STATIC_CONSTANT(int, value = sizeof(T));
-};
-
-Rationale: not all compilers support inline initialisation of -member constants, others treat member enumerators in strange ways -(they're not always treated as integral constant expressions). -The BOOST_STATIC_CONSTANT macro uses the most appropriate method -for the compiler in question.
- -Don't declare integral constant expressions whose type -is wider than int.
- -Rationale: while in theory all integral types are usable in -integral constant expressions, in practice many compilers limit -integral constant expressions to types no wider than int.
- -Don't use logical operators in integral constant -expressions; use template meta-programming instead.
- -The header <boost/type_traits/ice.hpp> contains a number -of workaround templates, that fulfil the role of logical -operators, for example instead of:
- -INTEGRAL_CONSTANT1 || INTEGRAL_CONSTANT2
Use:
- -::boost::type_traits::ice_or<INTEGRAL_CONSTANT1,INTEGRAL_CONSTANT2>::value
Rationale: A number of compilers (particularly the Borland and -Microsoft compilers), tend to not to recognise integral constant -expressions involving logical operators as genuine integral -constant expressions. The problem generally only shows up when -the integral constant expression is nested deep inside template -code, and is hard to reproduce and diagnose.
- -Don't use any operators in an integral constant -expression used as a non-type template parameter
- -Rather than:
- -typedef myclass<INTEGRAL_CONSTANT1 ==
-INTEGRAL_CONSTANT2> mytypedef;
Use:
- -typedef myclass< some_symbol> mytypedef;
Where some_symbol is the symbolic name of a an
-integral constant expression whose value is (INTEGRAL_CONSTANT1
-== INTEGRAL_CONSTANT2).
Rationale: the older EDG based compilers (some of which are -used in the most recent version of that platform's compiler), -don't recognise expressions containing operators as non-type -template parameters, even though such expressions can be used as -integral constant expressions elsewhere.
- -Always use a fully qualified name to refer to an -integral constant expression.
- -For example:
- -typedef myclass< ::boost::is_integral<some_type>::value> mytypedef;Rationale: at least one compiler (Borland's), doesn't -recognise the name of a constant as an integral constant -expression unless the name is fully qualified (which is to say it -starts with ::).
- -Always leave a space after a '<' and before '::'
- -For example:
- -typedef myclass< ::boost::is_integral<some_type>::value> mytypedef;
- ^
- ensure there is space here!Rationale: <: is a legal digraph in it's own right, so <:: -is interpreted as the same as [:.
- -Don't use local names as integral constant expressions
- -Example:
- -template <class T>
-struct foobar
-{
- BOOST_STATIC_CONSTANT(int, temp = computed_value);
- typedef myclass<temp> mytypedef; // error
-};
-
-Rationale: At least one compiler (Borland's) doesn't accept -this.
- -Although it is possible to fix this by using:
- -template <class T>
-struct foobar
-{
- BOOST_STATIC_CONSTANT(int, temp = computed_value);
- typedef foobar self_type;
- typedef myclass<(self_type::temp)> mytypedef; // OK
-};
-
-This breaks at least one other compiler (VC6), it is better to -move the integral constant expression computation out into a -separate traits class:
- -template <class T>
-struct foobar_helper
-{
- BOOST_STATIC_CONSTANT(int, temp = computed_value);
-};
-
-template <class T>
-struct foobar
-{
- typedef myclass< ::foobar_helper<T>::value> mytypedef; // OK
-};
-
-Don't use dependent default parameters for non-type -template parameters.
- -For example:
- -template <class T, int I = ::boost::is_integral<T>::value> // Error can't deduce value of I in some cases. -struct foobar;- -
Rationale: this kind of usage fails for Borland C++. Note that -this is only an issue where the default value is dependent upon a -previous template parameter, for example the following is fine:
- -template <class T, int I = 3> // OK, default value is not dependent -struct foobar;- -
- -
The following issues are either unresolved or have fixes that -are compiler specific, and/or break one or more of the coding -guidelines.
- -Be careful of numeric_limits
- -There are three issues here:
- -template <class T>
-struct limits_test
-{
- BOOST_STATIC_ASSERT(::std::numeric_limits<T>::is_specialized);
-};
-
-This code fails to compile with VC6 even though no instances
-of the template are ever created; for some bizarre reason ::std::numeric_limits<T>::is_specialized
-always evaluates to false, irrespective of what the
-template parameter T is. The problem seems to be confined to
-expressions which depend on std::numeric_limts: for example if
-you replace ::std::numeric_limits<T>::is_specialized
-with ::boost::is_arithmetic<T>::value, then
-everything is fine. The following workaround also works but
-conflicts with the coding guidelines:
template <class T>
-struct limits_test
-{
- BOOST_STATIC_CONSTANT(bool, check = ::std::numeric_limits<T>::is_specialized);
- BOOST_STATIC_ASSERT(check);
-};
-
-So it is probably best to resort to something like this:
- -template <class T>
-struct limits_test
-{
-#ifdef BOOST_MSVC
- BOOST_STATIC_CONSTANT(bool, check = ::std::numeric_limits<T>::is_specialized);
- BOOST_STATIC_ASSERT(check);
-#else
- BOOST_STATIC_ASSERT(::std::numeric_limits<T>::is_specialized);
-#endif
-};
-
-Be careful how you use the sizeof operator
- -As far as I can tell, all compilers treat sizeof expressions -correctly when the argument is the name of a type (or a template-id), -however problems can occur if:
- -Don't use boost::is_convertible unless you have to
- -Since is_convertible is implemented in terms of the sizeof -operator, it consistently gives the wrong value when used with -the Metroworks compiler, and may not compile with the Borland's -compiler (depending upon the template arguments used).
- -© Copyright Dr John Maddock 2001
-Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or copy - at http://www.boost.org/LICENSE_1_0.txt)
- -- -
- - diff --git a/lib_guide.htm b/lib_guide.htm deleted file mode 100644 index f258260..0000000 --- a/lib_guide.htm +++ /dev/null @@ -1,931 +0,0 @@ - - - -
|
-
- |
- - Home - - | -- Libraries - | -- People - | -- - FAQ - | -- More - | -
- Introduction
- Requirements
- License requirements
- Portability requirements
-
- Ownership
- Guidelines
- Design and
- programming
- Directory structure and
- filenames
- Naming
- consistency
-
- Documentation
- Rationale
- Exception-specification rationale
- Naming conventions rationale
- Source code fonts
- rationale
-
- Tabs rationale
- ECMAScript/JavaScript
- rationale
- Rationale
- rationale
- Acknowledgements
- rationale
-
- This page describes requirements and guidelines for the content of a - library submitted to Boost. -
-- See the Boost Library Submission - Process page for a description of the process involved. -
- -- To avoid the frustration and wasted time of a proposed library being - rejected, it must meets these requirements: -
-- There's no requirement that an author read the mailing list for a time - before making a submission. It has been noted, however, that submissions - which begin "I just started to read this mailing list ..." seem to fail, - often embarrassingly. -
-- The preferred way to meet the license requirements is to use the Boost Software License. See license information. If for any reason you do not - intend to use the Boost Software License, please discuss the issues on the - Boost developers mailing list first. -
- -- The license requirements: -
-- A library's interface must portable and not restricted to a particular - compiler or operating system. -
-- A library's implementation must if possible be portable and not - restricted to a particular compiler or operating system. If a - portable implementation is not possible, non-portable constructions are - acceptable if reasonably easy to port to other environments, and - implementations are provided for at least two popular operating systems - (such as UNIX and Windows). -
- -- There is no requirement that a library run on C++ compilers which do - not conform to the ISO standard. -
-- - There is no requirement that a library run on any particular C++ - compiler. Boost contributors often try to ensure their libraries - work with popular compilers. The boost/config.hpp configuration header is the preferred - mechanism for working around compiler deficiencies. -
-- Since there is no absolute way to prove portability, many boost submissions - demonstrate practical portability by compiling and executing correctly with - two different C++ compilers, often under different operating systems. - - Otherwise reviewers may disbelieve that porting is in fact practical. -
-- Are you sure you own the library you are thinking of - submitting? "How to Copyright Software" by MJ Salone, Nolo - Press, 1990 says: -
- ---- Doing work on your own time that is very similar to programming you do - for your employer on company time can raise nasty legal problems. - In this situation, it's best to get a written release from your employer - in advance. -
-
- Place a copyright notice in all the important files you submit. Boost won't - accept libraries without clear copyright information. -
- -- Please use these guidelines as a checklist for preparing the content a - library submission. Not every guideline applies to every library, but - a reasonable effort to comply is expected. -
-xml_parser instead of XML_parser).
- LICENSE_1_0.txt with their libraries: Boost
- distributions already include a copy in the Boost root directory.// See http://www.boost.org/libs/foo/ for library home
- page.foo is the directory name (see below) for the
- library. As well as aiding users who come across a Boost file
- detached from its documentation, some of Boost's automatic tools
- depend on this comment to identify which library header files belong
- to.
- min()
- and max() macros. Some platform headers define
- min() and max() macros which cause some common
- C++ constructs to fail to compile. Some simple tricks can protect your code
- from inappropriate macro substitution:std::min() or
- std::max():(std::min)(a,b).
- #include <boost/config.hpp>
- BOOST_USING_STD_MIN(); to bring
- std::min() into the current scope.
- min BOOST_PREVENT_MACRO_SUBSTITUTION
- (a,b); to make an argument-dependent call to
- min(a,b).
- std::numeric_limits<int>::max(), use
- (std::numeric_limits<int>::max)() instead.
- min() or max()
- member function, instead to doing obj.min(), use
- (obj.min)().min or max, then you must use the
- BOOST_PREVENT_MACRO_SUBSTITUTION macro. Instead of writing
- int min() { return 0; } you should write int min
- BOOST_PREVENT_MACRO_SUBSTITUTION () { return 0; }--- Boost standard sub-directory names - -
--
-- -- Sub-directory - -- Contents - - -- Required - -- -- -build- -- Library build files such as a Jamfile. - -- If any build files. - -- - -- - -doc-- Documentation (HTML) files. - -- If several doc files. - -- -- -example-- Sample program files. - -- If several sample files. - - -- -- -src-- Source files which must be compiled to build the library. - - -- If any source files. - -- -- -test-- - Regression or other test programs or scripts. - -- If several test files. - -
- The primary directory should always contain a file named index.html (or - index.htm). Authors have requested this so that they can publish URL's in - the form http://www.boost.org/libs/lib-name with the assurance a - documentation reorganization won't invalidate the URL. Boost's internal - tools are also simplified by knowing that a library's documentation is - always reachable via the simplified URL. -
-- If the documentation is in a doc sub-directory, the primary directory - index.html file should just do an automatic redirection to the doc - subdirectory: -
-- ---<html> -<head> -<meta http-equiv="refresh" content="0; URL=doc/index.html"> -</head> -<body> -Automatic redirection failed, please go to -<a href="doc/index.html">doc/index.html</a> - -</body> -</html> --
- As library developers and users have gained experience with Boost, the - following consistent naming approach has come to be viewed as very helpful, - particularly for larger libraries that need their own header subdirectories - and namespaces. -
- -- Here is how it works. The library is given a name that describes the - contents of the library. Cryptic abbreviations are strongly discouraged. - Following the practice of the C++ Standard Library, names are usually - singular rather than plural. For example, a library dealing with file - systems might chose the name "filesystem", but not "filesystems", "fs" or - "nicecode". -
-- When documenting Boost libraries, follow these conventions (see also the - following section of this document): -
-- Here are a few examples of how to apply these conventions: -
-- Even the simplest library needs some documentation; the amount should be - proportional to the need. The documentation should assume the readers - have a basic knowledge of C++, but are not necessarily experts. -
- -- The format for documentation should be HTML, and should not require an - advanced browser or server-side extensions. Style sheets are acceptable. - ECMAScript/JavaScript is not acceptable. The documentation entry point - should always be a file named index.html or index.htm; see Redirection. -
-- There is no single right way to do documentation. HTML documentation is - often organized quite differently from traditional printed documents. - Task-oriented styles differ from reference oriented styles. In the end, it - comes down to the question: Is the documentation sufficient for the - mythical "average" C++ programmer to use the library successfully? -
-- Appropriate topics for documentation often include: -
- -- If you need more help with how to write documentation you can check out the - article on Writing Documentation for - Boost. -
- -- Rationale for some of the requirements and guidelines follows. -
-- Exception specifications [ISO 15.4] are sometimes coded to indicate what - exceptions may be thrown, or because the programmer hopes they will - improved performance. But consider the following member from a smart - pointer: -
-
- T& operator*() const throw() { return *ptr; }
-
- - This function calls no other functions; it only manipulates fundamental - data types like pointers Therefore, no runtime behavior of the - exception-specification can ever be invoked. The function is - completely exposed to the compiler; indeed it is declared inline Therefore, - a smart compiler can easily deduce that the functions are incapable of - throwing exceptions, and make the same optimizations it would have made - based on the empty exception-specification. A "dumb" compiler, however, may - make all kinds of pessimizations. -
- -- For example, some compilers turn off inlining if there is an - exception-specification. Some compilers add try/catch blocks. Such - pessimizations can be a performance disaster which makes the code unusable - in practical applications. -
-- Although initially appealing, an exception-specification tends to have - consequences that require very careful thought to understand. The - biggest problem with exception-specifications is that programmers use them - as though they have the effect the programmer would like, instead of the - effect they actually have. -
-- - A non-inline function is the one place a "throws nothing" - exception-specification may have some benefit with some compilers. -
-- The C++ standard committee's Library Working Group discussed this issue in - detail, and over a long period of time. The discussion was repeated again - in early boost postings. A short summary: -
- -- Dave Abrahams comments: An important purpose (I daresay the primary - purpose) of source code is communication: the documentation of intent. This - is a doubly important goal for boost, I think. Using a fixed-width font - allows us to communicate with more people, in more ways (diagrams are - possible) right there in the source. Code written for fixed-width fonts - using spaces will read reasonably well when viewed with a variable-width - font, and as far as I can tell every editor supporting variable-width fonts - also supports fixed width. I don't think the converse is true. -
-- Tabs are banned because of the practical problems caused by tabs in - multi-developer projects like Boost, rather than any dislike in principle. - See mailing list archives. Problems - include maintenance of a single source file by programmers using tabs and - programmers using spaces, and the difficulty of enforcing a consistent tab - policy other than just "no tabs". Discussions concluded that Boost files - should either all use tabs, or all use spaces, and thus the decision to - stick with spaces. -
-- Before the 1.29.0 release, two Boost libraries added ECMAScript/JavaScript - documentation. Controversy followed (see mailing list archives), and the developers - were asked to remove the ECMAScript/JavaScript. Reasons given for banning - included: -
-- Rationale is defined as "The fundamental reasons for something; basis" by - the American Heritage Dictionary. -
-- Beman Dawes comments: Failure to supply contemporaneous rationale for - design decisions is a major defect in many software projects. Lack of - accurate rationale causes issues to be revisited endlessly, causes - maintenance bugs when a maintainer changes something without realizing it - was done a certain way for some purpose, and shortens the useful lifetime - of software. -
-- Rationale is fairly easy to provide at the time decisions are made, but - very hard to accurately recover even a short time later. -
- -- As a library matures, it almost always accumulates improvements suggested - to the authors by other boost members. It is a part of the culture of - boost.org to acknowledge such contributions, identifying the person making - the suggestion. Major contributions are usually acknowledged in the - documentation, while minor fixes are often mentioned in comments within the - code itself. -
- -- Revised - - 04 November, 2003 -
-- © Copyright Beman Dawes 2003. -
- -- Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or copy - at www.boost.org/LICENSE_1_0.txt) -
- - diff --git a/library_reuse.htm b/library_reuse.htm deleted file mode 100644 index 2618afb..0000000 --- a/library_reuse.htm +++ /dev/null @@ -1,75 +0,0 @@ - - - - - - - - - |
- Home | -Libraries | -People | -FAQ | -More | -
A Boost library should not use libraries other than Boost or the C++ -Standard Library.
-A Boost library should use other Boost Libraries or the C++ Standard -Library, but only when the benefits outweigh the costs.
-The benefits of using components from other libraries may include clearer, -more understandable code, reduced development and maintenance costs, and the -assurance which comes from reusing well-known and trusted building blocks.
-The costs may include undesirable coupling between components, and added -compilation and runtime costs. If the interface to the additional -component is complex, using it may make code less readable, and thus actually -increase development and maintenance costs.
-Negative effects of coupling become obvious when one library uses a second -library which uses a third, and so on. The worst form of coupling requires the -user understand each of the coupled libraries. Coupling may also reduce the -portability of a library - even in case when all used libraries are -self-sufficient (see example of questionable usage of <iostream> library -below).
-Example where another boost component should certainly be used: -boost::noncopyable (in boost/utility.hpp) has -considerable benefits; it simplifies code, improves readability, and signals -intent. Costs are low as coupling is limited; noncopyable itself -uses no other classes and its header includes only the lightweight headers -<boost/config.hpp> and <cstddef>. There are no runtime costs -at all. With costs so low and benefits so high, other boost libraries should use -boost::noncopyable when the need arises except in exceptional circumstances.
-Example where a standard library component might possibly be used: -Providing diagnostic output as a debugging aid can be a nice feature for a -library. Yet using Standard Library <iostream> can involves a lot of -additional cost, particularly if <iostream> is unlikely to be use -elsewhere in the application. In certain GUI or embedded applications, -coupling to <iostream> would be a disqualification. -Consider redesign of the boost library in question so that the user supplies the -diagnostic output mechanism.
-Example where another boost component should not be used: The -boost dir_it library has considerable coupling and runtime costs, not to mention -portability issues for unsupported operating systems. While completely -appropriate when directory iteration is required, it would not be reasonable for -another boost library to use dir_it just to check that a file is available -before opening. C++ Standard Library file open functionality does this at -lower cost. Don't use dir_it just for the sake of using a boost library.
-Revised 02 October 2003
-© Copyright Beman Dawes 2000
-Distributed under the Boost Software License, Version 1.0. (See -accompanying file LICENSE_1_0.txt or copy -at http://www.boost.org/LICENSE_1_0.txt)
- - - - \ No newline at end of file diff --git a/license_info.html b/license_info.html deleted file mode 100644 index 7715d9d..0000000 --- a/license_info.html +++ /dev/null @@ -1,280 +0,0 @@ - - - - - - - - - |
- Home | -Libraries | -People | -FAQ | -More | -
License text
-Introduction
-History
-Rationale
-FAQ
-Transition
-Acknowledgements
The Boost Software License -specifies the terms and conditions of use for those Boost libraries -that it covers.
- -Currently, some Boost libraries have their own licenses. The hope is that -eventually all Boost libraries will be covered by the Boost Software -License. In the meantime, all libraries comply with the Boost License requirements.
- -As Boost grew, it became unmanageable for each Boost file to have -its own license. Users complained that each license needed to be reviewed, and that -reviews were difficult or impossible if Boost libraries contained many different licenses. -Boost moderators and maintainers spent excessive time dealing with license -issues. Boost developers often copied existing licenses without actually knowing -if the license wording met legal needs.
-To clarify these licensing issues, the Boost moderators asked for help from -the Berkman Center for Internet & Society -at Harvard Law School, Cambridge, Massachusetts, USA. It was requested that a -single Boost license be developed that met the traditional requirements that Boost licenses, particularly:
- - -Additionally, other common open source licenses were studied to see what -additional issues were being treated, and additions representing good legal -practice were also requested. The result is the Boost -Software License.
- -The following rationale was provided by Devin Smith, the -lawyer who wrote the Boost Software License. It has been edited slightly for -brevity. Editorial additions are shown in square brackets.
- -If one of Boost's goals is to ease use and adoption of the various -libraries made available by Boost, it does make sense to try to -standardize the licenses under which the libraries are made available to -users. (I make some recommendations about a possible short-form license -below.)
-[Standardizing the license will not] necessarily address the issue of satisfying -corporate licensees. Each corporation will have its own concerns, based -on their own experiences with software licensing and distribution and, -if they're careful, will want to carefully review each license, even if -they've been told that they're all standard. I would expect that, -unless we're remarkably brilliant (or lucky) in drafting the standard -Boost license, the standard license won't satisfy the legal departments -of all corporations. I imagine that some will, for instance, absolutely -insist that licensors provide a warranty of title and provide -indemnification for third-party intellectual property infringement -claims. Others may want functional warranties. (If I were advising the -corporations, I would point out that they're not paying anything for the -code and getting such warranties from individual programmers, who -probably do not have deep pockets, is not that valuable anyway, but -other lawyers may disagree.)
-But this can be addressed, not by trying to craft the perfect standard -license, but by informing the corporations that they can, if they don't like the -standard license, approach the authors to negotiate a different, perhaps even -paid, license.
-One other benefit of adopting a standard license is to help ensure that -the license accomplishes, from a legal perspective, what the authors -intend. For instance, many of the [original] licenses for the libraries available -on boost.org do not disclaim the warranty of title, meaning that the -authors could, arguably, be sued by a user if the code infringes the -rights of a third party and the user is sued by that third party. I -think the authors probably want to disclaim this kind of liability.
-Without in anyway detracting from the draft license that's been -circulated [to Boost moderators], I'd like to propose an alternative "short-form" license that -Boost could have the library authors adopt. David [Abrahams] has expressed a -desire to keep things as simple as possible, and to try to move away -from past practice as little as possible, and this is my attempt at a -draft.
-This license, which is very similar to the BSD license and the MIT -license, should satisfy the Open Source Initiative's Open Source -Definition: (i) the license permits free redistribution, (ii) the -distributed code includes source code, (iii) the license permits the -creation of derivative works, (iv) the license does not discriminate -against persons or groups, (v) the license does not discriminate against -fields of endeavor, (vi) the rights apply to all to whom the program is -redistributed, (vii) the license is not specific to a product, and (viii) the -license is technologically neutral (i.e., it does not [require] an explicit gesture of -assent in order to establish a contract between licensor and licensee).
-This license grants all rights under the owner's copyrights (as well as an -implied patent license), disclaims all liability for use of the code (including -intellectual property infringement liability), and requires that all subsequent -copies of the code [except machine-executable object code], including partial copies and derivative works, include the -license.
- -How should Boost programmers apply the license to source and -header files?
- -Add a comment based on the following template, substituting
-appropriate text for the italicized portion:
-
-
-
-// Copyright Joe Coder 2004 - 2006. -// Distributed under the Boost Software License, Version 1.0. -// (See accompanying file LICENSE_1_0.txt or copy at -// http://www.boost.org/LICENSE_1_0.txt) --
Other ways of licensing source files have been considered, but some -of them turned out to unintentionally nullify legal elements of the -license. Having fixed language for referring to the license helps -corporate legal departments evaluate the boost distribution. -Creativity in license reference language is strongly discouraged, but -judicious changes in the use of whitespace are fine. - -
How should the license be applied to documentation files, instead?
- -Very similarly to the way it is applied to source files: the user should -see the very same text indicated in the template above, with the only difference -that both the local and the web copy of LICENSE_1_0.txt should be linked to. -Refer to the HTML source code of this page in case of doubt. - -
Note that the location of the local LICENSE_1_0.txt needs to be indicated
-relatively to the position of your documentation file
-(../LICENSE_1_0.txt, ../../LICENSE_1_0.txt etc.)
How is the Boost license different from the -GNU General Public -License (GPL)?
- - -The Boost license permits the creation of derivative works for -commercial or non-commercial use with no legal requirement to release -your source code. Other differences include Boost not requiring -reproduction of copyright messages for object code redistribution, and -the fact that the Boost license is not "viral": if you -distribute your own code along with some Boost code, the Boost license -applies only to the Boost code (and modified versions thereof); you -are free to license your own code under any terms you like. The GPL is -also much longer, and thus may be harder to understand.
- -Why the phrase "machine-executable object code generated by a source -language processor"?
- -To distinguish cases where we do not require reproduction of the copyrights -and license, such as object libraries, shared libraries, and final program -executables, from cases where reproduction is still required, such as -distribution of self-extracting archives of source code or precompiled header -files. More detailed wording was rejected as not being legally necessary, and -reducing readability.
- -Why is the "disclaimer" paragraph of the license entirely in uppercase?
- -Capitalization of these particular provisions is a US legal mandate for -consumer protection. (Diane Cabell)
- -Does the copyright and license cover interfaces too?
- -The conceptual interface to a library isn't covered. The particular -representation expressed in the header is covered, as is the documentation, -examples, test programs, and all the other material that goes with the library. -A different implementation is free to use the same logical interface, however. -Interface issues have been fought out in court several times; ask a lawyer for -details.
- -Why doesn't the license prohibit the copyright holder from patenting the -covered software?
- -No one who distributes their code under the terms of this license could turn -around and sue a user for patent infringement. (Devin Smith)
- -Boost's lawyers were well aware of patent provisions in licenses like the GPL -and CPL, and would have included such provisions in the Boost license if they -were believed to be legally useful.
- -Why doesn't the copyright message say "All rights reserved"?
- -Devin Smith says "I don't think it belongs in the copyright notice for -anything (software, electronic documentation, etc.) that is being licensed. It -belongs in books that are sold where, in fact, all rights (e.g., to reproduce -the book, etc.) are being reserved in the publisher or author. I think it -shouldn't be in the BSD license."
- -Do I have to copyright/license trivial files? - -
Even a test file that just contains an empty main()
-should have a copyright. Files without copyrights make corporate
-lawyers nervous, and that's a barrier to adoption. The more of Boost
-is uniformly copyrighted and licensed, the less problem people will
-have with mounting a Boost release CD on a corporate server.
-
-
-
Can I use the Boost license for my own projects outside Boost? - -
Sure; there are no restrictions on the use of the license itself. - -
To ease the transition of the code base towards the new common -license, several people decided to give a blanket permission for all -their contributions to use the new license. This hopefully helps -maintainers to switch to the new license once the list contains enough -names without asking over and over again for each change. Please -consider adding your name to the list.
- -Dave Abrahams led the Boost effort to develop better licensing. The legal -team was led by -Diane Cabell, -Director, Clinical Programs, Berkman -Center for Internet & Society, Harvard Law School. -Devin Smith, attorney, -Nixon Peabody LLP, wrote the Boost License. Eva Chan, Harvard Law School, -contributed analysis of Boost issues and drafts of various legal documents. -Boost members reviewed drafts of the license. Beman Dawes wrote this web page.
-Revised -27 August, 2004
- -© Copyright 2003-2004 Beman Dawes, Daniel Frey, David Abrahams.
-Distributed under the Boost Software License, Version 1.0. -(See accompanying file LICENSE_1_0.txt or -copy at www.boost.org/LICENSE_1_0.txt) -
- - - - diff --git a/mailing_lists.htm b/mailing_lists.htm deleted file mode 100644 index 7658db8..0000000 --- a/mailing_lists.htm +++ /dev/null @@ -1,403 +0,0 @@ - - - - - |
-
- Home | - -Libraries | - -People | - -FAQ | - -More | -
The mailing lists are the heart of the Boost community. You may - read the lists via full-content email, email digests, or via newsgroup - reader.
- -Hosting for the mailing lists is donated by the Open Systems Lab at Indiana University.
- -Access to Boost mailing lists via newsgroup (NNTP) is contributed by - GMANE.
- -Before Posting
- -- - Read the Discussion Policy and - Guide to Effective Posting. Doing so will help you - to ensure that your post is read by the people who can help you - and received in the spirit in which it was intended. - -
- Subscribe your posting address. As an anti-spam - measure, postings to most Boost mailing lists will only be - accepted if the posting's "From:" header contains an email - address that is subscribed to the list. If you try to post from - an address that isn't subscribed, you will probably get a - message that says:
- -- You are not allowed to post to this mailing list, and your message - has been automatically rejected. If you think that your messages are - being rejected in error, contact the mailing list owner at list - administrator's email address. -If you need to post from multiple email addresses, you - should subscribe each one separately. You can configure your subscription - settings for any address to disable mail delivery via each mailing list's - web interface. - -
Even postings made through the GMane news server need to be made from - subscribed addresses because GMane simply forwards your postings - on to the appropriate email list. Don't be fooled by GMane's - authentication message that says "you are now authorized to post - to this list" after you answer its autogenerated mail; only - subscribed addresses may post.
- -This list is oriented toward casual users of the Boost - libraries. It is a good place to start if you are having - trouble getting started with Boost or its individual libraries. Feel - free to post both "newbie" and more challenging questions, but - please check first to see if there's an - appropriate Project-Specific list; you'll - often get better answers in a forum dedicated to your problem - area. This list is relatively - low volume (less than 500 per month). Subscribe or unsubscribe - at the Boost Users list - home page. -
- -For those who prefer to participate via an NNTP (newsgroup) interface, a gateway - to the Boost Users mailing list is available at news://news.gmane.org/gmane.comp.lib.boost.user. - You can also browse Gmane's - searchable archive.
- -This is the main Boost mailing list. It is high volume (over 1000 - messages per month), very technical, and oriented toward Boost library - developers. It is also read by many other members interested in watching - the Boost library development process. Virtually all Boost decisions, - major or minor, technical or otherwise, are reached via public discussion - on this mailing list. It is where the formal reviews of proposed - libraries take place. Subscribe or unsubscribe at http://lists.boost.org/mailman/listinfo.cgi/boost.
- -When we talk about the "members of Boost", we are talking about those - signed up for this main mailing list.
- -For those who prefer to participate via an NNTP (newsgroup) interface, a gateway to the Boost mailing list - is available at news://news.gmane.org/gmane.comp.lib.boost.devel. - -
Preliminary libraries under discussion are available from the Vault.
- -Archives of Boost messages include the - Boost - GMane NNTP Archive, The Mail - Archive, The Free - Network Group, and of course there is a Google search link for our MailMan Archive on - our home page. - -
This is an announce-only list for notification of upcoming software - releases and formal reviews of proposed libraries. One to three messages - per month. Subscribe or unsubscribe at the Boost Announce - list home page.
- -This list is a moderated low-traffic announcement-only list of - interest to the Boost community. On topic messages will include - announcements of books, magazine articles, papers, talks, seminars, - products, tools, events, or conferences on advanced uses of C++, - generic/generative/meta-programming, and, of course, the Boost - libraries. Off topic will be discussion of any kind. Job postings - are accepted at the moderators' discretion. Subscribe or - unsubscribe at the Boost-Interest - home page.
- -Important: This mailing list is for the discussion of - the specification and implementation of Boost.Threads only — - questions regarding usage should be directed to the - Boost Users list, or the main - Boost developers list. - - -
GMane provides NNTP - access and - Searchable Archives as well. - - -
The setup, procedures and tools necessary for running Boost - regression tests are discussed on this - list. The list main participants are regression runners - people - who run Boost tests on a variety of compilers and platforms, and the - maintainers of tools for collecting and processing test results.
- -Important: questions relevant to a wider audience, including - questions about Boost.Test framework or test results for a particular - library, should be posted to main development list.
NNTP - access and Searchable - Archives are available on GMane. - -The boost-commit - mailing list receives messages whenever a change is committed to - the Boost Subversion repository.
- -In addition to the main Boost CVS - repository, a separate Sandbox is available for Boost developers - wishing to collaborate on projects prior to formal acceptance of a new - library. Read-only access is available via Subversion and web browser at - http://svn.boost.org/svn/boost/sandbox. - -
Developer access to the sandbox uses the Subversion repository - at https://svn.boost.org/svn/boost/sandbox. For more information about the Boost Subversion repository, - please - see http://svn.boost.org.
- -In addition to the mailing lists presented above, a #boost IRC channel on - freenode is frequented by some boost users. - As usual with IRC channels, one should not necessarily expect that his questions - will be answered. The channel is not moderated.
-Revised - 04 December, 2005
- -Copyright Beman Dawes and David Abrahams 2001-2005
- -Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or copy - at http://www.boost.org/LICENSE_1_0.txt)
- - diff --git a/moderators.html b/moderators.html deleted file mode 100644 index 249484d..0000000 --- a/moderators.html +++ /dev/null @@ -1,81 +0,0 @@ - - - - - - - - |
- Home | -Libraries | -People | -FAQ | -More | -
The Boost moderators are Dave Abrahams, -Carl Daniel, Beman Dawes, -Jeff Garland, -Doug Gregor, and -John Maddock. You can reach -the moderators at boost-owner@lists.boost.org. -
-Note: The boost moderators do not moderate any mailing lists -other than the main Boost developers' list. For example, the -boost-users list moderators are at -boost-users-owner@lists.boost.org. -The moderators of every other Boost list can be reached -through its home page. -
- -Revised 27 February, 2005 -
-© Beman Dawes 2001-2004
- -Distributed under the Boost Software License, Version 1.0. (See -accompanying file LICENSE_1_0.txt or copy -at http://www.boost.org/LICENSE_1_0.txt)
- - - - \ No newline at end of file diff --git a/regression.html b/regression.html index 58a2c18..70c37ed 100644 --- a/regression.html +++ b/regression.html @@ -5,5 +5,14 @@ Automatically loading index page... if nothing happens, please go to http://www.boost.org/tools/regression/index.htm. +© Copyright Douglas Gregor, 2005
+ +Distributed under the Boost Software License, Version 1.0. See +www.boost.org/LICENSE_1_0.txt
+ ++
- + \ No newline at end of file diff --git a/report-nov-2007.html b/report-nov-2007.html new file mode 100644 index 0000000..7d30787 --- /dev/null +++ b/report-nov-2007.html @@ -0,0 +1,423 @@ + + + + + + +
We need experienced review managers. Please take a look at the list +of libraries in need of managers and check out their descriptions. In +general review managers are active boost participants or library +contributors. If you can serve as review manager for any of them, +email Ron Garcia or John Phillips, "garcia at cs dot indiana dot edu" +and "jphillip at capital dot edu" respectively.
+A link to this report will be posted to www.boost.org. +If you would like us to make any modifications or additions to this +report before we do that, please email Ron or John.
+If you're library author and plan on submitting a library for review +in the next 3-6 months, send Ron or John a short description of your +library and we'll add it to the Libraries Under Construction below. +We know that there are many libraries that are near completion, but we +have hard time keeping track all of them. Please keep us informed +about your progress.
+| Author: | Andrey Semashev | +
|---|---|
| Review Manager: | Martin Vuille | +
| Download: | Boost Sandbox Vault | +
| Description: | The Boost.FSM library is an implementation of FSM (stands for +Finite State Machine) programming concept. The main goals of the +library are: +
|
+
| Author: | Johan RÃ¥de | +
|---|---|
| Review Manager: | Need Volunteer | +
| Download: | Boost Sandbox Vault | +
| Description: | The Floating Point Utilities library contains the following: +
|
+
| Author: | Steven Watanabe | +
|---|---|
| Review Manager: | Need Volunteer | +
| Download: | Boost Sandbox Vault | +
| Description: | The built in C/C++ switch statement is very efficient. Unfortunately, +unlike a chained if/else construct there is no easy way to use it when +the number of cases depends on a template parameter. The Switch library +addresses this issue. | +
| Author: | Andrew Sutton | +
|---|---|
| Review Manager: | Jeremy Siek | +
| Download: | http://svn.boost.org/svn/boost/sandbox/graph-v2 | +
| Description: | A number of additions and modifications to the Property Map Library, +including: +
|
+
| Author: | Andrew Sutton | +
|---|---|
| Review Manager: | Jeremy Siek | +
| Download: | http://svn.boost.org/svn/boost/sandbox/graph-v2 | +
| Description: | A number of additions and modifications to the Graph Library, +including: +
|
+
| Author: | Tobias Schwinger | +
|---|---|
| Review Manager: | John Torjo | +
| Download: | http://boost-consulting.com/vault/index.php?&direction=0&order=&directory=X-Files | +
| Description: | A brute-force solution to the forwarding problem. | +
| Author: | Tobias Schwinger | +
|---|---|
| Review Manager: | John Torjo | +
| Download: | http://boost-consulting.com/vault/index.php?&direction=0&order=&directory=X-Files | +
| Description: | Three thread-safe Singleton templates with an +easy-to-use interface. | +
| Author: | Tobias Schwinger | +
|---|---|
| Review Manager: | John Torjo | +
| Download: | http://boost-consulting.com/vault/index.php?&direction=0&order=&directory=X-Files | +
| Description: | Generic factories. | +
| Author: | Ben Hanson | +
|---|---|
| Review Manager: | Need Volunteer | +
| Download: | http://boost-consulting.com/vault/index.php?action=downloadfile&filename=boost.lexer.zip&directory=Strings%20-%20Text%20Processing& | +
| Description: | A programmable lexical analyser generator inspired by 'flex'. +Like flex, it is programmed by the use of regular expressions +and outputs a state machine as a number of DFAs utilising +equivalence classes for compression. | +
| Author: | Frank Hess | +
|---|---|
| Review Manager: | Need Volunteer | +
| Download: | http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directory=thread_safe_signals | +
| Description: | A thread-safe implementation of Boost.signals that +has some interface changes to accommodate thread safety, mostly with +respect to automatic connection management. | +
| Author: | John Torjo | +
|---|---|
| Review Manager: | Need Volunteer | +
| Download: | http://torjo.com/log2/ | +
| Description: | Used properly, logging is a very powerful tool. Besides aiding +debugging/testing, it can also show you how your application is +used. The Boost Logging Library allows just for that, supporting +a lot of scenarios, ranging from very simple (dumping all to one +destination), to very complex (multiple logs, some enabled/some +not, levels, etc). It features a very simple and flexible +interface, efficient filtering of messages, thread-safety, +formatters and destinations, easy manipulation of logs, finding +the best logger/filter classes based on your application's +needs, you can define your own macros and much more! | +
| Author: | JoaquÃn M López Muñoz | +
|---|---|
| Review Manager: | Need Volunteer | +
| Download: | http://www.boost-consulting.com/vault/index.php?action=downloadfile&filename=flyweight.zip&directory=Patterns | +
| Description: | Flyweights are small-sized handle classes granting +constant access to shared common data, thus allowing for the +management of large amounts of entities within reasonable memory +limits. Boost.Flyweight makes it easy to use this common +programming idiom by providing the class template flyweight<T>, +which acts as a drop-in replacement for const T. | +
| Author: | Daniel James | +
|---|---|
| Review Manager: | Need Volunteer | +
| Download: | http://www.boost-consulting.com/vault/index.php?action=downloadfile&filename=unordered.zip&directory=Containers | +
| Description: | An implementation of the unordered containers specified +in TR1, with most of the changes from the recent draft standards. | +
| Author: | Stjepan Rajko | +
|---|---|
| Description: | The Dataflow library provides generic support for data +producers, consumers, and connections between the two. It also +provides layers for several specific dataflow mechanisms, namely +Boost.Signals, VTK data/display pipelines, and plain +pointers. The Dataflow library came out of the Signal Network +GSoC project, mentored by Doug Gregor. | +
| Status: | I am polishing the Dataflow library for submission, and am expecting +to add it to the review queue in the next couple of months. +I am currently ironing out some faults in the design of the library, +filling in missing features, and testing it on / adapting it to +different dataflow mechanisms (currently VTK and soon +Boost.Iostreams). As soon as I'm pretty sure that things are going +the right way, I'll submit this to the review queue while I do the +finishing touches. | +
| Author: | Robert Kawulak | +
|---|---|
| Download: | http://rk.go.pl/f/constrained_value.zip +http://rk.go.pl/r/constrained_value (Documentation) + |
+
| Description: | The Constrained Value library contains class templates +useful for creating constrained objects. The simplest example +of a constrained object is hour. The only valid values for an hour +within a day are integers from the range [0, 23]. With this library, +you can create a variable which behaves exactly like int, but does +not allow for assignment of values which do not belong to the +allowed range. The library doesn't focus only on constrained +objects that hold a value belonging to a specified range (i.e., +bounded objects). Virtually any constraint can be imposed using +appropriate predicate. You can specify what happens in case of +assignment of an invalid value, e.g. an exception may be thrown or +the value may be adjusted to meet the constraint criterions. | +
| Status: | I'm planning to finish it in 1-2 months. | +
Please let us know of any libraries you are currently +developing that you intend to submit for review.
+We need experienced review managers. Please take a look at the list +of libraries in need of managers and check out their descriptions. In +general review managers are active boost participants or library +contributors. If you can serve as review manager for any of them, +email Ron Garcia or John Phillips, "garcia at cs dot indiana dot edu" +and "jphillip at capital dot edu" respectively.
+A link to this report will be posted to www.boost.org. +If you would like us to make any modifications or additions to this +report before we do that, please email Ron or John.
+If you're library author and plan on submitting a library for review +in the next 3-6 months, send Ron or John a short description of your +library and we'll add it to the Libraries Under Construction below. +We know that there are many libraries that are near completion, but we +have hard time keeping track all of them. Please keep us informed +about your progress.
++++
+- Exception
+- Finite State Machines
+- Floating Point Utilities
+- Switch
+- Property Map (fast-track)
+- Graph (fast-track)
+
+++
++ + + + Author: + Emil Dotchevski
++ Review Manager: + Need Volunteer
++ Download: + http://www.revergestudios.com/boost-exception/boost-exception.zip
++ + Description: + The purpose of this library is to free designers of +exception classes from having to consider what data needs to be +stored in exception objects in order for the catch site to be +able to make sense of what went wrong.
+When the exception class is used, arbitrary values can be stored +in any exception. This can be done directly in the +throw-expression, or at a later time as the exception object +propagates up the call stack. The ability to add data to any +exception object after it has been thrown is important, because +often some of the information needed to handle an exception is +unavailable at the time of the throw.
+
+++
++ + + + Author: + Andrey Semashev
++ Review Manager: + Martin Vuille
++ Download: + ++ + Description: + The Boost.FSM library is an implementation of FSM (stands for +Finite State Machine) programming concept. The main goals of the +library are:
++
+- Simplicity. It should be very simple to create state machines using +this library.
+- Performance. The state machine infrastructure should not be +very time and memory-consuming in order to be applicable in +more use cases.
+- Extensibility. A developer may want to add more states to an +existing state machine. A developer should also be able to +specify additional transitions and events for the machine with +minimum modifications to the existing code.
+
+++
++ + + + Author: + Johan RÂde
++ Review Manager: + Need Volunteer
++ Download: + ++ + Description: + The Floating Point Utilities library contains the following:
++
+- Floating point number classification functions: fpclassify, isfinite, +isinf, isnan, isnormal (Follows TR1)
+- Sign bit functions: signbit, copysign, changesign (Follows TR1)
+- Facets that format and parse infinity and NaN according to the C99 +standard. (These can be used for portable handling of infinity and NaN +in text streams.)
+
+++
++ + + + Author: Steven Watanabe ++ Review Manager: Need Volunteer ++ Download: Boost Sandbox Vault ++ + Description: The built in C/C++ switch statement is very efficient. Unfortunately, +unlike a chained if/else construct there is no easy way to use it when +the number of cases depends on a template parameter. The Switch library +addresses this issue. +
+++
++ + + + Author: + Andrew Sutton
++ Review Manager: + Jeremy Siek
++ Download: + ++ + Description: + A number of additions and modifications to the Property Map Library, +including:
++++
+- A constant-valued property map, useful for naturally unweighted +graphs.
+- A noop-writing property map, useful when you have to provide an +argument, but just don't care about the output.
+- See +ChangeLog +for details.
+
+++
++ + + + Author: + Andrew Sutton
++ Review Manager: + Jeremy Siek
++ Download: + ++ + Description: + A number of additions and modifications to the Graph Library, +including:
++
+- Two new graph classes (undirected and directed) which are intended +to make the library more approachable for new developers
+- A suite of graph measures including degree and closeness +centrality, mean geodesic distance, eccentricity, and clustering +coefficients.
+- An algorithm for visiting all cycles in a directed graph (Tiernan's +from 1970ish). It works for undirected graphs too, but reports cycles +twice (one for each direction).
+- An algorithm for visiting all the cliques a graph (Bron&Kerbosch). +Works for both directed and undirected.
+- Derived graph measures radius and diameter (from eccentricity) and +girth and circumference (from Tiernan), and clique number (from +Bron&Kerbosch).
+- An exterior_property class that helps hides some of the weirdness +with exterior properties.
+- runtime and compile-time tests for the new algorithms.
+- a substantial amount of documentation
+- Graph cores, implemented by David Gleich (@Stanford University)
+- Deterministic graph generators - capable of creating or inducing +specific types of graphs over a vertex set (e.g., star graph, wheel +graph, prism graph, etc). There are several other specific types that +could be added to this, but I haven't had the time just yet.
+
+++
++ + + + Author: Stjepan Rajko ++ Description: The Dataflow library provides generic support for data +producers, consumers, and connections between the two. It also +provides layers for several specific dataflow mechanisms, namely +Boost.Signals, VTK data/display pipelines, and plain +pointers. The Dataflow library came out of the Signal Network +GSoC project, mentored by Doug Gregor. ++ + Status: I am polishing the Dataflow library for submission, and am expecting +to add it to the review queue in the next couple of months. +I am currently ironing out some faults in the design of the library, +filling in missing features, and testing it on / adapting it to +different dataflow mechanisms (currently VTK and soon +Boost.Iostreams). As soon as I'm pretty sure that things are going +the right way, I'll submit this to the review queue while I do the +finishing touches. +
+++
++ + + + Author: + Robert Kawulak
++ Download: + http://rk.go.pl/f/constrained_value.zip
+http://rk.go.pl/r/constrained_value (Documentation)
++ Description: + The Constrained Value library contains class templates +useful for creating constrained objects. The simplest example +of a constrained object is hour. The only valid values for an hour +within a day are integers from the range [0, 23]. With this library, +you can create a variable which behaves exactly like int, but does +not allow for assignment of values which do not belong to the +allowed range. The library doesn't focus only on constrained +objects that hold a value belonging to a specified range (i.e., +bounded objects). Virtually any constraint can be imposed using +appropriate predicate. You can specify what happens in case of +assignment of an invalid value, e.g. an exception may be thrown or +the value may be adjusted to meet the constraint criterions.
++ + Status: + I'm planning to finish it in 1-2 months.
+
Please let us know of any libraries you are currently +developing that you intend to submit for review.
+|
- |
- Home | -- Libraries | -- People | -FAQ | -More | -
If you have an idea for a feature or improvement to an existing Boost library -- go ahead and post it to either -boost-users list -or boost mailing list -(if you are posting for the first time, please read our -discussion policy -before you actually post).
-You can also use our -feature request tracking facility at SourceForge, but experience has shown -that posting to either of the mailing lists is usually a more effective way to -get attention of boost developers.
-If your proposal has its merits, it's very likely that it will generate a -constructive discussion that might actually result in (sometimes substantial) -improvement of the library - and your name being put on the library's - -Acknowledgements section!
-Revised 26 November, 2003 -
- -© Copyright Aleksey Gurtovoy -2002
-Distributed under the Boost Software License, Version 1.0. -(See accompanying file LICENSE_1_0.txt or -copy at www.boost.org/LICENSE_1_0.txt) -
- - - - \ No newline at end of file diff --git a/separate_compilation.html b/separate_compilation.html deleted file mode 100644 index 3121aa4..0000000 --- a/separate_compilation.html +++ /dev/null @@ -1,385 +0,0 @@ - - - -|
- |
-
- Guidelines for Authors of Boost Libraries Containing Separate - Source- |
-
These guidelines are designed for the authors of Boost libraries which have - separate source that need compiling in order to use the library. Throughout, - this guide refers to a fictitious "whatever" library, so replace all - occurrences of "whatever" or "WHATEVER" with your own library's name when - copying the examples.
-There are some compilers (mostly Microsoft Windows compilers again!), which - feature a range of compiler switches that alter the ABI of C++ classes and - functions. By way of example, consider Borland's compiler which has the - following options:
--b (on or off - effects enum sizes). --Vx (on or off - empty members). --Ve (on or off - empty base classes). --aX (alignment - 5 options). --pX (Calling convention - 4 options). --VmX (member pointer size and layout - 5 options). --VC (on or off, changes name mangling). --Vl (on or off, changes struct layout). --
These options are provided in addition to those affecting which runtime library - is used (more on which later); the total number of combinations of options can - be obtained by multiplying together the individual options above, so that gives - 2*2*2*5*4*5*2*2 = 3200 combinations! -
-The problem is that users often expect to be able to build the Boost libraries - and then just link to them and have everything just plain work, no matter what - their project settings are. Irrespective of whether this is a reasonable - expectation or not, without some means of managing this issue, the user may - well find that their program will experience strange and hard to track down - crashes at runtime unless the library they link to was built with the same - options as their project (changes to the default alignment setting are a prime - culprit). One way to manage this is with "prefix and suffix" headers: these - headers invoke compiler specific #pragma directives to instruct the compiler - that whatever code follows was built (or is to be built) with a specific set of - compiler ABI settings.
-Boost.config provides the macro BOOST_HAS_ABI_HEADERS which is set whenever - there are prefix and suffix headers available for the compiler in use, typical - usage in a header like this:
-#ifndef BOOST_WHATEVER_HPP
-#define BOOST_WHATEVER_HPP
-
-#include <boost/config.hpp>
-
-// this must occur after all of the includes and before any code appears:
-#ifdef BOOST_HAS_ABI_HEADERS
-# include BOOST_ABI_PREFIX
-#endif
-//
-// this header declares one class, and one function by way of examples:
-//
-class whatever
-{
- // details.
-};
-
-whatever get_whatever();
-
-// the suffix header occurs after all of our code:
-#ifdef BOOST_HAS_ABI_HEADERS
-# include BOOST_ABI_SUFFIX
-#endif
-
-#endif
-
- You can include this code in your library source files as well if you want, - although you probably shouldn't need to:
-Without some means of managing this issue, users often report bugs along the - line of "Your silly library always crashes when I try and call it" and so on. - These issues can be extremely difficult and time consuming to track down, only - to discover in the end that it's a compiler setting that's changed the ABI of - the class and/or function types of the program compared to those in the - pre-compiled library. The use of prefix/suffix headers can minimize this - problem, although probably not remove it completely.
-Trust the user, if they want 13-byte alignment (!) let them have it.
-Prefix/suffix headers have a tendency to "spread" to other boost libraries - - for example if boost::shared_ptr<> forms part of your class's ABI, then - including prefix/suffix headers in your code will be of no use unless - shared_ptr.hpp also uses them. Authors of header-only boost libraries may not - be so keen on this solution - with some justification - since they don't face - the same problem.
-When the users runtime is dynamically linked the Boost libraries can be built - either as dynamic libraries (.so's on Unix platforms, .dll's on Windows) or as - static libraries (.a's on Unix, .lib's on Windows). So we have a choice - as to which is supported by default:
-The recomendation is to pick static linking by default.
-There is no one policy that fits all here. -
-The rationale for the current behaviour was inherited from Boost.Regex (and - it's ancestor regex++): this library originally used dynamic linking by - default whenever the runtime was dynamic. It's actually safer that way should - you be using regex from a dll for example. However, this - behavior brought a persistent stream of user complaints: mainly about - deployment, all asking if static linking could be the default. After regex - changed behavior the complaints stopped, and the author hasn't had one - complaint about static linking by default being the wrong choice.
-Note that other libraries might need to make other choices: for example - libraries that are intended to be used to implement dll pluggin's would like - need to use dynamic linking in almost all cases.
-On most Unix-like platforms no special annotations of source code are required - in order for that source to be compiled as a shared library because all - external symbols are exposed. However the majority of Windows compilers require - that symbols that are to be imported or exported from a dll, be prefixed with - __declspec(dllimport) or __declspec(dllexport). Without this mangling of source - code, it is not possible to correctly build shared libraries on Windows - (historical note - originally these declaration modifiers were required on - 16-bit Windows where the memory layout for exported classes was different from - that of "local" classes - although this is no longer an issue, there is still - no way to instruct the linker to "export everything", it also remains to be - seen whether 64-bit Windows will resurrect the segmented architecture that led - to this problem in the first place. Note also that the mangled names of - exported symbols are different from non-exported ones, so __declspec(dllimport) - is required in order to link to code within a dll).
-In order to support the building of shared libraries on MS Windows your code - will have to prefix all the symbols that your library exports with a macro - (lets call it BOOST_WHATEVER_DECL) that your library will define to expand to - either __declspec(dllexport) or __declspec(dllimport) or nothing, depending - upon how your library is being built or used. Typical usage would look like - this:
-#ifndef BOOST_WHATEVER_HPP
-#define BOOST_WHATEVER_HPP
-
-#include <boost/config.hpp>
-
-#ifdef BOOST_HAS_DECLSPEC // defined in config system
-// we need to import/export our code only if the user has specifically
-// asked for it by defining either BOOST_ALL_DYN_LINK if they want all boost
-// libraries to be dynamically linked, or BOOST_WHATEVER_DYN_LINK
-// if they want just this one to be dynamically liked:
-#if defined(BOOST_ALL_DYN_LINK) || defined(BOOST_WHATEVER_DYN_LINK)
-// export if this is our own source, otherwise import:
-#ifdef BOOST_WHATEVER_SOURCE
-# define BOOST_WHATEVER_DECL __declspec(dllexport)
-#else
-# define BOOST_WHATEVER_DECL __declspec(dllimport)
-#endif // BOOST_WHATEVER_SOURCE
-#endif // DYN_LINK
-#endif // BOOST_HAS_DECLSPEC
-//
-// if BOOST_WHATEVER_DECL isn't defined yet define it now:
-#ifndef BOOST_WHATEVER_DECL
-#define BOOST_WHATEVER_DECL
-#endif
-
-//
-// this header declares one class, and one function by way of examples:
-//
-class BOOST_WHATEVER_DECL whatever
-{
- // details.
-};
-
-BOOST_WHATEVER_DECL whatever get_whatever();
-
-#endif
-
- And then in the source code for this library one would use:
-
-//
-// define BOOST_WHATEVER SOURCE so that our library's
-// setup code knows that we are building the library (possibly exporting code),
-// rather than using it (possibly importing code):
-//
-#define BOOST_WHATEVER_SOURCE
-#include <boost/whatever.hpp>
-
-// class members don't need any further annotation:
-whatever::whatever() { }
-// but functions do:
-BOOST_WHATEVER_DECL whatever get_whatever()
-{
- return whatever();
-}
-
- As well as exporting your main classes and functions (those that are actually - documented), Microsoft Visual C++ will warn loudly and often if you try to - import/export a class whose dependencies are not also exported. Dependencies - include: any base classes, any user defined types used as data members, plus - all of the dependencies of your dependencies and so on. This causes particular - problems when a dependency is a template class, because although it is - technically possible to export these, it is not at all easy, especially if the - template itself has dependencies which are implementation-specific details. In - most cases it's probably better to simply suppress the warnings using:
-#ifdef BOOST_MSVC -# pragma warning(push) -# pragma warning(disable : 4251 4231 4660) -#endif - -// code here - -#ifdef BOOST_MSVC -#pragma warning(pop) -#endif --
This is safe provided that there are no dependencies that are (template) - classes with non-constant static data members, these really do need exporting, - otherwise there will be multiple copies of the static data members in the - program, and that's really really bad. -
-Historical note: on 16-bit Windows you really did have to export all - dependencies or the code wouldn't work, however since the latest Visual Studio - .NET supports the import/export of individual member functions, it's a - reasonably safe bet that Windows compilers won't do anything nasty - like - changing the class's ABI - when importing/exporting a class.
-Why bother - doesn't the import/export mechanism take up more code that the - classes themselves?
-A good point, and probably true, however there are some circumstances where - library code must be placed in a shared library - for example when the - application consists of multiple dll's as well as the executable, and more than - one those dll's link to the same Boost library - in this case if the library - isn't dynamically linked and it contains any global data (even if that data is - private to the internals of the library) then really bad things can happen - - even without global data, we will still get a code bloating effect. - Incidentally, for larger applications, splitting the application into multiple - dll's can be highly advantageous - by using Microsoft's "delay load" feature - the application will load only those parts it really needs at any one time, - giving the impression of a much more responsive and faster-loading application.
-Why static linking by default? -
-In the worked example above, the code assumes that the library will be - statically linked unless the user asks otherwise. Most users seem to prefer - this (there are no separate dll's to distribute, and the overall distribution - size is often significantly smaller this way as well: i.e. you pay for what you - use and no more), but this is a subjective call, and some libraries may even - only be available in dynamic versions (Boost.threads for example).
-Many Windows compilers ship with multiple runtime libraries - for example - Microsoft Visual Studio .NET comes with 6 versions of the C and C++ runtime. It - is essential that the Boost library that the user links to is built against the - same C runtime as the program is built against. If that is not the case, then - the user will experience linker errors at best, and runtime crashes at worst. - The Boost build system manages this by providing different build variants, each - of which is build against a different runtime, and gets a slightly different - mangled name depending upon which runtime it is built against. For example the - regex libraries get named as follows when built with Visual Studio .NET 2003:
-boost_regex-vc71-mt-1_31.lib -boost_regex-vc71-mt-gd-1_31.lib -libboost_regex-vc71-mt-1_31.lib -libboost_regex-vc71-mt-gd-1_31.lib -libboost_regex-vc71-mt-s-1_31.lib -libboost_regex-vc71-mt-sgd-1_31.lib -libboost_regex-vc71-s-1_31.lib -libboost_regex-vc71-sgd-1_31.lib --
The difficulty now is selecting which of these the user should link his or her - code to.
-In contrast, most Unix compilers typically only have one runtime (or sometimes - two if there is a separate thread safe option). For these systems the only - choice in selecting the right library variant is whether they want debugging - info, and possibly thread safety. -
-Historically Microsoft Windows compilers have managed this issue by providing a - #pragma option that allows the header for a library to automatically select the - library to link to. This makes everything automatic and extremely easy for the - end user: as soon as they include a header file that has separate source code, - the name of the right library build variant gets embedded in the object file, - and as long as that library is in the linker search path, it will get pulled in - by the linker without any user intervention.
-Automatic library selection and linking can be enabled for a Boost library by - including the header <boost/config/auto_link.hpp>, after first defining - BOOST_LIB_NAME and, if applicable, BOOST_DYN_LINK.
-// -// Automatically link to the correct build variant where possible. -// -#if !defined(BOOST_ALL_NO_LIB) && !defined(BOOST_WHATEVER_NO_LIB) && !defined(BOOST_WHATEVER_SOURCE) -// -// Set the name of our library, this will get undef'ed by auto_link.hpp -// once it's done with it: -// -#define BOOST_LIB_NAME boost_whatever -// -// If we're importing code from a dll, then tell auto_link.hpp about it: -// -#if defined(BOOST_ALL_DYN_LINK) || defined(BOOST_WHATEVER_DYN_LINK) -# define BOOST_DYN_LINK -#endif -// -// And include the header that does the work: -// -#include <boost/config/auto_link.hpp> -#endif // auto-linking disabled --
The library's user documentation should note that the feature can be disabled - by defining either BOOST_ALL_NO_LIB or BOOST_WHATEVER_NO_LIB:
-If for any reason you need to debug this feature, the header - <boost/config/auto_link.hpp> will output some helpful diagnostic messages - if you first define BOOST_LIB_DIAGNOSTIC.
-The Jamfile for building library "whatever" typically lives in - boost-root/libs/whatever/build, the only extra step required is to add a - <define> requirement to the library target so that your code knows - whether it's building a dll or static library, a typical Jamfile would like - like this:
--lib boost_regex : ../src/whatever.cpp : - <link>shared:<define>BOOST_WHATEVER_DYN_LINK=1 ; --
Testing the auto-link feature is somewhat convoluted, and requires access - to a compiler that supports the feature: refer to - libs/config/test/link/test/Jamfile.v2 for an example.
-© Copyright John Maddock 1998- - 2003
-Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt)
-The use of code snippets from this article does not require the reproduction - of this copyright notice and license declaration; if you wish to provide - attribution then please provide a link to this article.
- - diff --git a/submission_process.htm b/submission_process.htm deleted file mode 100644 index 9a8108a..0000000 --- a/submission_process.htm +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - |
- Home | -Libraries | -People | -FAQ | -More | -
This page describes the process a library developer goes through to get a -library accepted by Boost.
-See the Boost Library Requirements and Guidelines -page for issues of content.
-Subscribe to the main developers mailing list for a -while, or look through the archives. -Click around the web site. Understand the Requirements. -Read the rest of this page to learn about the process. Otherwise, you will -just end up wasting everyone's time.
-There is a culture associated with Boost, aimed at encouraging high quality -libraries by a process of discussion and refinement.
-If what you really want is a site that will just post your library without -even looking at it, you should go elsewhere.
-Potential library submitters should use the Boost developers mailing -list as a forum to gauge interest a possible submission.
-A message might be as simple as "Is there any interest in a library -which solves Traveling Salesperson problems in linear time?"
-A bit of further description or snippet of code may be helpful. Messages -should be plain text; not rich text, HTML, etc.
-Please don't post lengthy descriptions, documentation, or code to the mailing -list, and no attachments, even small ones. Please post lengthy material in -the Boost Vault.
-If response to an initial query indicates interest, then post the preliminary -submission files in the Boost Vault on -the sourceforge web site if you haven't already done so.
-Discuss, refine, resubmit. Repeat until satisfied.
-The exact details of this process varies a lot. Sometimes it is public, -on the mailing list, sometimes a lot of discussion happens in private -emails. For some libraries the process is over quickly, for others it goes -on for months. It's often challenging, and sometimes leads off in -completely unexpected directions.
-The archive of past -messages is one way to see how this process worked for other Boost -libraries.
-All of the files which make up the library should be combined and compressed -into a single submission file using the .zip format. Free encoders -and decoders for this format running on many different platforms are available -at the Info-ZIP web site, which -includes a FAQ and much other useful information about the .zip format. Many -commercial compressor-archiver utilities also support this format.
-The submission file should contain material as if on the -boost.org web site. The closer the submission file mirrors the final -directory -structure and format of the web site, the better. -
Like a preliminary submission, post the final submission .zip file in the Boost Vault. -
Before asking for formal review, your submission should be posted in the -Boost files/vault. Please verify that your submission compiles -and runs under at least two compilers. This flushes out obvious -portability problems. If you don't have access to a second compiler, ask -for help on the Boost mailing list.
-Once a library author feels a submission (which presumably is now in the -files/vault) has matured enough for formal review, the author sends a message -requesting a formal review to the mailing list. Please use a subject in -the form "Review Request: library" where library is replaced by -the library name.
-See Formal Review Process for -details.
-Formal Review schedules are posted on - the web site.
- -Once an accepted library is ready for inclusion on the Boost web site, the -submitter is typically given Boost CVS write access, and expected to check-in -and maintain the library in the CVS. Contact the moderators if you need write -access or CVS use isn't possible for you.
-If the boost.org web site doesn't already have your capsule biography -and picture (optional, with not-too-serious pictures preferred), please -send them to the Boost webmaster. It is -up to you as to whether or not the biography includes your email address or -other contact information. The preferred picture format is .jpg, but other -common formats are acceptable. The preferred image size is 500x375 but the -webmaster has photo editing software and can do the image preparation if -necessary.
-Libraries are software; they lose their value over time if not maintained. -Postings on the Boost developers or users mailing lists can alert you to -potential maintenance needs; please plan to maintain your library over time. If -you no longer can or wish to maintain your library, please post a message on the -Boost developers mailing list and help someone else take over as the library -maintainer.
-Revised 26 November, 2003
- -© Copyright Beman Dawes 2000
-Distributed under the Boost Software License, Version 1.0. (See -accompanying file LICENSE_1_0.txt or copy -at http://www.boost.org/LICENSE_1_0.txt)
- - - - diff --git a/test_policy.htm b/test_policy.htm deleted file mode 100644 index 3038800..0000000 --- a/test_policy.htm +++ /dev/null @@ -1,100 +0,0 @@ - - - - - - - - |
- Home | -Libraries | -People | -FAQ | -More | -
The Boost libraries are intended to be both reliable and portable. -Every experienced programmer knows that means each library must be tested against a suitable number of test cases, on a wide range of platforms, -and then tested again (regression tested) every time a change is made and before -every release.
-"Quality assurance based on a wide range of targeted tests" as one -of the key answers to C.A.R -Hoare's question -"How did software get so reliable without proof."
-Boost uses an automatic regression test suite which generates HTML -compiler -status tables.
-The Boost Test Library provides many -useful components which ease the construction of test programs.
-Written by Beman Dawes. Jens Maurer, Paul Moore, Gary Powell and Jeremy Siek contributed helpful suggestions.
-Revised 08 January, 2004 -
-© Copyright Beman Dawes 2001
-Distributed under the Boost Software License, Version 1.0. (See -accompanying file LICENSE_1_0.txt or copy -at http://www.boost.org/LICENSE_1_0.txt)
- - - - diff --git a/updating_the_website.html b/updating_the_website.html deleted file mode 100755 index 1ee97f5..0000000 --- a/updating_the_website.html +++ /dev/null @@ -1,111 +0,0 @@ - - - - - |
-
- Home | - -Libraries | - -People | - -FAQ | - -More | -
Any boost developer can update the Boost website content between - releases.
- -tidy helps in
- preventing errors in the HTML, in keeping a clear revision history, and
- in conforming to Web standards to help make the website readable by the
- majority of people. The Boost web pages currently have a variety of
- different types of HTML and XHTML content. Each needs to be dealt with
- differently by tidy. Most pages are regular HTML 3.x/4.x,
- for these use a tidy invocation of:
- -tidy --tidy-mark no -i -wrap 78 -m some_page.html -Other pages are using the more recent XHTML 1.0 and XHTML 1.0 Strict -standards. Most notably this include the home -page. Some additional options are needed to make
tidy
-enforce the XHTML standard:
- -tidy --tidy-mark no -i -wrap 78 -m -asxhtml some_page.html -That command is also useful if one is converting from HTML to XHTML. To -have
tidy check for the XHTML 1.0 Strict format use:
- -tidy --tidy-mark no -i -wrap 78 -m -asxhtml --doctype strict some_page.html -If you have a choice as to what format to use, prefer the XHTML 1.0 -Strict format as that opens the content to the widest audience. -
scp'ing to the
- appropriate subdirectory of
- shell.sf.net:/home/groups/b/bo/boost/htdocs/. For example,
- to update the page you are reading, I would issue
- -scp updating_the_website.html david_abrahams@shell.sf.net:/home/groups/b/bo/boost/htdocs/more/ --
-ssh david_abrahams@shell.sf.net "chmod a+r,g+rw /home/groups/b/bo/boost/htdocs/more/updating_the_website.html" --
Revised $Date$ -
- -© Copyright David Abrahams 2005
- -© Copyright Rene Rivera 2005
- -Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or copy - at www.boost.org/LICENSE_1_0.txt)
- - diff --git a/whos_using/Jamfile.v2 b/whos_using/Jamfile.v2 index 737c8b9..1cf60df 100644 --- a/whos_using/Jamfile.v2 +++ b/whos_using/Jamfile.v2 @@ -1,7 +1,7 @@ -# Copyright John Maddock 2005. Use, modification, and distribution are -# subject to the Boost Software License, Version 1.0. (See accompanying -# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +# Copyright John Maddock 2005. Distributed under the +# Boost Software License, Version 1.0. (See accompanying file +# LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) using quickbook ; diff --git a/whos_using/using.qbk b/whos_using/using.qbk index 37c2086..a747c5d 100644 --- a/whos_using/using.qbk +++ b/whos_using/using.qbk @@ -1,4 +1,5 @@ [article Who's Using Boost? + [quickbook 1.4] [copyright 2005 Various Authors] [license Distributed under the Boost Software License, Version 1.0. @@ -10,7 +11,66 @@ [last-revision $Date$] ] -[section:intro] +[/ begin by defining some links to Boost libraries] + +[def __regex [@../../libs/regex/index.html Boost.Regex]] +[def __functional [@../../libs/functional/index.html Boost.Functional]] +[def __format [@../../libs/format/index.html Boost.Format]] +[def __function [@../../libs/function/index.html Boost.Function]] +[def __bind [@../../libs/bind/index.html Boost.Bind]] +[def __smart [@../../libs/smart_ptr/index.html Boost.SmartPointers]] +[def __date_time [@../../libs/date_time/index.html Boost.DateTime]] +[def __iterator [@../../libs/iterator/index.html Boost.Iterator]] +[def __thread [@../../libs/thread/index.html Boost.Thread]] +[def __preprocessor [@../../libs/preprocessor/index.html Boost.Preprocessor]] +[def __any [@../../libs/any/index.html Boost.Any]] +[def __tokenizer [@../../libs/tokenizer/index.html Boost.Tokenizer]] +[def __signals [@../../libs/signals/index.html Boost.Signals]] +[def __property_map [@../../libs/property_map/index.html Boost.PropertyMap]] +[def __array [@../../libs/array/index.html Array]] +[def __operators [@../../libs/utility/operators.htm Boost.Operators]] +[def __tuple [@../../libs/tuple/index.html Boost.Tuple]] +[def __random [@../../libs/random/index.html Boost.Random]] +[def __variant [@../../libs/variant/index.html Boost.Variant]] +[def __string_algo [@../../libs/algorithm/string/index.html Boost.StringAlgorithms]] +[def __mpl [@../../libs/mpl/index.html Boost.MPL]] +[def __type_traits [@../../libs/type_traits/index.html Boost.TypeTraits]] +[def __dyn_bitset [@../../libs/dynamic_bitset/index.html Boost.DynamicBitset]] +[def __enable_if [@../../libs/utility/enable_if.html Boost.EnableIf]] +[def __timer [@../../libs/timer/index.html Boost.Timer]] +[def __phoenix [@../../libs/spirit/phoenix/index.html Boost.Phoenix]] +[def __spirit [@../../libs/spirit/index.html Boost.Spirit]] +[def __pointer_cont [@../../libs/ptr_container/index.html Boost.PointerContainer]] +[def __serialization [@../../libs/serialization/index.html Boost.Serialization]] +[def __lambda [@../../libs/lambda/index.html Boost.Lambda]] +[def __lexical_cast [@../../libs/conversion/lexical_cast.htm Boost.LexicalCast]] +[def __tribool [@../../doc/html/tribool.html Boost.Tribool]] +[def __numeric_cast [@../../libs/conversion/cast.htm#numeric_cast Boost.NumericCast]] +[def __ref [@../../libs/bind/ref.html Boost.Ref]] +[def __mem_fun [@../../libs/bind/mem_fn.html Boost.MemFn]] +[def __static_assert [@../../libs/static_assert/index.html Boost.StaticAssert]] +[def __shared_ptr [@../../libs/smart_ptr/index.html Boost.SharedPointer]] +[def __assign [@../../libs/assign/index.html Boost.Assign]] +[def __crc [@../../libs/crc/index.html Boost.CRC]] +[def __file_system [@../../libs/filesystem/index.html Boost.FileSystem]] +[def __optional [@../../libs/optional/index.html Boost.Optional]] +[def __utility [@../../libs/utility/index.html Boost.Utility]] +[def __integer [@../../libs/integer/index.html Boost.Integer]] +[def __multi_index [@../../libs/multi_index/index.html Boost.MultiIndex]] +[def __program_options [@../../libs/program_options/index.html Boost.ProgramOptions]] +[def __range [@../../libs/range/index.html Boost.Range]] +[def __concept_check [@../../libs/concept_check/index.html Boost.ConceptCheck]] +[def __graph [@../../libs/graph/index.html Boost.Graph]] +[def __ublas [@../../libs/numeric/ublas/index.html Boost.Ublas]] +[def __python [@../../libs/python/doc/index.html Boost.Python]] +[def __conversion [@../../libs/conversion/index.html Boost.Conversion]] +[def __test [@../../libs/test/index.html Boost.Test]] +[def __rational [@../../libs/rational/index.html Boost.Rational]] +[def __asio [@../../libs/asio/index.html Boost.Asio]] +[def __bjam [@../../tools/build/v2/index.html Boost.Build]] +[def __gil [@../../libs/gil/doc/index.html Boost.GIL]] + +[section:intro Introduction] Open source isn't just for nerds and researchers. Real world programming challenges, irrespective of whether they are open or closed source, can benefit enormously from @@ -34,7 +94,8 @@ Boost has found it's way into many products that are available "off the shelf", including consumer applications from Adobe, through to business middleware from SAP. -[blurb [*Adobe Photoshop CS2]\n\n +[blurb [*Adobe Photoshop CS2] + [@http://www.adobe.com/products/photoshop/main.html Adobe Photoshop CS2] uses the [@http://opensource.adobe.com/ Adobe Software Libraries], which in @@ -43,268 +104,305 @@ Adobe Software Libraries] are being rolled out across the Adobe product line to provide cross platform user interface logic. ] -[blurb [*Adobe Indesign]\n\n +[blurb [*Adobe Indesign] + [@http://www.adobe.com/products/indesign/main.html Adobe Indesign] offers best of breed page design: Indesign and it's asociated SDK depend upon Boost -[@../../libs/regex/index.html Regex], -[@../../libs/functional/index.html Functional] and others. +__regex, __functional and others. ] -[blurb [*SAP NetWeaver]\n\n +[blurb [*SAP NetWeaver] + [@http://www.sap.com/solutions/netweaver/index.epx SAP NetWeaver] is the technical foundation of mySAP Business Suite solutions, SAP xApps composite applications, partner solutions, and customer -custom-built applications. [@../../libs/regex/index.html The Boost Regex library] +custom-built applications. __regex provides the regular expression implementation for SAP's [@https://www.sdn.sap.com/sdn/developerareas/abap.sdn?node=linkDnode6-3 ABAP language].] -[blurb [*Real Networks, Rhapsody]\n\n +[blurb [*Real Networks, Rhapsody] + The [@http://www.real.com/ Rhapsody Music Service] allows its subscribers to legally download/transfer/burn over a million songs. The Rhapsody client -software was built with many Boost libraries:\n\n -['"[@../../libs/format/index.html Format]: Boost.Format is top notch. Using it is a bliss.\n -[@../../libs/functional/index.html Functional], -[@../../libs/function/index.html Function], -and [@../../libs/bind/index.html Bind]: These three libraries, -along with smart pointer are the most used in our application. I could not imagine -not having them handy.\n -[@../../libs/smart_ptr/index.html Smart Pointer]: Hands down, the most useful, and used library of the lot!\n -[@../../libs/date_time/index.html Date Time]: Simple to use, effective, does the job. I love the +software was built with many Boost libraries: + +__format: Boost.Format is top notch. Using it is a bliss. + +__functional, +__function, +and __bind: These three libraries, +along with __smart are the most used in our application. I could not imagine +not having them handy. + +__smart: Hands down, the most useful, and used library of the lot! + +__date_time: Simple to use, effective, does the job. I love the flexible input string parsing facilities, and the -human readable ISO output.\n -[@../../libs/iterator/index.html Iterators]: Wow. Moving legacy iterating interfaces, or +human readable ISO output. + +__iterator: Wow. Moving legacy iterating interfaces, or interfaces that should of been properly designed as iterators to STL compliant iterators was easy and painless. The gains in functionality to our -code made by this library are invaluable.\n -[@../../libs/regex/index.html Regex]: When you need it, it works magic.\n -[@../../libs/thread/index.html Thread]: Used to implement the monitor pattern in key areas.\n -[@../../libs/preprocessor/index.html Preprocessor]: Used to implement repetitive unit-test +code made by this library are invaluable. + +__regex: When you need it, it works magic. + +__thread: Used to implement the monitor pattern in key areas. + +__preprocessor: Used to implement repetitive unit-test code generation. The codebase benefited -greatly from the clarity boost.preprocessor -brought."] +greatly from the clarity __preprocessor +brought. ] -[blurb [*McAfee, Managed VirusScan 3]\n\n +[blurb [*McAfee, Managed VirusScan 3] + [@http://www.mcafeesecurity.com/us/products/mcafee/smb/managed_services/managed_vs_smb.htm McAfee Managed VirusScan], is an always on, automatic virus protection for desktops -and servers.\n\n More details of the Boost libraries used can be found +and servers. + +More details of the Boost libraries used can be found [@http://betavscan.mcafeeasap.com/beta/docs/readme/Readme.html here].] -[blurb [*DataSolid GmbH Germany, CADdy++ Mechanical Design (c)]\n\n +[blurb [*DataSolid GmbH Germany, CADdy++ Mechanical Design (c)] + [@http://www.DataSolid.com CADdy++ Mechanical Design professional (c)] is a fully parametric 3D CAD application with unbroken link between 3D models and 2D drawings. CADdy++ uses the Boost libraries: -[@../../libs/any/index.html Any], -[@../../libs/tokenizer/index.html Tokenizer], -[@../../libs/signals/index.html Signals], -[@../../libs/property_map/index.html Property Map], -[@../../libs/array/index.html Array], -[@../../libs/bind/index.html Bind], -[@../../libs/utility/operators.htm Operators], -[@../../libs/tuple/index.html Tuple], -[@../../libs/random/index.html Random].\n\n +__any, +__tokenizer, +__signals, +__property_map, +__array, +__bind, +__operators, +__tuple, +__random. + ['"Many thanks to all the boost developers for their great work and effort spending into boost."]] -[blurb [*Dimension 5, Miner3D]\n\n - Data visualization technology enabling advanced data analysis, - visualization, sonification and speech applications for business and science.\n - The [@http://www.miner3D.com Miner3D] application provides means for interactive visual analysis of - arbitrary tabular data from various data sources. It has a powerful OpenGL-based - visualization engine and an intuitive GUI. This combination helps a human eye - guide the application of statistical tools and spot the patterns that - might otherwise remain hidden. +[blurb [*Dimension 5, Miner3D] + +Data visualization technology enabling advanced data analysis, +visualization, sonification and speech applications for business and science. + +The [@http://www.miner3D.com Miner3D] application provides means for interactive visual analysis of +arbitrary tabular data from various data sources. It has a powerful OpenGL-based +visualization engine and an intuitive GUI. This combination helps a human eye +guide the application of statistical tools and spot the patterns that +might otherwise remain hidden. + ['"We are using the following boost libraries: -[@../../libs/date_time/index.html Date Time], -[@../../libs/variant/index.html Variant], -[@../../libs/regex/index.html Regex], -[@../../libs/format/index.html Format], -[@../../libs/algorithm/string/index.html String Algorithms], -[@../../libs/smart_ptr/index.html Smart Pointers], -[@../../libs/mpl/index.html MPL], -[@../../libs/type_traits/index.html Type Traits], -[@../../libs/utility/operators.htm Operators], -[@../../libs/dynamic_bitset/index.html Dynamic Bitset], -[@../../libs/utility/enable_if.html Enable If], -[@../../libs/timer/index.html Timer]."] +__date_time, +__variant, +__regex, +__format, +__string_algo, +__smart, +__mpl, +__type_traits, +__operators, +__dyn_bitset, +__enable_if, +__timer."] ] -[blurb [*Synergy, mailIntercept]\n\n +[blurb [*Synergy, mailIntercept] + [@http://www.mintercept.com mailIntercept] from [@http://www.synergy.com.br Synergy] -is a mail interceptor service for Exchange Server 2000/2003.\n +is a mail interceptor service for Exchange Server 2000\/2003. + mailIntercept intercepts and interprets the e-mails from a LAN using Exchange Server and converts the microsoft proprietary format to MIME and passes them to an SMTP filter and returns the emails to the Exchange Server as modified by the SMTP filter, converted back to the microsoft proprietary format and with its -features preserved.\n\n +features preserved. + mailIntercept was built using the following Boost libraries: -[@../../libs/mpl/index.html MPL], -[@../../libs/algorithm/string/index.html String Algorithm], -[@../../libs/bind/index.html Bind], -[@../../libs/spirit/phoenix/index.html Phoenix], -[@../../libs/spirit/index.html Spirit], -[@../../libs/ptr_container/index.html Pointer Container], -[@../../libs/serialization/index.html Serialization], -[@../../libs/regex/index.html Regex], -[@../../libs/iterator/index.html Iterators], -[@../../libs/lambda/index.html Lambda], -[@../../libs/conversion/lexical_cast.htm Lexical Cast], -[@../../libs/utility/operators.htm Operators], -[@../../libs/smart_ptr/index.html Smart Pointer], -[@../../doc/html/tribool.html Tribool] and -[@../../libs/type_traits/index.html Type Traits] +__mpl, +__string_algo, +__bind, +__phoenix, +__spirit, +__pointer_cont, +__serialization, +__regex, +__iterator, +__lambda, +__lexical_cast, +__operators, +__smart, +__tribool and +__type_traits ] -[blurb [*Integrated Research P/L, PROGNOSIS IP Telephony Manager and IP Telephony Express]\n\n - [@http://www.ir.com PROGNOSIS] is a suite of IP telephony management software products, - specifically designed to address the key challenges of IP telephony - life cycle management, including network-readiness, assessment, - pre-deployment assurance testing, and ongoing Day-2 management of - Cisco CallManager, Cisco Unity, and Cisco AVVID infrastructure. +[blurb [*Integrated Research P/L, PROGNOSIS IP Telephony Manager and IP Telephony Express] + +[@http://www.ir.com PROGNOSIS] is a suite of IP telephony management software products, +specifically designed to address the key challenges of IP telephony +life cycle management, including network-readiness, assessment, +pre-deployment assurance testing, and ongoing Day-2 management of +Cisco CallManager, Cisco Unity, and Cisco AVVID infrastructure. ['"The Boost libraries used were: -[@../../libs/any/index.html Any], - [@../../libs/bind/index.html Bind], - [@../../libs/function/index.html Function], - [@../../libs/conversion/lexical_cast.htm Lexical Cast], - [@../../libs/mpl/index.html MPL], - [@../../libs/conversion/cast.htm#numeric_cast Numeric Cast], - [@../../libs/bind/ref.html Ref], - [@../../libs/regex/index.html Regex], - [@../../libs/smart_ptr/index.html Smart Pointer], - [@../../libs/thread/index.html Thread], - [@../../libs/type_traits/index.html Type Traits]."] +__any, + __bind, + __function, + __lexical_cast, + __mpl, + __numeric_cast, + __ref, + __regex, + __smart, + __thread, + __type_traits."] ] -[blurb [*Kinook Software, Visual Build Professional]\n\n +[blurb [*Kinook Software, Visual Build Professional] + [@http://www.visualbuild.com/ Visual Build Professional] is a tool that enables developers, software process engineers, and build specialists to create an automated, repeatable process for building their software. Visual Build provides built-in support for Microsoft Visual Studio .NET and 2005, Visual Basic, Visual C++, Visual J++, SourceSafe, eMbedded Tools, -Borland Delphi, JBuilder, C++Builder, and more.\n\n +Borland Delphi, JBuilder, C++Builder, and more. + The following Boost Libraries were used: -[@../../libs/any/index.html Any], -[@../../libs/bind/mem_fn.html Mem_fn], -[@../../libs/regex/index.html Regex], -[@../../libs/smart_ptr/index.html Smart Pointer], -[@../../libs/static_assert/index.html Static Assert] +__any, +__mem_fun, +__regex, +__smart, +__static_assert ] -[blurb [*Kinook Software, Ultra Recall]\n\n +[blurb [*Kinook Software, Ultra Recall] + [@http://www.ultrarecall.com/ Ultra Recall] is a personal information management (PIM) / knowledge management (KM) application for Microsoft Windows. It helps you capture, organize, and recall all of your electronic information -across all the applications that you use.\n\n +across all the applications that you use. + Used the following Boost libraries: -[@../../libs/format/index.html Format], -[@../../libs/smart_ptr/index.html Shared Pointer], -[@../../libs/static_assert/index.html Static Assert] +__format, +__shared_ptr, +__static_assert ] -[blurb [*Applied Dynamics International, ADvantageDE]\n\n +[blurb [*Applied Dynamics International, ADvantageDE] + [@http://www.adi.com Applied Dynamics International (ADI)] provides state-of-the art software and hardware tools to the automotive, aerospace, and defense industries to design and test embedded control systems. ADI's tools provide advanced capabilities in real-time hardware-in-the-loop (HIL) simulation, rapid prototyping, and embedded controller software development. We have been a leading supplier of HIL simulation solutions -since 1957.\n\n +since 1957. + ADvantageDE is the development environment. It allows simulation models to be easily connected to one another or to hardware components for real-time simulation. ADvantageDE projects can be created for execution on your PC, -Unix workstation or on our real-time platforms.\n\n +Unix workstation or on our real-time platforms. + ADvantageVI is the point of control and the graphical user interface for all of the run-time activities. The run-time architecture includes extensive features for interacting with, visualizing, and automating simulation and -test activities.\n\n +test activities. + DasCom provides access to real-time simulation data from most Windows -applications, such as Micrsoft Excel, National Instruments Labview, etc.\n\n +applications, such as Micrsoft Excel, National Instruments Labview, etc. + The following Boost Libraries are used: -[@../../libs/array/index.html Array], -[@../../libs/assign/index.html Assign], -[@../../libs/bind/index.html Bind], -[@../../libs/crc/index.html CRC], -[@../../libs/dynamic_bitset/index.html Dynamic Bitset], -[@../../libs/utility/enable_if.html Enable If], -[@../../libs/filesystem/index.html File System], -[@../../libs/function/index.html Function], -[@../../libs/functional/index.html Functional], -[@../../libs/iterator/index.html Iterators], -[@../../libs/lambda/index.html Lambda], -[@../../libs/optional/index.html Optional], -[@../../libs/preprocessor/index.html Preprocessor], -[@../../libs/bind/ref.html Ref], -[@../../libs/regex/index.html Regex], -[@../../libs/serialization/index.html Serialization], -[@../../libs/signals/index.html Signals], -[@../../libs/smart_ptr/index.html Smart Pointer], -[@../../libs/static_assert/index.html Static Assert], -[@../../libs/spirit/index.html Spirit], -[@../../libs/algorithm/string/index.html String Algorithm], -[@../../libs/tokenizer/index.html Tokenizer] -[@../../libs/tuple/index.html Tuple], -[@../../libs/utility/index.html Uutility(Non-Copyable)] and -[@../../libs/variant/index.html Variant] +__array, +__assign, +__bind, +__crc, +__dyn_bitset, +__enable_if, +__file_system, +__function, +__functional, +__iterator, +__lambda, +__optional, +__preprocessor, +__ref, +__regex, +__serialization, +__signals, +__smart, +__static_assert, +__spirit, +__string_algo, +__tokenizer, +__tuple, +__utility and +__variant ] -[blurb [*PeerGuardian]\n\n +[blurb [*PeerGuardian] + [@http://methlabs.org/projects/peerguardian-2-windows/ PeerGuardian 2] is Methlabs premier IP blocker for Windows. With features like support for multiple lists, a list editor, automatic updates, and blocking all of IPv4 (TCP, UDP, ICMP, etc), -PeerGuardian 2 is the safest and easiest way to protect your privacy on P2P.\n\n -Boost Libraries used include -[@../../libs/crc/index.html CRC], -[@../../libs/bind/index.html Bind], -[@../../libs/integer/index.html Integer], -[@../../libs/function/index.html Function], -[@../../libs/functional/index.html Functional], -[@../../libs/smart_ptr/index.html Smart Pointers], -[@../../libs/conversion/lexical_cast.htm Lexical cast], -[@../../doc/html/string_algo.html String Algorithms], -[@../../libs/random/index.html Random], -[@../../libs/format/index.html Format], -[@../../libs/utility/index.html Utility].] +PeerGuardian 2 is the safest and easiest way to protect your privacy on P2P. + +Boost Libraries used include +__crc, +__bind, +__integer, +__function, +__functional, +__smart, +__lexical_cast, +__string_algo, +__random, +__format, +__utility.] + +[blurb [*DECOMSYS::DESIGNER PRO] -[blurb [*DECOMSYS::DESIGNER PRO]\n\n [@http://www.decomsys.com/ DECOMSYS::DESIGNER PRO] enables the user to design a highly complex [@http://www.flexray.com/ FlexRay] communication system, which is going to be the fundament for tomorrow's -automotive electronics.\n\n +automotive electronics. + ['"Boost Libraries used: -[@../../libs/bind/index.html Bind], -[@../../libs/dynamic_bitset/index.html Dynamic Bitset], -[@../../libs/format/index.html Format], -[@../../libs/function/index.html Function], -[@../../libs/iterator/index.html Iterators], -[@../../libs/mpl/index.html MPL], -[@../../libs/multi_index/index.html Multi Index], -[@../../libs/utility/utility.htm#Class_noncopyable Non-Copyable], -[@../../libs/utility/operators.htm Operators], -[@../../libs/preprocessor/index.html Preprocessor (nice for generating data for unit tests)], -[@../../libs/program_options/index.html Program Options (for the unit test programs)], -[@../../libs/bind/ref.html Ref], -[@../../libs/regex/index.html Regex], -[@../../libs/serialization/index.html Serialization], -[@../../libs/signals/index.html Signals], -[@../../libs/smart_ptr/index.html SmartPointer], -[@../../libs/spirit/index.html Spirit], -[@../../libs/timer/index.html Timer] and -[@../../libs/variant/index.html Variant]\n\n -We are also planning to use Andreas Huber's FSM library and Iostreams +__bind, +__dyn_bitset, +__format, +__function, +__iterator, +__mpl, +__multi_index, +__utility, +__operators, +__preprocessor (nice for generating data for unit tests), +__program_options (for the unit test programs), +__ref, +__regex, +__serialization, +__signals, +__smart, +__spirit, +__timer and +__variant] + +['"We are also planning to use Andreas Huber's FSM library and Iostreams (together with Serialize) once they are officially released."] ] -[blurb [*Wise Riddles Software, Audiomatic]\n\n +[blurb [*Wise Riddles Software, Audiomatic] + [@http://www.WiseRiddles.com/Audiomatic Audiomatic] is a tool used to make system-wide macros and then launch those macros with a voice command or keyboard shortcut at any time... from any @@ -312,35 +410,56 @@ Windows application. Audiomatic enables you to launch programs, files, or websites; simulate keystrokes; play sounds; speak text; or even run scripts. You can do it all with a voice command or keyboard shortcut! ['"Boost libraries Used: -[@../../libs/bind/index.html Bind], -[@../../libs/function/index.html Function], -[@../../libs/smart_ptr/index.html Smart Pointers], -[@../../libs/date_time/index.html Date Time], -[@../../libs/algorithm/string/index.html String Algorithm], -[@../../libs/utility/index.html Utility (Non-Copyable, Ref)], -[@../../libs/regex/index.html Regex], -[@../../libs/thread/index.html Thread], -[@../../libs/mpl/index.html MPL] and -[@../../libs/type_traits/index.html Type Traits]."] +__bind, +__function, +__smart, +__date_time, +__string_algo, +__utility, +__regex, +__thread, +__mpl and +__type_traits."] ] -[blurb [*Megahard Software Technologies Inc., Rule in Hell]\n\n +[blurb [*SMProcess FxEngine] + +The [@http://www.smprocess.com/Bin/FxEngineSetup.exe FxEngine] +from [@http://www.smprocess.com SMProcess] is a Free Framework for data flow processing and the +design of dynamic systems using plugins. The Framework provides a full +control to the plugin architecture for applications that require +custom solutions. + +The Framework is essentially based on three boost libraries: +__thread: Used to implement each "Pin" work. __thread includes +everything what we were looking for a portable framework like +mutex and condition components. +__functional and __bind: Provide a great flexibility compared to the STL. +__timer: A very straightforward and effective timer. + +] + +[blurb [*Megahard Software Technologies Inc., Rule in Hell] + [@http://www.ruleinhell.com Rule in Hell] is a -Massively Multiplayer Online Role Playing Game (still in beta).\n\n +Massively Multiplayer Online Role Playing Game (still in beta). + The Boost libraries used were: -[@../../libs/bind/index.html Bind], -[@../../libs/function/index.html Function], -[@../../libs/any/index.html Any], -[@../../libs/tuple/index.html Tuples], -[@../../libs/bind/ref.html Ref], -[@../../libs/smart_ptr/index.html Shared Pointer], -[@../../libs/type_traits/index.html Type Traits] and -[@../../libs/utility/utility.htm#Class_noncopyable Non-Copyable].\n\n -['"By far the combination of Bind, Function, Shared Pointer and Ref is what we use +__bind, +__function, +__any, +__tuple, +__ref, +__shared_ptr, +__type_traits and +__utility. + +['"By far the combination of __bind, __function, __shared_ptr and __ref is what we use most heavily".] ] -[blurb [*Dr. Detlef Meyer-Eltz, TextTransformer]\n\n +[blurb [*Dr. Detlef Meyer-Eltz, TextTransformer] + The [@http://www.texttransformer.com TextTransformer] is a Windows IDE for the generation of top down parsers with included c++ interpreter code for semantic actions. Both @@ -350,46 +469,51 @@ including as well the interpretable code as any arbitrary other code. Tokens are defined as POSIX regular expressions and rules are defined in a similar syntax quasi as regular expressions of regular expressions. The construction of parse trees and their traversal is -supported.\n\n -['"The TextTransformer is essentially based on the Boost Regex library, -by which the tokens for a parser can be defined. The Lexical Cast and +supported. + +['"The TextTransformer is essentially based on the __regex, +by which the tokens for a parser can be defined. The __lexical_cast and the Format library are used for the integrated c++ interpreter. For -the future also an interpreter version of the String Algorithm library is -planned. The Program Options library will be used too to improve the +the future also an interpreter version of the __string_algo is +planned. The __program_options library will be used too to improve the command line version of the texttransformer."] ] -[blurb [*Redshift Software, The Thot Tool]\n\n +[blurb [*Redshift Software, The Thot Tool] + [@http://thot-tool.com/ The Thot Tool] is an asset management tool for a group of game developers. Thot combines assets, both binary and text, with workflow automation into a unified whole, and was built using Boost -[@../../libs/thread/index.html Threads], -[@../../libs/smart_ptr/index.html Smart Pointer], -[@../../libs/regex/index.html Regex], -[@../../libs/mpl/index.html MPL], -and [@../../libs/type_traits/index.html Type Traits]. +__thread, +__smart, +__regex, +__mpl, +and __type_traits. ] -[blurb [*Paragent, Paragent Manage 2.1]\n\n +[blurb [*Paragent, Paragent Manage 2.1] + [@http://www.paragent.com/ Paragent Manage] is a Desktop Management Application that uses a lightweight agent written in C++. Unlike traditional desktop management solutions, Paragent Manage avoids the complexity and cost of servers by using peer-to-peer communication between agents and the administrative console. This allows real-time inventory searching, alerting and -software auditing in an easy-to-deploy and maintain package.\n\n +software auditing in an easy-to-deploy and maintain package. + ['"We have used Boost extensively throughout our agent, including: -[@../../libs/thread/index.html Thread], -[@../../libs/smart_ptr/index.html Shared Pointer], -[@../../libs/bind/index.html Bind], -[@../../libs/spirit/index.html Spirit], -[@../../libs/date_time/index.html Date Time], -[@../../libs/algorithm/string/index.html String Algorithms], -[@../../libs/multi_index/index.html Multi Index], -[@../../libs/filesystem/index.html Filesystem].\n\n -Apart from some read_write_mutex issues we had, Boost has been a +__thread, +__shared_ptr, +__bind, +__spirit, +__date_time, +__string_algo, +__multi_index, +__file_system.] + +['"Apart from some read_write_mutex issues we had, Boost has been a seamless part of our development, and has allowed us to develop and deploy a very complex, highly threaded networking agent with a built-in lisp-like xml-based scripting language all done in C++. Our entire @@ -397,14 +521,16 @@ development team would like to thank everyone for their hard work on behalf of C++ coders everywhere."] ] -[blurb [*LW-WORKS Software, Clipboard Recorder]\n\n +[blurb [*LW-WORKS Software, Clipboard Recorder] + [@http://www.lw-works.com/clipboard-recorder Clipboard Recorder] is an application that helps users to manage their clipboard history and provides easy ways for users to access their -saved clipboard data.\n\n +saved clipboard data. + Libraries used: -Smart Pointer, Serialization, Asio, String Algorithms, Bind, Thread, -Conversion/Cast, Iostreams. +__smart, __serialization, __asio, __string_algo, __bind, __thread, +__conversion, Iostreams. ] [endsect] @@ -419,31 +545,36 @@ Others are in highly specialized niche markets, ranging from probability theory astronomy, via mass spectroscopy: whatever your field of interest you'll find something of value in Boost. -[blurb [*Adobe Software Libraries]\n\n +[blurb [*Adobe Software Libraries] + The [@http://opensource.adobe.com/ Adobe Software Libraries] provide components for modeling the human interface appearance and behavior in a software application. The Adobe Software Libraries depend on many -parts of Boost including [@../../libs/any/index.html Any], -[@../../libs/bind/index.html Bind], [@../../libs/function/index.html Function], -[@../../libs/mpl/index.html MPL], [@../../libs/utility/operators.htm Operators], -[@../../libs/range/index.html Range], [@../../libs/static_assert/index.html Static Assertions], -[@../../libs/thread/index.html Threads], and [@../../libs/type_traits/index.html Type Traits].\n\n +parts of Boost including __any, +__bind, __function, +__mpl, __operators, +__range, __static_assert, +__thread, and __type_traits. + Currently Boost and the Adobe Software Libraries are in use in around 30 Adobe products. ] -[blurb [*LyX Document Editor]\n\n +[blurb [*LyX Document Editor] + [@http://www.lyx.org/ The LyX Document Editor] is an advanced open source document processor that encourages an approach to writing based on the structure of your documents, not their appearance. LyX produces high quality, professional output, -using LaTeX, an industrial strength typesetting engine.\n\n -LyX uses many parts of Boost, including [@../../libs/array/index.html Array], -[@../../libs/bind/index.html Bind], [@../../libs/regex/index.html Regex], -[@../../libs/type_traits/index.html Type Traits], -[@../../libs/function/index.html Function], -and [@../../libs/signals/index.html Signals].] +using LaTeX, an industrial strength typesetting engine. + +LyX uses many parts of Boost, including __array, +__bind, __regex, +__type_traits, +__function, +and __signals.] + +[blurb [*CodeSynthesis XML Schema to C++ Data Binding Compiler (XSD) by Code Synthesis Tools CC] -[blurb [*CodeSynthesis XML Schema to C++ Data Binding Compiler (XSD) by Code Synthesis Tools CC]\n\n [@http://codesynthesis.com/products/xsd/ CodeSynthesis XML Schema to C++ Data Binding Compiler (XSD)] is an open-source, cross-platform XML Data Binding implementation for C++. @@ -453,110 +584,177 @@ serialization code. You can then access the data stored in XML using types and functions that semantically correspond to your application domain rather than dealing with elements, attributes, and text in a direct representation of XML such as DOM or SAX. -\n\n -XSD uses the [@../../libs/regex/index.html Regex] and -[@../../libs/filesystem/index.html Filesystem] libraries from Boost. -[@../../libs/regex/index.html Regex] is used + +XSD uses __regex and +__file_system libraries from Boost. +__regex is used to perform transformations on file, type and member names. -[@../../libs/filesystem/index.html Filesystem] is used to +__file_system is used to capture and manipulate XML Schema include and import paths. Additionally, we are planning to provide an optional mapping of XML Schema date and time types to C++ types from the Boost -[@../../libs/date_time/index.html Date Time] library. +__date_time library. ] -[blurb [*CGAL]\n\n +[blurb [*CodeShop] + +I am happy to announce Amsterdam based [@http://www.code-shop.com CodeShop] +has been using Boost +since 2005 on all of it's projects (and CodeShop memebers have been +using Boost since 2001). + +We used it on the following: + +['OpenZoep] + +An open source voip stack (xmpp-sip/rtp/(port)audio/codecs), capable of +pc2pc calls and pc2pstn calls - it's a message based sdk, so you could +write your own Gtalk or Skype ... + +Boost is used everywhere: from the xmpp implementation (__function, +__asio) to the codecs-wrapper (__smart) - and more. +Boost made the code a lot easier, more fun, safer and faster to develop. +Bjam was used as build system. + +See [@http://www.code-shop.com/2007/1/14/openzoep description] +and [@http://www.code-shop.com/openzoep trac&svn]. + +['Abonja \/ Whitelabelvideo] + +Online videosharing platform: you can upload and watch flashvideo +online, but at the same time run your pc client and download all your +preferences automatically for viewing later at home + +Boost and C++ are used for the serverside tooling. Bjam is used as +build system. + +[@http://www.abonja.nl www.abonja.nl] and +[@www.whitelabelvideo.nl www.whitelabelvideo.nl] (Dutch only: a javascript sdk for viewing and +uploading - Boost is used serverside also). + +Code from above and other projects made available as plain download or +as library. + +Pieces address 'simple' problems like a windows registry wrapper to more +system like parts as for instance a drm implementation. Boost is used +all over (__filesystem, __thread, __asio, __spirit etc); +__bjam is used as build system. +] + +[blurb [*CGAL] + [@http://www.cgal.org/ CGAL] is the Computational Geometry Algorithms Library, an open source C++ library providing generic components such as triangulations, convex hulls algorithms, boolean operations of polygons and many other things. ['"We currently use the following Boost libraries : - [@../../libs/utility/operators.htm Operators], - [@../../libs/iterator/index.html Iterators], - [@../../libs/tuple/index.html Tuples], - [@../../libs/concept_check/index.html Concept Check], - [@../../libs/mpl/index.html MPL], - [@../../libs/bind/index.html Bind], - [@../../libs/optional/index.html Optional] and - [@../../libs/smart_ptr/index.html Smart Pointers]."] + __operators, + __iterator, + __tuple, + __concept_check, + __mpl, + __bind, + __optional and + __smart."] ] -[blurb [*ALPS]\n\n +[blurb [*ALPS] + [@http://alps.comp-phys.org/ ALPS] is an open source project to develop codes for the accurate simulation of quantum lattice models, such as quantum magnets, electronic systems and Bose-Einstein condensates. The main Boost libraries used are: -[@../../libs/graph/index.html Graph], -[@../../libs/random/index.html Random], -[@../../libs/multi_array/index.html Multi Array], -[@../../libs/program_options/index.html Program Options], -[@../../libs/conversion/lexical_cast.htm Lexical Cast], -[@../../libs/serialization/index.html Serialization], -[@../../libs/regex/index.html Regex], -[@../../libs/tuple/index.html Tuple], -[@../../libs/filesystem/index.html Filesystem], -[@../../libs/smart_ptr/index.html Smart Pointer], -[@../../libs/bind/index.html Bind], -[@../../libs/functional/index.html Functional] and -[@../../libs/type_traits/index.html Type Traits] +__graph, +__random, +__multi_index, +__program_options, +__lexical_cast, +__serialization, +__regex, +__tuple, +__file_system, +__smart, +__bind, +__functional and +__type_traits ] -[blurb [*SmartWin++]\n\n +[blurb [*SmartWin++] + [@http://smartwin.sourceforge.net/ SmartWin++] is a 100% free GUI library for developing Windows applications, it's free both as in "free beer" and as in "free speech", you can freely use SmartWin++ for commercial applications and for Open Source applications! ] -[blurb [*Open VRML]\n\n +[blurb [*Open VRML] + [@http://openvrml.org/ Open VRML] is a free cross-platform runtime for VRML. The basic OpenVRML distribution includes libraries you can use to add VRML support to an application, and Lookat, a simple stand-alone VRML browser. ] -[blurb [*Bayes++]\n\n +[blurb [*Bayes++] + [@http://bayesclasses.sourceforge.net/Bayes++.html Bayes++] is an open source library that represents and implements a wide variety of numerical algorithms for Bayesian Filtering of discrete systems from the [@http://www.acfr.usyd.edu.au/ Australian Centre for Field Robotics]. -Bayes++ makes particularly heavy use of [@../../libs/numeric/ublas/index.html the Boost Ublas library] +Bayes++ makes particularly heavy use of __ublas for matrix and numeric computations. ] -[blurb [*The C++/Tk Library]\n\n +[blurb [*Kohonen Neural Network Library (KNNL)] + +[@http://knnl.sourceforge.net/ Kohonen neural network library] +is a set of classes and functions for design, +train and use Kohonen networks (self organizing maps). + +KNNL Uses __bind, __function, __type_traits +__program_options. + +] + +[blurb [*The C++/Tk Library] + [@http://cpptk.sourceforge.net The C++/Tk Library] is an open source C++ interface to the Tk GUI Library. ] -[blurb [*GluCat]\n\n +[blurb [*GluCat] + [@http://glucat.sourceforge.net/ GluCat] is a library of template classes which model the universal Clifford algebras over the real or complex fields, with arbitrary dimension and arbitrary signature. ] -[blurb [*OpenMS]\n\n +[blurb [*OpenMS] + [@http://open-ms.sourceforge.net/main.html OpenMS] is an open source C++ library for LC/MS data management, reduction, evaluation, visualization, storage and sophisticated statistical analyses. It can be used to develop mass spectrometry related applications. ] -[blurb [*libpdf++]\n\n +[blurb [*libpdf++] + [@http://libpdfxx.sourceforge.net/doc/index.html libpdf++] is an object-oriented library for generating PDF (portable document format) files. It is designed in a way that the objects in the document are mapped directly to classes in the library. ] -[blurb [*Regina]\n\n +[blurb [*Regina] + [@http://regina.sourceforge.net/ Regina] is a suite of mathematical software for 3-manifold topologists. It focuses upon the study of 3-manifold triangulations and includes support for normal surfaces and angle structures. ] -[blurb [*MetaFS]\n\n +[blurb [*MetaFS] + [@http://metafs.sourceforge.net/ MetaFS] is a daemon for Linux (and Linux only) that allows you to access information about your files (such as MP3 tags or JPEG's EXIF tags) easily and consistently @@ -565,13 +763,15 @@ using this information. MetaFS is extensible, so anyone can write plug-ins to access new types of metadata. ] -[blurb [*The ASN.1 Tool]\n\n +[blurb [*The ASN.1 Tool] + Abstract Syntax Notation One (ASN.1) is a formal language for abstractly describing messages to be exchanged among an extensive range of applications involving the Internet, intelligent network, cellular phones, ground-to-air communications, electronic commerce, secure electronic services, interactive television, intelligent transportation -systems, Voice Over IP and others. \n\n +systems, Voice Over IP and others. + [@http://iiiasn1.sourceforge.net/main.html The ASN.1 Tool] includes two parts : an ASN.1 compiler "asnparser" which compiles the Abstract Syntax to c++ files, and a runtime library which is used to link with the c++ files generated by @@ -579,60 +779,71 @@ asnparser. Based on the works of Open H.323 projects, it is developed for the needs of H.450 series protocol. ] -[blurb [*DGD]\n\n +[blurb [*DGD] + [@http://dgd.sourceforge.net/dgd_home.html DGD] (Depression Glass Debug) is simple, easy to use C++ ostream extension created with a goal to produce nice, readable and easy to understand trace logs] -[blurb [*FEAR]\n\n +[blurb [*FEAR] + [@http://fear.sourceforge.net/ FEAR] is a language independent open-source project providing portable support for the creation of genuine Artificial Intelligence within realistic simulated worlds.] -[blurb [*XEngine]\n\n +[blurb [*XEngine] + [@http://xengine.sourceforge.net/features.php XEngine] is a platform- and rendering-API-independent 3D engine for real-time visualization with support for programmable graphics pipeline architectures and is implemented in C++.] -[blurb [*Spheral++]\n\n +[blurb [*Spheral++] + [@http://spheral.sourceforge.net/ Spheral++] is a numerical tool for simulating the evolution of a set of fluid or solid materials subject to hydrodynamic, gravitational, and radiative effects. -Spherical++ uses [@../../libs/python/doc/index.html the Boost Python library].] +Spherical++ uses __python.] + +[blurb [*C++ XML Objects] -[blurb [*C++ XML Objects]\n\n [@http://cppxmlobj.sourceforge.net/ C++ XML Objects] is a framework for persisting hierarchies of C++ objects to and from XML.] -[blurb [*HippoDraw]\n\n +[blurb [*HippoDraw] + [@http://www.slac.stanford.edu/grp/ek/hippodraw/index.html HippoDraw] provides a highly interactive data analysis environment. -HippoDraw uses [@../../libs/python/doc/index.html the Boost Python library].] +HippoDraw uses __python.] + +[blurb [*Orocos] -[blurb [*Orocos]\n\n [@http://people.mech.kuleuven.ac.be/~psoetens/orocos/doc/orocos-control-manual.html The Orocos Robot Control Software Application Framework].] -[blurb [*ECell]\n\n +[blurb [*ECell] + The [@http://www.e-cell.org/ E-Cell Project] is an international research project aiming at developing necessary theoretical supports, technologies and software platforms to allow precise whole cell simulation.] -[blurb [*VCS Made Easy]\n\n +[blurb [*VCS Made Easy] + [@http://vcsme.sourceforge.net/ VCS Made Easy], or vcsme for short, is an utility whose main purpose is to simplify the maintenance of file trees managed by a version control system, such as the well known CVS or Subversion. Simply put, it automates the process of bringing all these directories to an up-to-date -status with a single and simple command.\n\n +status with a single and simple command. + ['"The following Boost libraries were used: -[@../../libs/format/index.html Format], -[@../../libs/smart_ptr/index.html Smart Pointers], -[@../../libs/utility/index.html Utility (noncopyable)] and -[@../../libs/filesystem/index.html Filesystem]."] +__format, +__smart, +__utility and +__file_system."] ] -[blurb [*Monotone]\n\n +[blurb [*Monotone] + [@http://www.venge.net/monotone/ Monotone] is a free distributed version control system. It provides a simple, single-file transactional version store, with fully disconnected @@ -641,63 +852,71 @@ is a free distributed version control system. It provides code review and 3rd party testing. It uses cryptographic version naming and client-side RSA certificates. It has good internationalization support, has no external dependencies, runs on linux, solaris, OSX, windows, and - other unixes, and is licensed under the GNU GPL.\n\n + other unixes, and is licensed under the GNU GPL. + ['"The followind Boost libraries were used: -[@../../libs/date_time/index.html Date Time], -[@../../libs/filesystem/index.html Filesystem], -[@../../libs/conversion/index.html Conversion], -[@../../libs/optional/index.html Optional], -[@../../libs/random/index.html Random], -[@../../libs/regex/index.html Regex], -[@../../libs/smart_ptr/index.html Smart Pointers], -[@../../libs/static_assert/index.html Static Assertions], -[@../../libs/tokenizer/index.html Tokenizer], -[@../../libs/tuple/index.html Tuple] and -[@../../libs/test/index.html Test]."] +__date_time, +__file_system, +__conversion, +__optional, +__random, +__regex, +__smart, +__static_assert, +__tokenizer, +__tuple and +__test."] ] -[blurb [*Hydranode Engine]\n\n +[blurb [*Hydranode Engine] + [@http://hydranode.com/ Hydranode Engine] is a plugin-driven P2P client engine that relies heavily on Boost libraries. Hydranode codebase is licenced under GNU GPL, and is developed mainly by Alo Sarv. Currently in Beta phase, Hydranode runs on wide range of platforms, including Windows, Linux, -BSD, Mac OS, Solaris etc.\n\n +BSD, Mac OS, Solaris etc. + ['"Hydranode Engine and plugins rely heavily on the following Boost -libraries: Bind, Function, Lambda, MultiIndex, Signals, Threads, -Smart Pointer, Format, Lexical Cast. Other Boost libraries being used -include FileSystem, String Algorithm, Date Time, Program Options, Spirit, -Random, Tokenizer, Type Traits, Tribool, Tuple and Any. Once Boost 1.33 +libraries: __bind, __function, __lambda, __multi_index, __signals, Threads, +__smart, Format, __lexical_cast. Other Boost libraries being used +include __file_system, __string_algo, __date_time, __program_options, __spirit, +__random, __tokenizer, __type_traits, __tribool, __tuple and __any. Once Boost 1.33 is released, I'm also looking forward to using the Boost Iostreams library -in Hydranode.\n\n -All complex data structures in Hydranode are implemented using -Multi Index containers, which significantly reduced development time +in Hydranode.] + +['"All complex data structures in Hydranode are implemented using +__multi_index containers, which significantly reduced development time and kept code clean. Format is being used for all text formatting. -Having Threads and FileSystem libraries available made cross-platform +Having __thread and __file_system libraries available made cross-platform development lot easier in those areas."] ] -[blurb [*Hugin]\n\n +[blurb [*Hugin] + With [@http://hugin.sourceforge.net/ hugin] you can assemble a mosiac of photographs into a complete immersive panorama, stitch any series of overlapping pictures and much more.] -[blurb [*Enblend]\n\n +[blurb [*Enblend] + [@http://enblend.sourceforge.net/ Enblend] is a tool for compositing images. Given a set of images that overlap in some irregular way, Enblend overlays them in such a way that the seam between the images is invisible, or at least very difficult to see.] -[blurb [*GNU Source-highlight]\n\n +[blurb [*GNU Source-highlight] + [@http://www.gnu.org/software/src-highlite/source-highlight.html GNU Source-highlight], given a source file, produces a document with syntax highlighting. The colors and the styles can be specified (bold, italics, underline) by means of a configuration file, and some other options can be specified at the command line. The output format can be HTML, XHTML and ANSI color escape sequences. GNU Source Highlight -is build around [@../../libs/regex/index.html the Boost Regex library]] +is build around __regex] + +[blurb [*Luabind] -[blurb [*Luabind]\n\n [@http://luabind.sourceforge.net/ Luabind] is a library that helps you create bindings between C++ and lua. It has the ability to expose functions and classes, written in C++, to lua. It will also supply the functionality to define classes @@ -705,59 +924,68 @@ in lua and let them derive from other lua classes or C++ classes. Lua classes can override virtual functions from their C++ baseclasses. It is written towards lua 5.0, and does not work with lua 4.] -[blurb [*C++/Tcl]\n\n +[blurb [*C++/Tcl] + [@http://cpptcl.sourceforge.net/ C++/Tcl] is a library that allows the easy integration of C++ and Tcl.] -[blurb [*QuantLib]\n\n +[blurb [*QuantLib] + The [@http://quantlib.org/ QuantLib] project provides a comprehensive software -framework for quantitative finance. QuantLib is a free/open-source library +framework for quantitative finance. QuantLib is a free\/open-source library for modeling, trading, and risk management in real-life. Boost components used include -[@../../libs/smart_ptr/index.html Smart Pointers], -[@../../libs/iterator/index.html Iterators], -and [@../../libs/test/index.html the Test Framework]. +__smart, +__iterator, +and __test. ] -[blurb [*CBCanaylzer]\n\n +[blurb [*CBCanaylzer] + [@http://www.biozentrum.uni-wuerzburg.de/index.php?id=524 CBCanaylzer] is developed by the Department of Bioinformatics, -at the University of Wuerzburg.\n\n +at the University of Wuerzburg. + ['"CBCAnalyzer (CBC = compensatory base change) is a tool to create ``small'' phylogenetic trees from sequence alignments. To measure the distance of sequences the compensatory base changes are detected and counted. The bionj algorithm is then used to construct a tree. CBCAnalyzer is available on -Windows, Linux and partly works on MacOSX. \n\n -Boost libraries used: - [@../../libs/program_options/index.html Program Options] +Windows, Linux and partly works on MacOSX. ] + +['"Boost libraries used: + __program_options - creates really nice output, and is both easy to extend and simple to handle. - [@../../libs/iterator/index.html Iterator], - [@../../libs/spirit/index.html Spirit] + __iterator, + __spirit - Saved a lot of my time, and makes the vast amount of biological file formats simple to support, - [@../../libs/smart_ptr/index.html Shared Pointer], - [@../../libs/lambda/index.html Lambda].] + __shared_ptr, + __lambda.] ] -[blurb [*Profdist]\n\n +[blurb [*Profdist] + [@http://www.biozentrum.uni-wuerzburg.de/index.php?id=523 Profdist] -is developed by the Department of Bioinformatics, at the University of Wuerzburg.\n\n +is developed by the Department of Bioinformatics, at the University of Wuerzburg. + ['"Profdist is a tool for the construction of large phylogenetic trees based on profile distances. The input alignment data gets extended by random picking of rows, and a clustering technique is used to create profiles of the most frequent subtrees. The iterative approach allows working on large datasets. Currently the application is very limited by the quality of -wxWidgets, and only available for Windows and Linux. \n\n -The Boost librarie used were: - [@../../libs/algorithm/string/index.html String Algorithms], - [@../../libs/bind/ref.html Ref], - [@../../libs/iterator/index.html Iterator], - [@../../libs/spirit/index.html Spirit], - [@../../libs/smart_ptr/index.html Shared Pointer] and - [@../../libs/lambda/index.html Lambda]."] +wxWidgets, and only available for Windows and Linux. ] + +['"The Boost librarie used were: + __string_algo, + __ref, + __iterator, + __spirit, + __shared_ptr and + __lambda."] ] -[blurb [*The Yake Engine]\n\n +[blurb [*The Yake Engine] + [@http://www.yake.org/ The Yake Engine] is a component-based, object-oriented engine written in C++ and primarily designed for VR applications and games. It abstracts typical @@ -765,17 +993,20 @@ low-level and middleware APIs and provides various low, mid and application level functionality as well as tools to create and import content. ] -[blurb [*Python-Ogre]\n\n +[blurb [*Python-Ogre] + [@http://python-ogre.python-hosting.com/ Python-Ogre] is a Python bindings for Ogre 3D - a scene-oriented, -flexible 3D engine.\n -Python-Ogre uses Boost.Python to expose next libraries to Python:\n - * Ogre\n - * Newton\n - * ODE\n - * OgreAL\n - * CEGUI\n - * OIS\n +flexible 3D engine. + +Python-Ogre uses __python to expose next libraries to Python: + +* Ogre\n +* Newton\n +* ODE\n +* OgreAL\n +* CEGUI\n +* OIS\n ] [endsect] @@ -786,147 +1017,184 @@ Whether you're a government department, an internet startup, or a specialist con developement using the Boost Libraries can significantly shorten your development cycles. -[blurb [*Google]\n\n +[blurb [*Google] + [@http://code.google.com/p/google-gtags/ google-gtags] Provides server-based tags serving for large codebases. This is an extension to GNU Emacs and X-Emacs -TAGS functionality, that uses [@../../libs/test/index.html Boost.Test] as its +TAGS functionality, that uses __test as its unit test framework. ] -[blurb [*LiquidNet]\n\n +[blurb [*LiquidNet] + [@http://www.liquidnet.com/ LiquidNet] is Americas number one electronic marketplace for large block trading, and the 5th fastest growing company -according to Inc Magazine. \n\n -"['Boost Libraries most used, in order of importance:\n -[@../../libs/smart_ptr/index.html Shared Pointer], -[@../../libs/bind/index.html Bind], -[@../../libs/python/doc/index.html Python], -[@../../libs/conversion/lexical_cast.htm Lexical Cast], -[@../../libs/optional/index.html Optional], -[@../../libs/any/index.html Any] and -[@../../libs/tuple/index.html Tuple]] +according to Inc Magazine. + +"['Boost Libraries most used, in order of importance:] + +['"__shared_ptr, +__bind, +__python, +__lexical_cast, +__optional, +__any and +__tuple] ] -[blurb [*MetOcean Engineers]\n\n +[def __oce Oc'''é'''] + +[blurb [*__oce-Technologies B.V.] + +Throughout the world +[@http://www.oce.com __oce] is one of the major suppliers of document +management and printing systems and the related services. We develop, +manufacture, service and sell printers, scanners, peripheral +equipment and media, supported by unique software. __oce +products for the corporate and commercial market are widely known for +their quality, ease of use, speed and reliability. + +The Boost libraries enable us to get a higher degree of uniformity and +quality in our code. During a redesign last year we found that lots of +small constructions from Boost shortens development time and prevents +having to reinvent many wheels. Libraries that we use include +__assign, __date_time, __enable_if, __file_system, __format, __function, __iterator, +__multi_index, __operators, __optional, __pointer_cont, __signals, __smart, +__thread, and __variant. +] + +[blurb [*MetOcean Engineers] + [@http://www.metoceanengineers.com MetOcean Engineers] are a leading consultancy providing oceanographic and meteorological services in support of coastal and ocean engineering and environmental protection. Core activities encompass: oceanographic measurements; metocean monitoring systems; coastal and ocean engineering; environmental -consultancy; data management.\n\n +consultancy; data management. + Boost Libraries currently in use: -[@../../libs/any/index.html Any], -[@../../libs/assign/index.html Assign], -[@../../libs/bind/index.html Bind], -[@../../libs/date_time/index.html Date Time], -[@../../libs/iterator/index.html Iterators], -[@../../libs/conversion/lexical_cast.htm Lexical Cast], -[@../../libs/mpl/index.html MPL], -[@../../libs/spirit/phoenix/index.html Phoenix], -[@../../libs/program_options/index.html Program Options], -[@../../libs/bind/ref.html Ref], -[@../../libs/smart_ptr/index.html Smart Pointer], -[@../../libs/spirit/index.html Spirit], -[@../../libs/algorithm/string/index.html String Algorithm], -[@../../doc/html/tribool.html Tribool] and -[@../../libs/variant/index.html Variant] +__any, +__assign, +__bind, +__date_time, +__iterator, +__lexical_cast, +__mpl, +__phoenix, +__program_options, +__ref, +__smart, +__spirit, +__string_algo, +__tribool and +__variant ] -[blurb [*TeraView Ltd]\n\n +[blurb [*TeraView Ltd] + [@http://www.teraview.com TeraView Ltd] develop terahertz based systems for a variety of applications -including spectroscopy and imaging.\n\n +including spectroscopy and imaging. + ['"We use: -[@../../libs/thread/index.html Thread], -[@../../libs/filesystem/index.html Filesystem], -[@../../libs/date_time/index.html Date Time], -[@../../libs/serialization/index.html Serialization], -[@../../libs/smart_ptr/index.html Smart Pointer], -[@../../libs/function/index.html Function], -[@../../libs/bind/index.html Bind], -[@../../libs/iterator/index.html Iterator], -[@../../libs/conversion/lexical_cast.htm Lexical Cast], -[@../../libs/format/index.html Format], -[@../../libs/tuple/index.html Tuple], -[@../../libs/any/index.html Any] and -[@../../libs/optional/index.html Optional]"] +__thread, +__file_system, +__date_time, +__serialization, +__smart, +__function, +__bind, +__iterator, +__lexical_cast, +__format, +__tuple, +__any and +__optional"] ] -[blurb [*NPC International]\n\n +[blurb [*NPC International] + With about 800 restaurants, [@http://www.npcinternational.com NPC International] -is the world's largest Pizza Hut franchisee.\n\n +is the world's largest Pizza Hut franchisee. + ['"We make extensive use of boost in our internally developed point of sale, restaurant management, communications, and accounting systems. We use the following Boost libraries in approximate order of frequency of use: -[@../../libs/bind/index.html Bind], -[@../../libs/function/index.html Function], -[@../../libs/optional/index.html Optional], -[@../../libs/smart_ptr/index.html Shared Pointer], -[@../../libs/date_time/index.html Date Time], -[@../../libs/thread/index.html Thread], -[@../../libs/lambda/index.html Lambda], -[@../../libs/type_traits/index.html Type Traits], -[@../../libs/mpl/index.html MPL], -[@../../libs/tuple/index.html Tuple], -[@../../libs/utility/enable_if.html Enable If], -[@../../libs/variant/index.html Variant], -[@../../libs/spirit/index.html Spirit], -[@../../libs/algorithm/string/index.html String Algorithm], -[@../../libs/preprocessor/index.html Preprocessor], -[@../../libs/filesystem/index.html Filesystem], -[@../../libs/utility/operators.htm Operator], -[@../../libs/iterator/index.html Iterators] and -[@../../libs/tokenizer/index.html Tokenizer]."] +__bind, +__function, +__optional, +__shared_ptr, +__date_time, +__thread, +__lambda, +__type_traits, +__mpl, +__tuple, +__enable_if, +__variant, +__spirit, +__string_algo, +__preprocessor, +__file_system, +__operators, +__iterator and +__tokenizer."] ] -[blurb [*Rational Discovery LLC]\n\n +[blurb [*Rational Discovery LLC] + [@http://www.rationaldiscovery.com Rational Discovery] provides computational modeling, combinatorial library design and custom software development services to the -pharmaceutical, biotech and chemical industries.\n\n +pharmaceutical, biotech and chemical industries. + ['"We do a substantial amount of internal research to develop new approaches for applying machine-learning techniques to solve chemical problems. Because we're a small organization and chemistry is a large and complex field, it is essential that we be able to quickly and easily prototype and test new algorithms. We have found the Boost libraries, a reliable source of high-quality code, to be -indispensable.\n\n -Boost libraries used: -[@../../libs/python/index.html Python], -[@../../libs/graph/index.html Graph], -[@../../libs/smart_ptr/index.html Smart Pointer], -[@../../libs/any/index.html Any], -[@../../libs/conversion/lexical_cast.htm Lexical Cast], -[@../../libs/random/index.html Random], -[@../../libs/algorithm/string/index.html String Algorithms], -[@../../libs/tuple/index.html Tuple], -[@../../libs/numeric/ublas/index.html uBLAS]."] +indispensable.] + +['"Boost libraries used: +__python, +__graph, +__smart, +__any, +__lexical_cast, +__random, +__string_algo, +__tuple, +__ublas."] ] -[blurb [*Archelon LLC]\n\n +[blurb [*Archelon LLC] + [@http://www.archelon-us.com Archelon LLC] is a global securities firm headquartered in Chicago. We actively trade equities, futures and derivatives in both electronic and floor-based markets. Archelon is one of the highest volume market makers on EUREX and a leading -U.S. option market maker focusing on the most active securities.\n\n +U.S. option market maker focusing on the most active securities. + ['"We use: -[@../../libs/any/index.html Any], -[@../../libs/array/index.html Array], -[@../../libs/bind/index.html Bind], -[@../../libs/date_time/index.html Date Time], -[@../../libs/function/index.html Function], -[@../../libs/conversion/lexical_cast.htm Lexical Cast], -[@../../libs/optional/index.html Optional], -[@../../libs/rational/index.html Rational], -[@../../libs/regex/index.html Regex], -[@../../libs/signals/index.html Signals], -[@../../libs/smart_ptr/index.html Smart Pointer], -[@../../libs/tokenizer/index.html Tokenizer], -[@../../libs/tuple/index.html Tuple] and -[@../../libs/utility/index.html Utility]."] +__any, +__array, +__bind, +__date_time, +__function, +__lexical_cast, +__optional, +__rational, +__regex, +__signals, +__smart, +__tokenizer, +__tuple and +__utility."] ] -[blurb [*Automated Trading Deck] \n\n +[blurb [*Automated Trading Deck] + [@http://www.atdesk.com Automated Trading Deck] (ATD) uses a large number of Boost libraries. ATD is a technology company specializing in automated trading and customized equity execution solutions for its @@ -937,6 +1205,18 @@ and automated limit-order trading algorithms apply advanced expert systems to limit-order trading and customer executions. ] +[blurb [*"EB" Automotive] + +[@http://www.elektrobit.com/static/en/index.html "EB" Automotive] +is currently using __gil, __mpl and __string_algo +for a in house tool. Additionally we use Stefan Seefelds Boost.XML from +sandbox, with a few small extensions. + +['"Especially __gil gave our image preprocessing routines a strong +speed boost and greatly simplified our code".] +] + + [endsect] [section:submit Submissions]