diff --git a/.gitmodules b/.gitmodules index d72a772305..7c2114bde9 100644 --- a/.gitmodules +++ b/.gitmodules @@ -1,4 +1,284 @@ +[submodule "multi_array"] + path = libs/multi_array + url = ../multi_array.git + fetchRecurseSubmodules = on-demand +[submodule "math"] + path = libs/math + url = ../math.git + fetchRecurseSubmodules = on-demand [submodule "smart_ptr"] path = libs/smart_ptr url = ../smart_ptr.git fetchRecurseSubmodules = on-demand +[submodule "parameter"] + path = libs/parameter + url = ../parameter.git + fetchRecurseSubmodules = on-demand +[submodule "algorithm"] + path = libs/algorithm + url = ../algorithm.git + fetchRecurseSubmodules = on-demand +[submodule "any"] + path = libs/any + url = ../any.git + fetchRecurseSubmodules = on-demand +[submodule "concept_check"] + path = libs/concept_check + url = ../concept_check.git + fetchRecurseSubmodules = on-demand +[submodule "python"] + path = libs/python + url = ../python.git + fetchRecurseSubmodules = on-demand +[submodule "functional"] + path = libs/functional + url = ../functional.git + fetchRecurseSubmodules = on-demand +[submodule "config"] + path = libs/config + url = ../config.git + fetchRecurseSubmodules = on-demand +[submodule "exception"] + path = libs/exception + url = ../exception.git + fetchRecurseSubmodules = on-demand +[submodule "foreach"] + path = libs/foreach + url = ../foreach.git + fetchRecurseSubmodules = on-demand +[submodule "spirit"] + path = libs/spirit + url = ../spirit.git + fetchRecurseSubmodules = on-demand +[submodule "io"] + path = libs/io + url = ../io.git + fetchRecurseSubmodules = on-demand +[submodule "disjoint_sets"] + path = libs/disjoint_sets + url = ../disjoint_sets.git + fetchRecurseSubmodules = on-demand +[submodule "preprocessor"] + path = libs/preprocessor + url = ../preprocessor.git + fetchRecurseSubmodules = on-demand +[submodule "format"] + path = libs/format + url = ../format.git + fetchRecurseSubmodules = on-demand +[submodule "xpressive"] + path = libs/xpressive + url = ../xpressive.git + fetchRecurseSubmodules = on-demand +[submodule "integer"] + path = libs/integer + url = ../integer.git + fetchRecurseSubmodules = on-demand +[submodule "thread"] + path = libs/thread + url = ../thread.git + fetchRecurseSubmodules = on-demand +[submodule "tokenizer"] + path = libs/tokenizer + url = ../tokenizer.git + fetchRecurseSubmodules = on-demand +[submodule "timer"] + path = libs/timer + url = ../timer.git + fetchRecurseSubmodules = on-demand +[submodule "inspect"] + path = tools/inspect + url = ../inspect.git + fetchRecurseSubmodules = on-demand +[submodule "boostbook"] + path = tools/boostbook + url = ../boostbook.git + fetchRecurseSubmodules = on-demand +[submodule "regex"] + path = libs/regex + url = ../regex.git + fetchRecurseSubmodules = on-demand +[submodule "crc"] + path = libs/crc + url = ../crc.git + fetchRecurseSubmodules = on-demand +[submodule "random"] + path = libs/random + url = ../random.git + fetchRecurseSubmodules = on-demand +[submodule "serialization"] + path = libs/serialization + url = ../serialization.git + fetchRecurseSubmodules = on-demand +[submodule "test"] + path = libs/test + url = ../test.git + fetchRecurseSubmodules = on-demand +[submodule "date_time"] + path = libs/date_time + url = ../date_time.git + fetchRecurseSubmodules = on-demand +[submodule "logic"] + path = libs/logic + url = ../logic.git + fetchRecurseSubmodules = on-demand +[submodule "graph"] + path = libs/graph + url = ../graph.git + fetchRecurseSubmodules = on-demand +[submodule "numeric_conversion"] + path = libs/numeric/conversion + url = ../numeric_conversion.git + fetchRecurseSubmodules = on-demand +[submodule "lambda"] + path = libs/lambda + url = ../lambda.git + fetchRecurseSubmodules = on-demand +[submodule "mpl"] + path = libs/mpl + url = ../mpl.git + fetchRecurseSubmodules = on-demand +[submodule "typeof"] + path = libs/typeof + url = ../typeof.git + fetchRecurseSubmodules = on-demand +[submodule "tuple"] + path = libs/tuple + url = ../tuple.git + fetchRecurseSubmodules = on-demand +[submodule "utility"] + path = libs/utility + url = ../utility.git + fetchRecurseSubmodules = on-demand +[submodule "dynamic_bitset"] + path = libs/dynamic_bitset + url = ../dynamic_bitset.git + fetchRecurseSubmodules = on-demand +[submodule "assign"] + path = libs/assign + url = ../assign.git + fetchRecurseSubmodules = on-demand +[submodule "filesystem"] + path = libs/filesystem + url = ../filesystem.git + fetchRecurseSubmodules = on-demand +[submodule "compose"] + path = libs/compose + url = ../compose.git + fetchRecurseSubmodules = on-demand +[submodule "function"] + path = libs/function + url = ../function.git + fetchRecurseSubmodules = on-demand +[submodule "conversion"] + path = libs/conversion + url = ../conversion.git + fetchRecurseSubmodules = on-demand +[submodule "optional"] + path = libs/optional + url = ../optional.git + fetchRecurseSubmodules = on-demand +[submodule "variant"] + path = libs/variant + url = ../variant.git + fetchRecurseSubmodules = on-demand +[submodule "array"] + path = libs/array + url = ../array.git + fetchRecurseSubmodules = on-demand +[submodule "iostreams"] + path = libs/iostreams + url = ../iostreams.git + fetchRecurseSubmodules = on-demand +[submodule "multi_index"] + path = libs/multi_index + url = ../multi_index.git + fetchRecurseSubmodules = on-demand +[submodule "bcp"] + path = tools/bcp + url = ../bcp.git + fetchRecurseSubmodules = on-demand +[submodule "ptr_container"] + path = libs/ptr_container + url = ../ptr_container.git + fetchRecurseSubmodules = on-demand +[submodule "statechart"] + path = libs/statechart + url = ../statechart.git + fetchRecurseSubmodules = on-demand +[submodule "static_assert"] + path = libs/static_assert + url = ../static_assert.git + fetchRecurseSubmodules = on-demand +[submodule "range"] + path = libs/range + url = ../range.git + fetchRecurseSubmodules = on-demand +[submodule "signals"] + path = libs/signals + url = ../signals.git + fetchRecurseSubmodules = on-demand +[submodule "rational"] + path = libs/rational + url = ../rational.git + fetchRecurseSubmodules = on-demand +[submodule "tr1"] + path = libs/tr1 + url = ../tr1.git + fetchRecurseSubmodules = on-demand +[submodule "iterator"] + path = libs/iterator + url = ../iterator.git + fetchRecurseSubmodules = on-demand +[submodule "build"] + path = tools/build + url = ../build.git + fetchRecurseSubmodules = on-demand +[submodule "quickbook"] + path = tools/quickbook + url = ../quickbook.git + fetchRecurseSubmodules = on-demand +[submodule "graph_parallel"] + path = libs/graph_parallel + url = ../graph_parallel.git + fetchRecurseSubmodules = on-demand +[submodule "property_map"] + path = libs/property_map + url = ../property_map.git + fetchRecurseSubmodules = on-demand +[submodule "program_options"] + path = libs/program_options + url = ../program_options.git + fetchRecurseSubmodules = on-demand +[submodule "detail"] + path = libs/detail + url = ../detail.git + fetchRecurseSubmodules = on-demand +[submodule "interval"] + path = libs/numeric/interval + url = ../interval.git + fetchRecurseSubmodules = on-demand +[submodule "ublas"] + path = libs/numeric/ublas + url = ../ublas.git + fetchRecurseSubmodules = on-demand +[submodule "wave"] + path = libs/wave + url = ../wave.git + fetchRecurseSubmodules = on-demand +[submodule "type_traits"] + path = libs/type_traits + url = ../type_traits.git + fetchRecurseSubmodules = on-demand +[submodule "compatibility"] + path = libs/compatibility + url = ../compatibility.git + fetchRecurseSubmodules = on-demand +[submodule "bind"] + path = libs/bind + url = ../bind.git + fetchRecurseSubmodules = on-demand +[submodule "pool"] + path = libs/pool + url = ../pool.git + fetchRecurseSubmodules = on-demand diff --git a/Jamfile.v2 b/Jamfile.v2 new file mode 100644 index 0000000000..4dc63f7d5f --- /dev/null +++ b/Jamfile.v2 @@ -0,0 +1,477 @@ +# Copyright Vladimir Prus 2002-2006. +# Copyright Dave Abrahams 2005-2006. +# Copyright Rene Rivera 2005-2006. +# Copyright Douglas Gregor 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) + +# Usage: +# +# bjam [options] [install|stage] +# +# Builds and installs Boost. +# +# Targets and Related Options: +# +# install Install headers and compiled library files to the +# ======= configured locations (below). +# +# --prefix= Install architecture independent files here. +# Default; C:\Boost on Win32 +# Default; /usr/local on Unix. Linux, etc. +# +# --exec-prefix= Install architecture dependent files here. +# Default; +# +# --libdir= Install library files here. +# Default; /lib +# +# --includedir= Install header files here. +# Default; /include +# +# stage Build and install only compiled library files +# ===== to the stage directory. +# +# --stagedir= Install library files here +# Default; ./stage +# +# Other Options: +# +# --builddir=DIR Build in this location instead of building +# within the distribution tree. Recommended! +# +# --toolset=toolset Indicates the toolset to build with. +# +# --show-libraries Displays the list of Boost libraries that require +# build and installation steps, then exit. +# +# --layout= Determines whether to choose library names +# and header locations such that multiple +# versions of Boost or multiple compilers can +# be used on the same system. +# +# versioned (default) - Names of boost +# binaries include the Boost version +# number and the name and version of the +# compiler. Boost headers are installed +# in a subdirectory of whose +# name contains the Boost version +# number. +# +# system - Binaries names do not include +# the Boost version number or the name +# and version number of the compiler. +# Boost headers are installed directly +# into . This option is +# intended for system integrators who +# are building distribution packages. +# +# --buildid=ID Adds the specified ID to the name of built +# libraries. The default is to not add anything. +# +# --help This message. +# +# --with- Build and install the specified +# If this option is used, only libraries +# specified using this option will be built. +# +# --without- Do not build, stage, or install the specified +# . By default, all libraries are built. + +# TODO: +# - handle boost version +# - handle python options such as pydebug + +import modules ; +import set ; +import stage ; +import package ; +import path ; +import common ; +import os ; +import regex ; +import errors ; +import "class" : new ; +import common ; + +constant BOOST_VERSION : 1.34.1 ; + +local version-tag = [ MATCH "^([^.]+)[.]([^.]+)[.]([^.]+)" : $(BOOST_VERSION) ] ; +if $(version-tag[3]) = 0 +{ + version-tag = $(version-tag[1-2]) ; +} + +constant BOOST_VERSION_TAG : $(version-tag:J="_") ; + +local default-build ; +if $(__file__:D) = "" +{ + default-build = + debug release + single multi + shared static + ; + + if [ os.name ] = NT + { + default-build += shared static ; + } +} +else +{ + default-build = + debug + ; +} + + +rule handle-static-runtime ( properties * ) +{ + # This property combination is dangerous. + # Ideally, we'd add constraint to default build, + # so that user can build with property combination + # by hand. But we don't have any 'constraint' mechanism + # for default-build, so disable such builds in requirements. + + # For CW, static runtime is needed so that + # std::locale works. + if shared in $(properties) + && static in $(properties) + && ! ( cw in $(properties) ) + { + return no ; + } +} + + +project boost + : requirements . + # disable auto-linking for all targets here, + # primarily because it caused troubles with V2 + BOOST_ALL_NO_LIB=1 + # Used to encode variant in target name. See the + # 'tag' rule below. + @$(__name__).tag + @handle-static-runtime + + : usage-requirements . + : build-dir bin.v2 + : default-build $(default-build) + ; + +# Setup convenient aliases for all libraries. + +all-libraries = + [ MATCH .*libs/(.*)/build/.* : [ glob libs/*/build/Jamfile.v2 ] ] + ; + +# First, the complicated libraries: where the target name in +# Jamfile is different from directory name. +alias prg_exec_monitor : libs/test/build//boost_prg_exec_monitor ; +alias test_exec_monitor : libs/test/build//boost_test_exec_monitor ; +alias unit_test_framework : libs/test/build//boost_unit_test_framework ; +alias bgl-vis : libs/graps/build//bgl-vis ; +alias serialization : libs/serialization/build//boost_serialization ; +alias wserialization : libs/serialization/build//boost_wserialization ; + +explicit prg_exec_monitor test_exec_monitor unit_test_framework + bgl-vis serialization wserialization ; + +for local l in $(all-libraries) +{ + if ! $(l) in test graph serialization + { + alias $(l) : libs/$(l)/build//boost_$(l) ; + explicit $(l) ; + } +} + +alias headers : : : : . ; + + +# Decides which libraries are to be installed by looking at --with- +# --without- arguments. Returns the list of directories under "libs" +# which must be built at installed. +rule libraries-to-install ( existing-libraries * ) +{ + local argv = [ modules.peek : ARGV ] ; + local with-parameter = [ MATCH --with-(.*) : $(argv) ] ; + local without-parameter = [ MATCH --without-(.*) : $(argv) ] ; + + # Do some checks + if $(with-parameter) && $(without-parameter) + { + ECHO "error: both --with- and --without- specified" ; + EXIT ; + } + + local wrong = [ set.difference $(with-parameter) : $(existing-libraries) ] ; + if $(wrong) + { + ECHO "error: wrong library name '$(wrong[1])' in the --with- option." ; + EXIT ; + } + local wrong = [ set.difference $(without-parameter) : $(existing-libraries) ] ; + if $(wrong) + { + ECHO "error: wrong library name '$(wrong[1])' in the --without- option." ; + EXIT ; + } + + if $(with-parameter) + { + return [ set.intersection $(existing-libraries) : $(with-parameter) ] ; + } + else + { + return [ set.difference $(existing-libraries) : $(without-parameter) ] ; + } +} + +# what kind of layout are we doing? +layout = [ MATCH "^--layout=(.*)" : [ modules.peek : ARGV ] ] ; +layout ?= versioned ; +layout-$(layout) = true ; + +# possible stage only location +local stage-locate = [ MATCH "^--stagedir=(.*)" : [ modules.peek : ARGV ] ] ; +stage-locate ?= stage ; + +path-constant BOOST_STAGE_LOCATE : $(stage-locate) ; + + +# location of python +local python-root = [ MATCH "^--with-python-root=(.*)" : [ modules.peek : ARGV ] ] ; +PYTHON_ROOT ?= $(python-root) ; + +# Select the libraries to install. +libraries = [ libraries-to-install $(all-libraries) ] ; + +if --show-libraries in [ modules.peek : ARGV ] +{ + ECHO "The following libraries require building:" ; + for local l in $(libraries) + { + ECHO " - $(l)" ; + } + EXIT ; +} + +# Custom build ID. +local build-id = [ MATCH "^--buildid=(.*)" : [ modules.peek : ARGV ] ] ; +if $(build-id) +{ + constant BUILD_ID : [ regex.replace $(build-id) "[*\\/:.\"\' ]" "_" ] ; +} + +# This rule is called by Boost.Build to determine the name of +# target. We use it to encode build variant, compiler name and +# boost version in the target name +rule tag ( name : type ? : property-set ) +{ + if $(type) in STATIC_LIB SHARED_LIB IMPORT_LIB + { + if $(layout) = versioned + { + local result = [ common.format-name + -$(BOOST_VERSION_TAG) + -$(BUILD_ID) + : $(name) : $(type) : $(property-set) ] ; + + # Optionally add version suffix. + # On NT, library with version suffix won't be recognized + # by linkers. On CYGWIN, we get strage duplicate symbol + # errors when library is generated with version suffix. + # On OSX, version suffix is not needed -- the linker expets + # libFoo.1.2.3.dylib format. + # AIX linkers don't accept version suffixes either. + if $(type) = SHARED_LIB && + ! ( [ $(property-set).get ] in windows cygwin darwin aix ) + { + result = $(result).$(BOOST_VERSION) ; + } + + return $(result) ; + } + else + { + return [ common.format-name + -$(BUILD_ID) + : $(name) : $(type) : $(property-set) ] ; + } + } +} + +# Install to system location. + +local install-requirements = + boost + ; +if $(layout-versioned) +{ + install-requirements += boost-$(BOOST_VERSION_TAG)/boost ; +} +else +{ + install-requirements += boost ; +} +if [ modules.peek : NT ] +{ + install-requirements += C:/Boost ; +} +else if [ modules.peek : UNIX ] +{ + install-requirements += /usr/local ; +} + +local headers = + [ path.glob-tree boost : *.hpp *.ipp *.h *.inc : CVS ] + [ path.glob-tree boost/compatibility/cpp_c_headers : c* : CVS ] + [ path.glob-tree boost/test/utils/runtime : *.cpp : CVS ] + [ path.glob-tree boost/spirit/tree : + parsetree.dtd : CVS ] + [ path.glob-tree boost/tr1/tr1 : + algorithm array bitset complex deque exception fstream functional + iomanip ios iostream istream iterator limits list locale map + memory new numeric ostream queue random regex set sstream stack + stdexcept streambuf string strstream tuple type_traits typeinfo + utility valarray vector *.SUNWCCh : CVS ] + ; + + +# Complete install +package.install install-proper + : $(install-requirements) on + : + : libs/$(libraries)/build + : $(headers) + ; +explicit install-proper ; + +# Install just library. +install stage-proper + : libs/$(libraries)/build + : $(stage-locate)/lib + on LIB + on + ; +explicit stage-proper ; + + +if $(layout-versioned) + && ( [ modules.peek : NT ] || [ modules.peek : UNIX ] ) +{ + rule make-unversioned-links ( project name ? : property-set : sources * ) + { + local result ; + local filtered ; + local pattern ; + local nt = [ modules.peek : NT ] ; + + # Collect the libraries that have the version number in 'filtered'. + for local s in $(sources) + { + local m ; + if $(nt) + { + m = [ MATCH "(.*[.]lib)" : [ $(s).name ] ] ; + } + else + { + m = [ MATCH "(.*[.]so[.0-9]+)" "(.*[.]a)" : [ $(s).name ] ] ; + } + if $(m) + { + filtered += $(s) ; + } + } + + # Create hardlinks without version. + for local s in $(filtered) + { + local name = [ $(s).name ] ; + local ea = [ $(s).action ] ; + local ep = [ $(ea).properties ] ; + local a = [ + new non-scanning-action $(s) : common.hard-link : $(ep) ] ; + + local noversion-file ; + if $(nt) + { + noversion-file = [ MATCH "(.*)-[0-9_]+([.]lib)" : $(name) ] ; + } + else + { + noversion-file = + [ MATCH "(.*)-[0-9_]+([.]so)[.0-9]*" : $(name) ] + [ MATCH "(.*)-[0-9_]+([.]a)" : $(name) ] + [ MATCH "(.*)-[0-9_]+([.]dll[.]a)" : $(name) ] ; + } + + local new-name = + $(noversion-file[1])$(noversion-file[2]) ; + result += [ new file-target $(new-name) exact : [ $(s).type ] : $(project) + : $(a) ] ; + + } + return $(result) ; + } + + generate stage-unversioned : stage-proper : + @make-unversioned-links ; + explicit stage-unversioned ; + + generate install-unversioned : install-proper : + @make-unversioned-links ; + explicit install-unversioned ; +} +else +{ + # Create do-nothing aliases + alias stage-unversioned ; + alias install-unversioned ; +} + +alias install : install-proper install-unversioned ; +alias stage : stage-proper stage-unversioned ; +explicit install ; +explicit stage ; + + +# Just build the libraries, don't install them anywhere. +# This is what happens with just "bjam --v2". +alias build_all : libs/$(libraries)/build ; + +# This rule should be called from libraries' Jamfiles and will +# create two targets, "install" and "stage", that will install +# or stage that library. The --prefix option is respected, by +# --with and --without options, naturally, are ignored. +# +# - libraries -- list of library targets to install. +rule boost-install ( libraries * ) +{ + package.install install + : /boost//install-headers $(install-requirements) + : # No binaries + : $(libraries) + : # No headers, it's handled by the dependency + ; + + install stage : $(libraries) : $(BOOST_STAGE_LOCATE) ; + + local c = [ project.current ] ; + local project-module = [ $(c).project-module ] ; + module $(project-module) + { + explicit stage ; + } +} + +# Make project ids of all libraries known. +for local l in $(libraries) +{ + use-project /boost/$(l) : libs/$(l)/build ; +} diff --git a/Jamrules b/Jamrules new file mode 100644 index 0000000000..9458d4b8be --- /dev/null +++ b/Jamrules @@ -0,0 +1,15 @@ +# Boost.Build top level Jamrules + +# See tools/build/index.html for documentation. +project boost ; + +# Set some important global variables if they haven't already been set by the +# user on the command-line or in the environment + +# Establish this as the root of the boost installation. Most targets will want +# $(BOOST_ROOT) in their #include path. +path-global BOOST_ROOT : . ; + +# The current version of Boost. +BOOST_VERSION ?= 1.34.0 ; + diff --git a/LICENSE_1_0.txt b/LICENSE_1_0.txt new file mode 100644 index 0000000000..36b7cd93cd --- /dev/null +++ b/LICENSE_1_0.txt @@ -0,0 +1,23 @@ +Boost Software License - Version 1.0 - August 17th, 2003 + +Permission is hereby granted, free of charge, to any person or organization +obtaining a copy of the software and accompanying documentation covered by +this license (the "Software") to use, reproduce, display, distribute, +execute, and transmit the Software, and to prepare derivative works of the +Software, and to permit third-parties to whom the Software is furnished to +do so, all subject to the following: + +The copyright notices in the Software and this entire statement, including +the above license grant, this restriction and the following disclaimer, +must be included in all copies of the Software, in whole or in part, and +all derivative works of the Software, unless such copies or derivative +works are solely in the form of machine-executable object code generated by +a source language processor. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT +SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE +FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, +ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER +DEALINGS IN THE SOFTWARE. diff --git a/README b/README new file mode 100644 index 0000000000..43eb2f2447 --- /dev/null +++ b/README @@ -0,0 +1,18 @@ +Copyright 2000-2003 Beman Dawes +Distributed under the Boost Software License, Version 1.0. (See accompany- +ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + +Unless otherwise specified, all Boost software and documentation is subject +to the Boost Software License Version 1.0. See the accompanying file LICENSE_1_0.txt. +A copy of the license is also available at http://www.boost.org/LICENSE_1_0.txt. + +For the most current version of Boost libraries and documentation, see: + + http://www.boost.org + +Boost documentation is in HTML format. + +The top-level directory (which contains this README file) should contain +a file named index.htm with links to all documentation, including +documentation on building boost libraries for your particular compiler +and operating system. diff --git a/boost-build.jam b/boost-build.jam new file mode 100644 index 0000000000..dda1ba26cc --- /dev/null +++ b/boost-build.jam @@ -0,0 +1,9 @@ +#~ Copyright (C) 2002-2003, David Abrahams. +#~ Copyright (C) 2002-2003, Vladimir Prus. +#~ Copyright (C) 2003, Rene Rivera. +#~ 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) + +BOOST_ROOT = $(.boost-build-file:D) ; +boost-build tools/build/v2 ; diff --git a/boost.css b/boost.css new file mode 100644 index 0000000000..9f8d4bda8f --- /dev/null +++ b/boost.css @@ -0,0 +1,65 @@ +/*============================================================================= + Copyright 2002 William E. Kempf + Distributed under the Boost Software License, Version 1.0. (See accompany- + ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +=============================================================================*/ + +H1 +{ + FONT-SIZE: 200%; + COLOR: #00008B; +} +H2 +{ + FONT-SIZE: 150%; +} +H3 +{ + FONT-SIZE: 125%; +} +H4 +{ + FONT-SIZE: 108%; +} +BODY +{ + FONT-SIZE: 100%; + BACKGROUND-COLOR: #ffffff; +} +PRE +{ + MARGIN-LEFT: 2em; + FONT-FAMILY: Courier, + monospace; +} +CODE +{ + FONT-FAMILY: Courier, + monospace; +} +CODE.as_pre +{ + white-space: pre; +} +.index +{ + TEXT-ALIGN: left; +} +.page-index +{ + TEXT-ALIGN: left; +} +.definition +{ + TEXT-ALIGN: left; +} +.footnote +{ + FONT-SIZE: 66%; + VERTICAL-ALIGN: super; + TEXT-DECORATION: none; +} +.function-semantics +{ + CLEAR: left; +} \ No newline at end of file diff --git a/boost.png b/boost.png new file mode 100644 index 0000000000..b4d51fcd5c Binary files /dev/null and b/boost.png differ diff --git a/configure b/configure new file mode 100755 index 0000000000..60391df0da --- /dev/null +++ b/configure @@ -0,0 +1,347 @@ +#!/bin/sh +# Copyright (C) 2005, 2006 Douglas Gregor. +# Copyright (C) 2006 The Trustees of Indiana University +# +# Distributed under the Boost Software License, Version 1.0. +# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) + +# boostinspect:notab - Tabs are required for the Makefile. + +BJAM="" +TOOLSET="" +BJAM_CONFIG="" +BUILD="" +PREFIX=/usr/local +EPREFIX= +LIBDIR= +INCLUDEDIR= +LIBS="" +PYTHON=python +PYTHON_VERSION= +PYTHON_ROOT= +ICU_ROOT= + +# Internal flags +flag_no_python= +flag_icu= +flag_show_libraries= + +for option +do + case $option in + + -help | --help | -h) + want_help=yes ;; + + -prefix=* | --prefix=*) + PREFIX=`expr "x$option" : "x-*prefix=\(.*\)"` + ;; + + -exec-prefix=* | --exec-prefix=*) + EPREFIX=`expr "x$option" : "x-*exec-prefix=\(.*\)"` + ;; + + -libdir=* | --libdir=*) + LIBDIR=`expr "x$option" : "x-*libdir=\(.*\)"` + ;; + + -includedir=* | --includedir=*) + INCLUDEDIR=`expr "x$option" : "x-*includedir=\(.*\)"` + ;; + + -show-libraries | --show-libraries ) + flag_show_libraries=yes + ;; + + -with-bjam=* | --with-bjam=* ) + BJAM=`expr "x$option" : "x-*with-bjam=\(.*\)"` + ;; + + -with-icu | --with-icu ) + flag_icu=yes + ;; + + -with-icu=* | --with-icu=* ) + flag_icu=yes + ICU_ROOT=`expr "x$option" : "x-*with-icu=\(.*\)"` + ;; + + -without-icu | --without-icu ) + flag_icu=no + ;; + + -with-libraries=* | --with-libraries=* ) + library_list=`expr "x$option" : "x-*with-libraries=\(.*\)"` + if test "$library_list" != "all"; then + old_IFS=$IFS + IFS=, + for library in $library_list + do + LIBS="$LIBS --with-$library" + + if test $library = python; then + requested_python=yes + fi + done + IFS=$old_IFS + + if test "x$requested_python" != xyes; then + flag_no_python=yes + fi + fi + ;; + + -without-libraries=* | --without-libraries=* ) + library_list=`expr "x$option" : "x-*without-libraries=\(.*\)"` + old_IFS=$IFS + IFS=, + for library in $library_list + do + LIBS="$LIBS --without-$library" + + if test $library = python; then + flag_no_python=yes + fi + done + IFS=$old_IFS + ;; + + -with-python=* | --with-python=* ) + PYTHON=`expr "x$option" : "x-*with-python=\(.*\)"` + ;; + + -with-python-root=* | --with-python-root=* ) + PYTHON_ROOT=`expr "x$option" : "x-*with-python-root=\(.*\)"` + ;; + + -with-python-version=* | --with-python-version=* ) + PYTHON_VERSION=`expr "x$option" : "x-*with-python-version=\(.*\)"` + ;; + + -with-toolset=* | --with-toolset=* ) + TOOLSET=`expr "x$option" : "x-*with-toolset=\(.*\)"` + ;; + + -*) + { echo "error: unrecognized option: $option +Try \`$0 --help' for more information." >&2 + { (exit 1); exit 1; }; } + ;; + + esac +done + +if test "x$want_help" = xyes; then + cat < config.log 2>&1 + cd $pwd + arch=`cd $my_dir/tools/jam/src && ./bootstrap/jam0 -d0 -f build.jam --toolset=$TOOLSET --toolset-root= --show-locate-target && cd ..` + BJAM="$my_dir/tools/jam/src/$arch/bjam" + echo "tools/jam/src/$arch/bjam" +fi + +# TBD: Turn BJAM into an absolute path + +# If there is a list of libraries +if test "x$flag_show_libraries" = xyes; then + libraries=`$BJAM -d0 --show-libraries` + cat < /dev/null 2>&1` + if [ "$?" -ne "0" ]; then + flag_no_python=yes + fi +fi + +if test "x$flag_no_python" = x; then + if test "x$PYTHON_VERSION" = x; then + echo -n "Detecting Python version... " + PYTHON_VERSION=`$PYTHON -c "import sys; print (\"%d.%d\" % (sys.version_info[0], sys.version_info[1]))"` + echo $PYTHON_VERSION + fi + + if test "x$PYTHON_ROOT" = x; then + echo -n "Detecting Python root... " + PYTHON_ROOT=`$PYTHON -c "import sys; print sys.prefix"` + echo $PYTHON_ROOT + fi +fi + +# Configure ICU +echo -n "Unicode/ICU support for Boost.Regex?... " +if test "x$flag_icu" != xno; then + if test "x$ICU_ROOT" = x; then + COMMON_ICU_PATHS="/usr /usr/local /sw" + for p in $COMMON_ICU_PATHS; do + if test -r $p/include/unicode/utypes.h; then + ICU_ROOT=$p + fi + done + + if test "x$ICU_ROOT" = x; then + echo "not found." + else + BJAM_CONFIG="$BJAM_CONFIG -sICU_PATH=$ICU_ROOT" + echo "$ICU_ROOT" + fi + else + BJAM_CONFIG="$BJAM_CONFIG -sICU_PATH=$ICU_ROOT" + echo "$ICU_ROOT" + fi +else + echo "disabled." +fi + +# Backup the user's existing user-config.jam +JAM_CONFIG_OUT="user-config.jam" +if test -r "user-config.jam"; then + counter=1 + + while test -r "user-config.jam.$counter"; do + counter=`expr $counter + 1` + done + + echo "Backing up existing Boost.Build configuration in user-config.jam.$counter" + mv "user-config.jam" "user-config.jam.$counter" +fi + +# Generate user-config.jam +echo "Generating Boost.Build configuration in user-config.jam..." +cat > user-config.jam <> user-config.jam < Makefile < +# +# 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) + +project boost/doc ; +import boostbook : boostbook ; + +boostbook doc : src/boost.xml + : + + ## Build the various generated docs (Doxygen and QuickBook)... + + ../libs/program_options/doc//autodoc.xml + ../libs/algorithm/string/doc//autodoc.xml + ../libs/logic/doc//reference.xml + ../libs/functional/hash/doc//hash + ../libs/type_traits/doc//type_traits + ../libs/static_assert/doc//static_assert + ../libs/tr1/doc//tr1 + ../libs/math/doc//math + ../libs/foreach/doc//foreach + ../libs/typeof/doc//typeof + ../libs/xpressive/doc//autodoc.xml + ../libs/xpressive/doc//xpressive + ../libs/date_time/xmldoc//date_time_autodoc.xml + ../libs/date_time/xmldoc//gregorian_autodoc.xml + ../libs/date_time/xmldoc//posix_time_autodoc.xml + ../libs/date_time/xmldoc//local_time_autodoc.xml + ../more/whos_using//using + ../tools/jam/doc//bjam + ../tools/quickbook/doc//quickbook + + ## Add path references to the QuickBook generated docs... + + ../libs/functional/hash/doc//hash + ../libs/type_traits/doc//type_traits + ../libs/static_assert/doc//static_assert + ../libs/tr1/doc//tr1 + ../libs/math/doc//math + ../libs/foreach/doc//foreach + ../libs/typeof/doc//typeof + ../libs/xpressive/doc//xpressive + ../more/whos_using//using + ../tools/jam/doc//bjam + ../tools/quickbook/doc//quickbook + + boost.libraries=../../libs/libraries.htm + ; diff --git a/doc/html/CopyConstructible.html b/doc/html/CopyConstructible.html new file mode 100644 index 0000000000..56fa4307fb --- /dev/null +++ b/doc/html/CopyConstructible.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/CopyConstructible.html + + diff --git a/doc/html/any.html b/doc/html/any.html new file mode 100644 index 0000000000..2141a8521c --- /dev/null +++ b/doc/html/any.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/any.html + + diff --git a/doc/html/array.html b/doc/html/array.html new file mode 100644 index 0000000000..3753f99a5e --- /dev/null +++ b/doc/html/array.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/array.html + + diff --git a/doc/html/bbv2.html b/doc/html/bbv2.html new file mode 100644 index 0000000000..de8a954aec --- /dev/null +++ b/doc/html/bbv2.html @@ -0,0 +1,23 @@ + + + + + + + + Redirect to generated documentation + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/bbv2.html + + diff --git a/doc/html/bbv2/installation.html b/doc/html/bbv2/installation.html new file mode 100644 index 0000000000..b5b613f2a3 --- /dev/null +++ b/doc/html/bbv2/installation.html @@ -0,0 +1,17 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/bbv2/installation.html + + + + diff --git a/doc/html/boost_math.html b/doc/html/boost_math.html new file mode 100644 index 0000000000..2f33332e03 --- /dev/null +++ b/doc/html/boost_math.html @@ -0,0 +1,18 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math.html + + + + + diff --git a/doc/html/boost_math/gcd_lcm.html b/doc/html/boost_math/gcd_lcm.html new file mode 100644 index 0000000000..53d2bb67c7 --- /dev/null +++ b/doc/html/boost_math/gcd_lcm.html @@ -0,0 +1,17 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/gcd_lcm.html + + + + diff --git a/doc/html/boost_math/inverse_complex.html b/doc/html/boost_math/inverse_complex.html new file mode 100644 index 0000000000..8499ef36d8 --- /dev/null +++ b/doc/html/boost_math/inverse_complex.html @@ -0,0 +1,17 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/inverse_complex.html + + + + diff --git a/doc/html/boost_math/math_special_functions.html b/doc/html/boost_math/math_special_functions.html new file mode 100644 index 0000000000..0b1827e623 --- /dev/null +++ b/doc/html/boost_math/math_special_functions.html @@ -0,0 +1,24 @@ + + + + + + + + Redirect to generated documentation + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/math_special_functions.html + + + diff --git a/doc/html/boost_math/octonions.html b/doc/html/boost_math/octonions.html new file mode 100644 index 0000000000..20c69b0442 --- /dev/null +++ b/doc/html/boost_math/octonions.html @@ -0,0 +1,24 @@ + + + + + + + + Redirect to generated documentation + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/octonions.html + + + diff --git a/doc/html/boost_math/quaternions.html b/doc/html/boost_math/quaternions.html new file mode 100644 index 0000000000..d39159f3ab --- /dev/null +++ b/doc/html/boost_math/quaternions.html @@ -0,0 +1,24 @@ + + + + + + + + Redirect to generated documentation + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/quaternions.html + + + diff --git a/doc/html/boost_staticassert.html b/doc/html/boost_staticassert.html new file mode 100644 index 0000000000..9a7ac49d2e --- /dev/null +++ b/doc/html/boost_staticassert.html @@ -0,0 +1,16 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_staticassert.html + + + diff --git a/doc/html/boost_tr1.html b/doc/html/boost_tr1.html new file mode 100644 index 0000000000..b2e34e2094 --- /dev/null +++ b/doc/html/boost_tr1.html @@ -0,0 +1,16 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_tr1.html + + + diff --git a/doc/html/boost_typetraits.html b/doc/html/boost_typetraits.html new file mode 100644 index 0000000000..b3fd407679 --- /dev/null +++ b/doc/html/boost_typetraits.html @@ -0,0 +1,16 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_typetraits.html + + + diff --git a/doc/html/boost_typetraits/background.html b/doc/html/boost_typetraits/background.html new file mode 100644 index 0000000000..4d6e8eaf0f --- /dev/null +++ b/doc/html/boost_typetraits/background.html @@ -0,0 +1,17 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_typetraits/background.html + + + + diff --git a/doc/html/boostbook.css b/doc/html/boostbook.css new file mode 100644 index 0000000000..2e2ee71d7e --- /dev/null +++ b/doc/html/boostbook.css @@ -0,0 +1,519 @@ +/*============================================================================= + Copyright (c) 2004 Joel de Guzman + http://spirit.sourceforge.net/ + + Distributed under the Boost Software License, Version 1.0. (See accompany- + ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +=============================================================================*/ + +/*============================================================================= + Body defaults +=============================================================================*/ + + body + { + margin: 1em; + font-family: sans-serif; + } + +/*============================================================================= + Paragraphs +=============================================================================*/ + + p + { + text-align: left; + font-size: 10pt; + line-height: 1.15; + } + +/*============================================================================= + Program listings +=============================================================================*/ + + /* Code on paragraphs */ + p tt.computeroutput + { + font-size: 9pt; + } + + pre.synopsis + { + font-size: 90%; + margin: 1pc 4% 0pc 4%; + padding: 0.5pc 0.5pc 0.5pc 0.5pc; + } + + .programlisting, + .screen + { + font-size: 9pt; + display: block; + margin: 1pc 4% 0pc 4%; + padding: 0.5pc 0.5pc 0.5pc 0.5pc; + } + + /* Program listings in tables don't get borders */ + td .programlisting, + td .screen + { + margin: 0pc 0pc 0pc 0pc; + padding: 0pc 0pc 0pc 0pc; + } + +/*============================================================================= + Headings +=============================================================================*/ + + h1, h2, h3, h4, h5, h6 + { + text-align: left; + margin: 1em 0em 0.5em 0em; + font-weight: bold; + } + + h1 { font: 140% } + h2 { font: bold 140% } + h3 { font: bold 130% } + h4 { font: bold 120% } + h5 { font: italic 110% } + h6 { font: italic 100% } + + /* Top page titles */ + title, + h1.title, + h2.title + h3.title, + h4.title, + h5.title, + h6.title, + .refentrytitle + { + font-weight: bold; + margin-bottom: 1pc; + } + + h1.title { font-size: 140% } + h2.title { font-size: 140% } + h3.title { font-size: 130% } + h4.title { font-size: 120% } + h5.title { font-size: 110% } + h6.title { font-size: 100% } + + .section h1 + { + margin: 0em 0em 0.5em 0em; + font-size: 140%; + } + + .section h2 { font-size: 140% } + .section h3 { font-size: 130% } + .section h4 { font-size: 120% } + .section h5 { font-size: 110% } + .section h6 { font-size: 100% } + + /* Code on titles */ + h1 tt.computeroutput { font-size: 140% } + h2 tt.computeroutput { font-size: 140% } + h3 tt.computeroutput { font-size: 130% } + h4 tt.computeroutput { font-size: 120% } + h5 tt.computeroutput { font-size: 110% } + h6 tt.computeroutput { font-size: 100% } + +/*============================================================================= + Author +=============================================================================*/ + + h3.author + { + font-size: 100% + } + +/*============================================================================= + Lists +=============================================================================*/ + + li + { + font-size: 10pt; + line-height: 1.3; + } + + /* Unordered lists */ + ul + { + text-align: left; + } + + /* Ordered lists */ + ol + { + text-align: left; + } + +/*============================================================================= + Links +=============================================================================*/ + + a + { + text-decoration: none; /* no underline */ + } + + a:hover + { + text-decoration: underline; + } + +/*============================================================================= + Spirit style navigation +=============================================================================*/ + + .spirit-nav + { + text-align: right; + } + + .spirit-nav a + { + color: white; + padding-left: 0.5em; + } + + .spirit-nav img + { + border-width: 0px; + } + +/*============================================================================= + Table of contents +=============================================================================*/ + + .toc + { + margin: 1pc 4% 0pc 4%; + padding: 0.1pc 1pc 0.1pc 1pc; + font-size: 80%; + line-height: 1.15; + } + + .boost-toc + { + float: right; + padding: 0.5pc; + } + +/*============================================================================= + Tables +=============================================================================*/ + + .table-title, + div.table p.title + { + margin-left: 4%; + padding-right: 0.5em; + padding-left: 0.5em; + } + + .informaltable table, + .table table + { + width: 92%; + margin-left: 4%; + margin-right: 4%; + } + + div.informaltable table, + div.table table + { + padding: 4px; + } + + /* Table Cells */ + div.informaltable table tr td, + div.table table tr td + { + padding: 0.5em; + text-align: left; + font-size: 9pt; + } + + div.informaltable table tr th, + div.table table tr th + { + padding: 0.5em 0.5em 0.5em 0.5em; + border: 1pt solid white; + font-size: 80%; + } + +/*============================================================================= + Blurbs +=============================================================================*/ + + div.note, + div.tip, + div.important, + div.caution, + div.warning, + p.blurb + { + font-size: 9pt; /* A little bit smaller than the main text */ + line-height: 1.2; + display: block; + margin: 1pc 4% 0pc 4%; + padding: 0.5pc 0.5pc 0.5pc 0.5pc; + } + + p.blurb img + { + padding: 1pt; + } + +/*============================================================================= + Variable Lists +=============================================================================*/ + + /* Make the terms in definition lists bold */ + div.variablelist dl dt, + span.term + { + font-weight: bold; + font-size: 10pt; + } + + div.variablelist table tbody tr td + { + text-align: left; + vertical-align: top; + padding: 0em 2em 0em 0em; + font-size: 10pt; + margin: 0em 0em 0.5em 0em; + line-height: 1; + } + + div.variablelist dl dt + { + margin-bottom: 0.2em; + } + + div.variablelist dl dd + { + margin: 0em 0em 0.5em 2em; + font-size: 10pt; + } + + div.variablelist table tbody tr td p, + div.variablelist dl dd p + { + margin: 0em 0em 0.5em 0em; + line-height: 1; + } + +/*============================================================================= + Misc +=============================================================================*/ + + /* Title of books and articles in bibliographies */ + span.title + { + font-style: italic; + } + + span.underline + { + text-decoration: underline; + } + + span.strikethrough + { + text-decoration: line-through; + } + + /* Copyright, Legal Notice */ + div div.legalnotice p + { + text-align: left + } + +/*============================================================================= + Colors +=============================================================================*/ + + @media screen + { + /* Links */ + a + { + color: #005a9c; + } + + a:visited + { + color: #9c5a9c; + } + + h1 a, h2 a, h3 a, h4 a, h5 a, h6 a, + h1 a:hover, h2 a:hover, h3 a:hover, h4 a:hover, h5 a:hover, h6 a:hover, + h1 a:visited, h2 a:visited, h3 a:visited, h4 a:visited, h5 a:visited, h6 a:visited + { + text-decoration: none; /* no underline */ + color: #000000; + } + + /* Syntax Highlighting */ + .keyword { color: #0000AA; } + .identifier { color: #000000; } + .special { color: #707070; } + .preprocessor { color: #402080; } + .char { color: teal; } + .comment { color: #800000; } + .string { color: teal; } + .number { color: teal; } + .white_bkd { background-color: #FFFFFF; } + .dk_grey_bkd { background-color: #999999; } + + /* Copyright, Legal Notice */ + .copyright + { + color: #666666; + font-size: small; + } + + div div.legalnotice p + { + color: #666666; + } + + /* Program listing */ + pre.synopsis + { + border: 1px solid #DCDCDC; + } + + .programlisting, + .screen + { + border: 1px solid #DCDCDC; + } + + td .programlisting, + td .screen + { + border: 0px solid #DCDCDC; + } + + /* Blurbs */ + div.note, + div.tip, + div.important, + div.caution, + div.warning, + p.blurb + { + border: 1px solid #DCDCDC; + } + + /* Table of contents */ + .toc + { + border: 1px solid #DCDCDC; + } + + /* Tables */ + div.informaltable table tr td, + div.table table tr td + { + border: 1px solid #DCDCDC; + } + + div.informaltable table tr th, + div.table table tr th + { + background-color: #F0F0F0; + border: 1px solid #DCDCDC; + } + + /* Misc */ + span.highlight + { + color: #00A000; + } + } + + @media print + { + /* Links */ + a + { + color: black; + } + + a:visited + { + color: black; + } + + .spirit-nav + { + display: none; + } + + /* Program listing */ + pre.synopsis + { + border: 1px solid gray; + } + + .programlisting, + .screen + { + border: 1px solid gray; + } + + td .programlisting, + td .screen + { + border: 0px solid #DCDCDC; + } + + /* Table of contents */ + .toc + { + border: 1px solid gray; + } + + .informaltable table, + .table table + { + border: 1px solid gray; + border-collapse: collapse; + } + + /* Tables */ + div.informaltable table tr td, + div.table table tr td + { + border: 1px solid gray; + } + + div.informaltable table tr th, + div.table table tr th + { + border: 1px solid gray; + } + + /* Misc */ + span.highlight + { + font-weight: bold; + } + } + +/*============================================================================= + Images +=============================================================================*/ + + span.inlinemediaobject img + { + vertical-align: middle; + } \ No newline at end of file diff --git a/doc/html/boostbook.html b/doc/html/boostbook.html new file mode 100644 index 0000000000..d2625c55b8 --- /dev/null +++ b/doc/html/boostbook.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boostbook.html + + diff --git a/doc/html/date_time.html b/doc/html/date_time.html new file mode 100644 index 0000000000..59170c5341 --- /dev/null +++ b/doc/html/date_time.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/date_time.html + + diff --git a/doc/html/date_time/date_time_io.html b/doc/html/date_time/date_time_io.html new file mode 100644 index 0000000000..5e19ac1acd --- /dev/null +++ b/doc/html/date_time/date_time_io.html @@ -0,0 +1,24 @@ + + + + + + + + Redirect to generated documentation + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/date_time/date_time_io.html + + + diff --git a/doc/html/date_time/details.html b/doc/html/date_time/details.html new file mode 100644 index 0000000000..3c9b9c7eb0 --- /dev/null +++ b/doc/html/date_time/details.html @@ -0,0 +1,24 @@ + + + + + + + + Redirect to generated documentation + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/date_time/details.html + + + diff --git a/doc/html/date_time/local_time.html b/doc/html/date_time/local_time.html new file mode 100644 index 0000000000..a7a6fedbfb --- /dev/null +++ b/doc/html/date_time/local_time.html @@ -0,0 +1,24 @@ + + + + + + + + Redirect to generated documentation + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/date_time/local_time.html + + + diff --git a/doc/html/docutils.css b/doc/html/docutils.css new file mode 100644 index 0000000000..620cf86102 --- /dev/null +++ b/doc/html/docutils.css @@ -0,0 +1,275 @@ +/* +:Author: David Goodger +:Contact: goodger@python.org +:Date: $Date$ +:Revision: $Revision$ +:Copyright: This stylesheet has been placed in the public domain. + +Default cascading style sheet for the HTML output of Docutils. + +See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to +customize this style sheet. +*/ + +/* used to remove borders from tables and images */ +.borderless, table.borderless td, table.borderless th { + border: 0 } + +table.borderless td, table.borderless th { + /* Override padding for "table.docutils td" with "! important". + The right padding separates the table cells. */ + padding: 0 0.5em 0 0 ! important } + +.first { + /* Override more specific margin styles with "! important". */ + margin-top: 0 ! important } + +.last, .with-subtitle { + margin-bottom: 0 ! important } + +.hidden { + display: none } + +a.toc-backref { + text-decoration: none ; + color: black } + +blockquote.epigraph { + margin: 2em 5em ; } + +dl.docutils dd { + margin-bottom: 0.5em } + +/* Uncomment (and remove this text!) to get bold-faced definition list terms +dl.docutils dt { + font-weight: bold } +*/ + +div.abstract { + margin: 2em 5em } + +div.abstract p.topic-title { + font-weight: bold ; + text-align: center } + +div.admonition, div.attention, div.caution, div.danger, div.error, +div.hint, div.important, div.note, div.tip, div.warning { + margin: 2em ; + border: medium outset ; + padding: 1em } + +div.admonition p.admonition-title, div.hint p.admonition-title, +div.important p.admonition-title, div.note p.admonition-title, +div.tip p.admonition-title { + font-weight: bold ; + font-family: sans-serif } + +div.attention p.admonition-title, div.caution p.admonition-title, +div.danger p.admonition-title, div.error p.admonition-title, +div.warning p.admonition-title { + color: red ; + font-weight: bold ; + font-family: sans-serif } + +/* Uncomment (and remove this text!) to get reduced vertical space in + compound paragraphs. +div.compound .compound-first, div.compound .compound-middle { + margin-bottom: 0.5em } + +div.compound .compound-last, div.compound .compound-middle { + margin-top: 0.5em } +*/ + +div.dedication { + margin: 2em 5em ; + text-align: center ; + font-style: italic } + +div.dedication p.topic-title { + font-weight: bold ; + font-style: normal } + +div.figure { + margin-left: 2em ; + margin-right: 2em } + +div.footer, div.header { + clear: both; + font-size: smaller } + +div.line-block { + display: block ; + margin-top: 1em ; + margin-bottom: 1em } + +div.line-block div.line-block { + margin-top: 0 ; + margin-bottom: 0 ; + margin-left: 1.5em } + +div.sidebar { + margin-left: 1em ; + border: medium outset ; + padding: 1em ; + background-color: #ffffee ; + width: 40% ; + float: right ; + clear: right } + +div.sidebar p.rubric { + font-family: sans-serif ; + font-size: medium } + +div.system-messages { + margin: 5em } + +div.system-messages h1 { + color: red } + +div.system-message { + border: medium outset ; + padding: 1em } + +div.system-message p.system-message-title { + color: red ; + font-weight: bold } + +div.topic { + margin: 2em } + +h1.section-subtitle, h2.section-subtitle, h3.section-subtitle, +h4.section-subtitle, h5.section-subtitle, h6.section-subtitle { + margin-top: 0.4em } + +h1.title { + text-align: center } + +h2.subtitle { + text-align: center } + +hr.docutils { + width: 75% } + +img.align-left { + clear: left } + +img.align-right { + clear: right } + +ol.simple, ul.simple { + margin-bottom: 1em } + +ol.arabic { + list-style: decimal } + +ol.loweralpha { + list-style: lower-alpha } + +ol.upperalpha { + list-style: upper-alpha } + +ol.lowerroman { + list-style: lower-roman } + +ol.upperroman { + list-style: upper-roman } + +p.attribution { + text-align: right ; + margin-left: 50% } + +p.caption { + font-style: italic } + +p.credits { + font-style: italic ; + font-size: smaller } + +p.label { + white-space: nowrap } + +p.rubric { + font-weight: bold ; + font-size: larger ; + color: maroon ; + text-align: center } + +p.sidebar-title { + font-family: sans-serif ; + font-weight: bold ; + font-size: larger } + +p.sidebar-subtitle { + font-family: sans-serif ; + font-weight: bold } + +p.topic-title { + font-weight: bold } + +pre.address { + margin-bottom: 0 ; + margin-top: 0 ; + font-family: serif ; + font-size: 100% } + +pre.literal-block, pre.doctest-block { + margin-left: 2em ; + margin-right: 2em } + +span.classifier { + font-family: sans-serif ; + font-style: oblique } + +span.classifier-delimiter { + font-family: sans-serif ; + font-weight: bold } + +span.interpreted { + font-family: sans-serif } + +span.option { + white-space: nowrap } + +span.pre { + white-space: pre } + +span.problematic { + color: red } + +span.section-subtitle { + /* font-size relative to parent (h1..h6 element) */ + font-size: 80% } + +table.citation { + border-left: solid 1px gray; + margin-left: 1px } + +table.docinfo { + margin: 2em 4em } + +table.docutils { + margin-top: 0.5em ; + margin-bottom: 0.5em } + +table.footnote { + border-left: solid 1px black; + margin-left: 1px } + +table.docutils td, table.docutils th, +table.docinfo td, table.docinfo th { + padding-left: 0.5em ; + padding-right: 0.5em ; + vertical-align: top } + +table.docutils th.field-name, table.docinfo th.docinfo-name { + font-weight: bold ; + text-align: left ; + white-space: nowrap ; + padding-left: 0 } + +h1 tt.docutils, h2 tt.docutils, h3 tt.docutils, +h4 tt.docutils, h5 tt.docutils, h6 tt.docutils { + font-size: 100% } + +ul.auto-toc { + list-style-type: none } diff --git a/doc/html/foreach.html b/doc/html/foreach.html new file mode 100644 index 0000000000..31fa6defa6 --- /dev/null +++ b/doc/html/foreach.html @@ -0,0 +1,16 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/foreach.html + + + diff --git a/doc/html/function.html b/doc/html/function.html new file mode 100644 index 0000000000..57aec643e5 --- /dev/null +++ b/doc/html/function.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/function.html + + diff --git a/doc/html/functionN.html b/doc/html/functionN.html new file mode 100755 index 0000000000..d8d4a6f511 --- /dev/null +++ b/doc/html/functionN.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/functionN.html + + diff --git a/doc/html/hash.html b/doc/html/hash.html new file mode 100644 index 0000000000..cb7563619b --- /dev/null +++ b/doc/html/hash.html @@ -0,0 +1,23 @@ + + + + + + + + Redirect to generated documentation + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/hash.html + + diff --git a/doc/html/images/blank.png b/doc/html/images/blank.png new file mode 100644 index 0000000000..764bf4f0c3 Binary files /dev/null and b/doc/html/images/blank.png differ diff --git a/doc/html/images/caution.png b/doc/html/images/caution.png new file mode 100644 index 0000000000..5b7809ca4a Binary files /dev/null and b/doc/html/images/caution.png differ diff --git a/doc/html/images/draft.png b/doc/html/images/draft.png new file mode 100644 index 0000000000..0084708c9b Binary files /dev/null and b/doc/html/images/draft.png differ diff --git a/doc/html/images/home.png b/doc/html/images/home.png new file mode 100644 index 0000000000..5584aacb09 Binary files /dev/null and b/doc/html/images/home.png differ diff --git a/doc/html/images/important.png b/doc/html/images/important.png new file mode 100644 index 0000000000..12c90f607a Binary files /dev/null and b/doc/html/images/important.png differ diff --git a/doc/html/images/next.png b/doc/html/images/next.png new file mode 100644 index 0000000000..59800b4e87 Binary files /dev/null and b/doc/html/images/next.png differ diff --git a/doc/html/images/next_disabled.png b/doc/html/images/next_disabled.png new file mode 100755 index 0000000000..10a8c59d7b Binary files /dev/null and b/doc/html/images/next_disabled.png differ diff --git a/doc/html/images/note.png b/doc/html/images/note.png new file mode 100644 index 0000000000..d0c3c645ab Binary files /dev/null and b/doc/html/images/note.png differ diff --git a/doc/html/images/prev.png b/doc/html/images/prev.png new file mode 100644 index 0000000000..d88a40f923 Binary files /dev/null and b/doc/html/images/prev.png differ diff --git a/doc/html/images/prev_disabled.png b/doc/html/images/prev_disabled.png new file mode 100755 index 0000000000..ab3c17e02d Binary files /dev/null and b/doc/html/images/prev_disabled.png differ diff --git a/doc/html/images/tip.png b/doc/html/images/tip.png new file mode 100644 index 0000000000..5c4aab3bb3 Binary files /dev/null and b/doc/html/images/tip.png differ diff --git a/doc/html/images/toc-blank.png b/doc/html/images/toc-blank.png new file mode 100644 index 0000000000..6ffad17a0c Binary files /dev/null and b/doc/html/images/toc-blank.png differ diff --git a/doc/html/images/toc-minus.png b/doc/html/images/toc-minus.png new file mode 100644 index 0000000000..abbb020c8e Binary files /dev/null and b/doc/html/images/toc-minus.png differ diff --git a/doc/html/images/toc-plus.png b/doc/html/images/toc-plus.png new file mode 100644 index 0000000000..941312ce0d Binary files /dev/null and b/doc/html/images/toc-plus.png differ diff --git a/doc/html/images/up.png b/doc/html/images/up.png new file mode 100644 index 0000000000..17d9c3ec49 Binary files /dev/null and b/doc/html/images/up.png differ diff --git a/doc/html/images/up_disabled.png b/doc/html/images/up_disabled.png new file mode 100755 index 0000000000..e22bc87121 Binary files /dev/null and b/doc/html/images/up_disabled.png differ diff --git a/doc/html/images/warning.png b/doc/html/images/warning.png new file mode 100644 index 0000000000..1c33db8f34 Binary files /dev/null and b/doc/html/images/warning.png differ diff --git a/doc/html/jam.html b/doc/html/jam.html new file mode 100644 index 0000000000..fae54151a8 --- /dev/null +++ b/doc/html/jam.html @@ -0,0 +1,23 @@ + + + + + + + + Redirect to generated documentation + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/jam.html + + diff --git a/doc/html/jam/building.html b/doc/html/jam/building.html new file mode 100644 index 0000000000..cb8a6891c2 --- /dev/null +++ b/doc/html/jam/building.html @@ -0,0 +1,25 @@ + + + + + + + + Redirect to generated documentation + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/jam/building.html + + + + diff --git a/doc/html/lambda.html b/doc/html/lambda.html new file mode 100644 index 0000000000..bb25fd472e --- /dev/null +++ b/doc/html/lambda.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/lambda.html + + diff --git a/doc/html/program_options.html b/doc/html/program_options.html new file mode 100644 index 0000000000..572a2b9eca --- /dev/null +++ b/doc/html/program_options.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/program_options.html + + diff --git a/doc/html/ref.html b/doc/html/ref.html new file mode 100644 index 0000000000..3b1c0952fd --- /dev/null +++ b/doc/html/ref.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/ref.html + + diff --git a/doc/html/reference.css b/doc/html/reference.css new file mode 100644 index 0000000000..6826962afc --- /dev/null +++ b/doc/html/reference.css @@ -0,0 +1,11 @@ +/*============================================================================ + Copyright 2003-2004 Douglas Gregor + Distributed under the Boost Software License, Version 1.0. (See accompany- + ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +============================================================================*/ + +PRE.synopsis { + background-color: #e0ffff; + border: thin solid blue; + padding: 1em +} \ No newline at end of file diff --git a/doc/html/signals.html b/doc/html/signals.html new file mode 100644 index 0000000000..819aa99abc --- /dev/null +++ b/doc/html/signals.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/signals.html + + diff --git a/doc/html/string_algo.html b/doc/html/string_algo.html new file mode 100644 index 0000000000..0f0975158a --- /dev/null +++ b/doc/html/string_algo.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/string_algo.html + + diff --git a/doc/html/thread.html b/doc/html/thread.html new file mode 100644 index 0000000000..fbde210423 --- /dev/null +++ b/doc/html/thread.html @@ -0,0 +1,20 @@ + + + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/thread.html + + diff --git a/doc/html/tribool.html b/doc/html/tribool.html new file mode 100644 index 0000000000..c08a9f684f --- /dev/null +++ b/doc/html/tribool.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/tribool.html + + diff --git a/doc/html/typeof.html b/doc/html/typeof.html new file mode 100644 index 0000000000..4c0c55b12b --- /dev/null +++ b/doc/html/typeof.html @@ -0,0 +1,23 @@ + + + + + + + + Redirect to generated documentation + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/typeof.html + + diff --git a/doc/html/variant.html b/doc/html/variant.html new file mode 100644 index 0000000000..98af2cbb15 --- /dev/null +++ b/doc/html/variant.html @@ -0,0 +1,15 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/variant.html + + diff --git a/doc/html/who_s_using_boost_.html b/doc/html/who_s_using_boost_.html new file mode 100644 index 0000000000..3a14bd2172 --- /dev/null +++ b/doc/html/who_s_using_boost_.html @@ -0,0 +1,16 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/who_s_using_boost_.html + + + diff --git a/doc/html/xpressive.html b/doc/html/xpressive.html new file mode 100644 index 0000000000..f34983ec79 --- /dev/null +++ b/doc/html/xpressive.html @@ -0,0 +1,16 @@ + + + + + + + + Automatic redirection failed, please go to + http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/xpressive.html + + + diff --git a/doc/src/boost.xml b/doc/src/boost.xml new file mode 100644 index 0000000000..7e56f61b67 --- /dev/null +++ b/doc/src/boost.xml @@ -0,0 +1,732 @@ + + + + + The Boost C++ Libraries BoostBook Documentation Subset + + + What's Included in This Document + + This document represents only a subset of the full Boost + documentation: that part which is generated from BoostBook or + QuickBook sources. Eventually all Boost libraries may use these + formats, but in the meantime, much of Boost's documentation is not + available here. Please + see http://www.boost.org/libs + for complete documentation. + + + + Documentation for some of the libraries described in this document is + available in alternative formats: + + + HTML (tarred, gzipped) + + + PDF + + + + Unix man pages + + + + DocBook + + + + XSL Formatting Objects + + + + + + + + + The Boost C++ Libraries (BoostBook Subset) + + + + + + + + Peter + Dimov + + Generalized binders for function/object/pointers and member functions + + + + + + + + Peter + Dimov + + Generalized binders for member functions + + + + + + + + John + Maddock + + + Howard + Hinnant + + Defines types for passing parameters + + + + + + + + Ralf + Grosse-Kunstleve + + + Jens + Maurer + + Help for non-conforming standard libraries + + + + + + + + Nicolai + Josuttis + + + Functional composition adapters for the STL + + + + + + + + John + Maddock + + + Howard + Hinnant + + Empty member optimization + + + + + + + + + Jeremy + Siek + + Tools for generic programming + + + + Boost.Concept_Check + + + + + + + John + Maddock + + + Beman + Dawes + + + Vesa + Karvonen + + + Helps boost library developers adapt to compiler idiosyncrasies; not intended for library users + + + + + + + + Dave + Abrahams + + + Kevlin + Henney + + + Numeric, polymorphic, and lexical casts + + + + + + + + Daryle + Walker + + + Cyclic Redundancy Code + + + + + + + + + + Jeremy + Siek + + + Chuck + Allison + + A runtime sized version of std::bitset + + + + + + + + Samuel + Krempp + + + Type-safe 'printf-like' format operations + + + + + + + + + Beman + Dawes + + + Portable paths, iteration over directories, and other useful filesystem operations + + + + + + + + + + + + Mark + Rodgers + + Enhanced function object adaptors + + + + + + + + + + Jeremy + Siek + + + University of Notre Dame + Team + + Generic graph components and algorithms + + + + + + + + + + various + authors + + + Headers to ease dealing with integral types + + + + + + + + Guillaume + Melquiond + + + Hervé + Brönnimann + + + Sylvain + Pion + + + Extends the usual arithmetic functions to mathematical intervals + + + + + + + + Daryle + Walker + + + Save I/O state to prevent jumbled data + + + + + + + + Dave + Abrahams + + + Jeremy + Siek + + + John + Potter + + + Adapt a base type into a standard conforming iterator + + + + + + + + + + various + authors + + + Several contributions in the domain of mathematics + + + + + + + + + + Daryle + Walker + + + Greatest common divisor and least common multiple + + + + + + + + Hubert + Holin + + + Octonions + + + + + + + + Hubert + Holin + + + Quaternions + + + + + + + + Hubert + Holin + + + Mathematical special functions such as atanh, sinc, and sinhc + + + + + + + + Aleksey + Gurtovoy + + + Template metaprogramming framework of compile-time algorithms, sequences and metafunction classes + + + + + + + + Ron + Garcia + + + Multidimensional containers and adaptors for arrays of contiguous data + + + + + + + + + Dave + Abrahams + + + Jeremy + Siek + + + Templates ease arithmetic classes and iterators + + + + + + + + + + Fernando + Cacciola + + + Discriminated-union wrapper for optional values + + + + + + + + + Steve + Cleary + + + Memory pool management + + + + + + + + Vesa + Karvonen + + + Paul + Mensonides + + + Preprocessor metaprogramming tools including repetition and recursion + + + + + + + + + + Jeremy + Siek + + Concepts defining interfaces which map key objects to value objects + + + + + + + + + Dave + Abrahams + + Reflects C++ classes and functions into Python + + + + + + + + Jens + Maurer + + A complete system for random number generation + + + + + + + + Paul + Moore + + A rational number class + + + + + + + + + + John + Maddock + + Regular expression library + + + + + + + + Robert + Ramey + + Serialization of C++ objects for persistence and marshalling + + + + + + + + + + Greg + Colvin + + + Beman + Dawes + + + Peter + Dimov + + + Darin + Adler + + Five smart pointer class templates + + + + + + + + Joel + de Guzman + + + team + + + LL parser framework represents parsers directly as EBNF grammars in inlined C++ + + + + + + + + + + + + + Gennadiy + Rozental + + Support for simple program testing, full unit testing, and for program execution monitoring + + + + + + + + + + Beman + Dawes + + Event timer, progress timer, and progress display classes + + + + + + + + John + Bandela + + Break of a string or other character sequence into a series of tokens + + + + + + + + + + + + Jaakko + Järvi + + Ease definition of functions returning multiple values, and more + + + + + + + + + + + + Joerg + Walter + + + Mathias + Koch + + Basic linear algebra for dense, packed and sparse matrices + + + + + + + + Dave + Abrahams + + + others + + + Class noncopyable plus checked_delete, checked_array_delete, next, prior function templates, plus base-from-member idiom + + + + + + + + + + + + + Boost Tools + + Boost developers, testers, and maintainers have developed various programs to + help with the administration of the Boost Libraries. Like everything else about + Boost, these tools are available in source form, and are part of the regular + Boost distribution. + + + Users may find these tools useful when porting Boost libraries to a new platform, + or for use with their own applications. + + + + + + + + + + diff --git a/google_logo_40wht.png b/google_logo_40wht.png new file mode 100644 index 0000000000..4564914167 Binary files /dev/null and b/google_logo_40wht.png differ diff --git a/index.htm b/index.htm new file mode 100644 index 0000000000..5fbb59962a --- /dev/null +++ b/index.htm @@ -0,0 +1,578 @@ + + + + + Boost C++ Libraries + + + + + + + +
+
+
+
+
+

+ +

“...one of the + most highly regarded and expertly designed C++ library projects + in the world.” — + Herb Sutter and Andrei + Alexandrescu, C++ Coding + Standards

+ +
+
+
+ +
+ + + + + + + + + + +
+ +
+

Welcome to Boost.org!

+ +
+
+
+

Boost provides free peer-reviewed portable C++ + source libraries.

+ +

We emphasize libraries that work well with the C++ + Standard Library. Boost libraries are intended to be + widely useful, and usable across a broad spectrum of + applications. The Boost license encourages + both commercial and non-commercial use.

+ +

We aim to establish "existing practice" and + provide reference implementations so that Boost + libraries are suitable for eventual standardization. + Ten Boost libraries are already included in the + C++ + Standards Committee's Library Technical Report ( + + TR1) as a step toward becoming part of a future + C++ Standard. More Boost libraries are proposed for + the upcoming + TR2.

+ +

Getting + started: Boost works + on almost any modern operating system, including UNIX + and Windows variants. Follow the Getting Started Guide + to download and install Boost. Popular Linux and Unix + distributions such as Fedora, Debian, and NetBSD include pre-built + Boost packages. Boost may also already be available + on your organization's internal web + server.

+ +

Background: The Background Information + page has introductory material to help those + educating their organization about Boost.

+
+
+
+
+ +
+

Participation

+ +
+
+
+

Although Boost was begun by members of the C++ + Standards Committee Library Working Group, + participation has expanded to include thousands of + programmers from the C++ community at large.

+ +

If you are interested in participating in Boost, + please join our main developers mailing + list. Discussions are highly technical, and list + members are encouraged to participate in formal + reviews of proposed libraries. There is also a + users mailing + list, and several project specific + lists.

+ +

Both the main Boost developers list and the users + list are also accessible as newsgroups.

+
+
+
+
+ +
+

Latest News

+ +
+
+
+ +

July 24, 2007 - Version 1.34.1

+ +

This is a bug fix release addressing many problems with the 1.34.0 release. + It is a recommended upgrade for all users of Boost 1.34.0. For a complete list of fixes see + Boost Trac.

+ +

Supported Compilers

+ +

New in this release is improved support for + the IBM XL C/C++ compiler.

+ +

Boost is tested on a wide range of compilers and + platforms. Since Boost libraries rely on modern C++ + features not available in all compilers, not all + Boost libraries will work with every compiler. + The following compilers and platforms have been + extensively tested with Boost, although many other + compilers and platforms will work as well. For more + information, see the regression + test results.

+ + + +

Acknowledgements

+ +

Thomas Witt + managed this release.

+ +

A great number of people contributed their time + and expertise to make this release possible. Special + thanks go to Kim Barrett consolidating Boost.Iostreams changes + from various branches and Rene Rivera for general build and installation + support.

+ +
+
+
+
+ +
+
+
+
+
+
+ + diff --git a/libs/algorithm b/libs/algorithm new file mode 160000 index 0000000000..d4b95734dd --- /dev/null +++ b/libs/algorithm @@ -0,0 +1 @@ +Subproject commit d4b95734dd3dd9827c4d65d4a8d69fe965d454b9 diff --git a/libs/any b/libs/any new file mode 160000 index 0000000000..c2aa7a895d --- /dev/null +++ b/libs/any @@ -0,0 +1 @@ +Subproject commit c2aa7a895d95047f1e9e38e41a894c645bcf8303 diff --git a/libs/array b/libs/array new file mode 160000 index 0000000000..0a4d7e81ef --- /dev/null +++ b/libs/array @@ -0,0 +1 @@ +Subproject commit 0a4d7e81efdf55af47dc77c0157bdfa32137e3be diff --git a/libs/assign b/libs/assign new file mode 160000 index 0000000000..22b6f7eed1 --- /dev/null +++ b/libs/assign @@ -0,0 +1 @@ +Subproject commit 22b6f7eed11505ea0eb3e6d90e168d088f74574a diff --git a/libs/bind b/libs/bind new file mode 160000 index 0000000000..77d2c4bab1 --- /dev/null +++ b/libs/bind @@ -0,0 +1 @@ +Subproject commit 77d2c4bab1e19889ba96e796296c058191402682 diff --git a/libs/compatibility b/libs/compatibility new file mode 160000 index 0000000000..0cbae63142 --- /dev/null +++ b/libs/compatibility @@ -0,0 +1 @@ +Subproject commit 0cbae63142d21a69dd849a4ab6e3ea59f5c5666a diff --git a/libs/compose b/libs/compose new file mode 160000 index 0000000000..226c215150 --- /dev/null +++ b/libs/compose @@ -0,0 +1 @@ +Subproject commit 226c21515026ba7a1cfbfd6c1e390a37b4d070b7 diff --git a/libs/concept_check b/libs/concept_check new file mode 160000 index 0000000000..96d6053a52 --- /dev/null +++ b/libs/concept_check @@ -0,0 +1 @@ +Subproject commit 96d6053a524c60ea8a909293c7a26ded0a3f21bd diff --git a/libs/config b/libs/config new file mode 160000 index 0000000000..d9de80031d --- /dev/null +++ b/libs/config @@ -0,0 +1 @@ +Subproject commit d9de80031d16cf824389909ff2a35e905f831755 diff --git a/libs/conversion b/libs/conversion new file mode 160000 index 0000000000..4224fa5deb --- /dev/null +++ b/libs/conversion @@ -0,0 +1 @@ +Subproject commit 4224fa5deb2709fd14239fef634a75ba081b4cbc diff --git a/libs/crc b/libs/crc new file mode 160000 index 0000000000..d4a7a7829e --- /dev/null +++ b/libs/crc @@ -0,0 +1 @@ +Subproject commit d4a7a7829ea2d978553ee78b25dbd400c68952d1 diff --git a/libs/date_time b/libs/date_time new file mode 160000 index 0000000000..f79faf89f8 --- /dev/null +++ b/libs/date_time @@ -0,0 +1 @@ +Subproject commit f79faf89f8cc18003be683ce10f9374fba27c187 diff --git a/libs/detail b/libs/detail new file mode 160000 index 0000000000..8da5b03c03 --- /dev/null +++ b/libs/detail @@ -0,0 +1 @@ +Subproject commit 8da5b03c03b13cf4dcf2854cf085910545404e8d diff --git a/libs/disjoint_sets b/libs/disjoint_sets new file mode 160000 index 0000000000..35deacf7c8 --- /dev/null +++ b/libs/disjoint_sets @@ -0,0 +1 @@ +Subproject commit 35deacf7c83eee29f8153d59f997604e16fa9048 diff --git a/libs/dynamic_bitset b/libs/dynamic_bitset new file mode 160000 index 0000000000..cc9b262cb9 --- /dev/null +++ b/libs/dynamic_bitset @@ -0,0 +1 @@ +Subproject commit cc9b262cb92f20d4fd5c12507a2742e84a6e8f1b diff --git a/libs/exception b/libs/exception new file mode 160000 index 0000000000..12029f86ba --- /dev/null +++ b/libs/exception @@ -0,0 +1 @@ +Subproject commit 12029f86bac5e1a9c7d5a18503a832e5a17b2167 diff --git a/libs/expected_results.xml b/libs/expected_results.xml new file mode 100644 index 0000000000..f5e1092307 --- /dev/null +++ b/libs/expected_results.xml @@ -0,0 +1,2398 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/libs/filesystem b/libs/filesystem new file mode 160000 index 0000000000..3dc88e3cfd --- /dev/null +++ b/libs/filesystem @@ -0,0 +1 @@ +Subproject commit 3dc88e3cfd8a0aa11e967c0f8e8cd6ed4aa4b153 diff --git a/libs/foreach b/libs/foreach new file mode 160000 index 0000000000..8ebefa801f --- /dev/null +++ b/libs/foreach @@ -0,0 +1 @@ +Subproject commit 8ebefa801f81620c67f4212e4ae65f3e2a413ead diff --git a/libs/format b/libs/format new file mode 160000 index 0000000000..a624f813aa --- /dev/null +++ b/libs/format @@ -0,0 +1 @@ +Subproject commit a624f813aaa9834abed998b7fe821a33162d0ee7 diff --git a/libs/function b/libs/function new file mode 160000 index 0000000000..6147e7ddcc --- /dev/null +++ b/libs/function @@ -0,0 +1 @@ +Subproject commit 6147e7ddcc76164a2295a56c05614800aeed1c49 diff --git a/libs/functional b/libs/functional new file mode 160000 index 0000000000..b21e4a5e6b --- /dev/null +++ b/libs/functional @@ -0,0 +1 @@ +Subproject commit b21e4a5e6badd2798627ab108d76710353a198b1 diff --git a/libs/graph b/libs/graph new file mode 160000 index 0000000000..b2be8e3dfc --- /dev/null +++ b/libs/graph @@ -0,0 +1 @@ +Subproject commit b2be8e3dfcae479b27bb3ca5fd3b2d0f159cd39b diff --git a/libs/graph_parallel b/libs/graph_parallel new file mode 160000 index 0000000000..4f63230169 --- /dev/null +++ b/libs/graph_parallel @@ -0,0 +1 @@ +Subproject commit 4f6323016996e226a2dda755871dcb6246752d50 diff --git a/libs/index.html b/libs/index.html new file mode 100644 index 0000000000..4720ada4f4 --- /dev/null +++ b/libs/index.html @@ -0,0 +1,14 @@ + + + + + +Automatic redirection failed, please go to +libraries.htm. +
+

© Copyright Beman Dawes, 2001

+

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/libs/integer b/libs/integer new file mode 160000 index 0000000000..b162db6b72 --- /dev/null +++ b/libs/integer @@ -0,0 +1 @@ +Subproject commit b162db6b72f3f8c5a95ad00efce682f1ee0bafed diff --git a/libs/io b/libs/io new file mode 160000 index 0000000000..d9ae85cc23 --- /dev/null +++ b/libs/io @@ -0,0 +1 @@ +Subproject commit d9ae85cc234c3fce47f62eb08ae30017d1e704ac diff --git a/libs/iostreams b/libs/iostreams new file mode 160000 index 0000000000..9733948782 --- /dev/null +++ b/libs/iostreams @@ -0,0 +1 @@ +Subproject commit 9733948782be517c4226356e2e3d64eba7d95994 diff --git a/libs/iterator b/libs/iterator new file mode 160000 index 0000000000..ff73538b5b --- /dev/null +++ b/libs/iterator @@ -0,0 +1 @@ +Subproject commit ff73538b5bcc4744eb1291b64c9971363e658c93 diff --git a/libs/lambda b/libs/lambda new file mode 160000 index 0000000000..672c8e10d4 --- /dev/null +++ b/libs/lambda @@ -0,0 +1 @@ +Subproject commit 672c8e10d4cb64bc6eea7ba868157667197bc2b7 diff --git a/libs/libraries.htm b/libs/libraries.htm new file mode 100644 index 0000000000..6bbcb01d76 --- /dev/null +++ b/libs/libraries.htm @@ -0,0 +1,639 @@ + + + + + + + + +Boost Libraries + + + + + + + + + + + + + +
+ boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+ +

Boost Libraries and Documentation

+ +

+

+
Libraries Listed Alphabetically
+
Libraries Listed by Category
+
+
String and text processing
+
Containers
+
Iterators
+
Algorithms
+
Function Objects and higher-order programming
+
Generic Programming
+
Template Metaprogramming
+
Preprocessor Metaprogramming
+
Concurrent Programming +
Math and numerics
+
Correctness and testing
+
Data structures
+
Input/Output
+
Inter-language support
+
Memory
+
Parsing
+
Programming Interfaces
+
Miscellaneous
+
Broken compiler workarounds
+
+
Libraries Retired from Boost
+
+

+ +

See Compiler Status + page to find out what library works with which compiler.
+See Getting Started page to find out +how to download, build, and install the libraries.

+ +

Documentation for some Boost libraries is available in other forms, + including DocBook, XSL Formatting Objects, and Unix man pages. This + documentation is available + on Sourceforge.

+ +
+ +

Libraries Listed Alphabetically

+ +
    +
  • any - Safe, generic container for single + values of different value types, from Kevlin Henney. 
    • +
  • array - STL compliant + container wrapper for arrays of constant size, from + Nicolai Josuttis.
    • +
  • assign - Filling containers + with constant or generated data has never been + easier, from Thorsten Ottosen. +
    • +
  • bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter + Dimov.
    • +
  • call_traits - + Defines types for passing parameters, from John Maddock, + Howard Hinnant, et al.
    • +
  • compatibility - Help for + non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens + Maurer.
    • +
  • compressed_pair + - Empty member optimization, from John Maddock, Howard + Hinnant, et al.
    • +
  • concept check + - Tools for generic programming, from Jeremy Siek.
    • +
  • config - Helps boost + library developers adapt to compiler idiosyncrasies; not + intended for library users.
    • +
  • conversion - Polymorphic and lexical casts, from Dave Abrahams and + Kevlin Henney.
    • +
  • crc - Cyclic Redundancy Code, from Daryle + Walker.
    • +
  • date_time - Date-Time library from Jeff Garland.
    • +
  • dynamic_bitset - A runtime sized version of std::bitset from Jeremy Siek and Chuck Allison.
    • +
  • enable_if - Selective inclusion of function template overloads, from Jaakko Järvi, Jeremiah Willcock, and Andrew Lumsdaine.
    • +
  • filesystem - Portable paths, + iteration over directories, and other useful filesystem operations, from + Beman Dawes.
    • +
  • foreach - BOOST_FOREACH macro for easily + iterating over the elements of a sequence, from Eric Niebler.
    • +
  • format - Type-safe 'printf-like' format + operations, from Samuel Krempp.
    • +
  • function - Function object wrappers + for deferred calls or callbacks, from Doug Gregor.
    • +
  • functional - Enhanced + function object adaptors, from Mark Rodgers.
    • +
  • functional/hash - + A TR1 hash function object that can be extended to hash user defined + types, from Daniel James.
    • +
  • graph - + Generic graph components and algorithms, from Jeremy Siek + and a University of Notre Dame team.
    • +
  • integer - Headers to ease + dealing with integral types.
    • +
  • interval - Extends the + usual arithmetic functions to mathematical intervals, from Guillaume + Melquiond, Herv´ Brönnimann and Sylvain Pion.
    • +
  • in_place_factory, typed_in_place_factory- Generic in-place construction of contained objects with a variadic argument-list, from Fernando Cacciola.
    • +
  • io state savers - Save I/O state to + prevent jumbled data, from Daryle Walker.
    • +
  • iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.
    • +
  • iterators - Iterator + construction framework, adaptors, concepts, and more, from Dave + Abrahams, Jeremy Siek, and Thomas Witt.
    • +
  • lambda - Define small unnamed + function objects at the actual call site, and more, from Jaakko Järvi and + Gary Powell.
    • +
  • math - Several contributions in the + domain of mathematics, from various authors.
    • +
  • math/common_factor - Greatest + common divisor and least common multiple, from Daryle Walker.
    • +
  • math/octonion - + Octonions, from Hubert Holin.
    • +
  • math/quaternion - + Quaternions, from Hubert Holin.
    • +
  • math/special_functions - + Mathematical special functions such as atanh, sinc, and sinhc, + from Hubert Holin.
    • +
  • minmax - standard library + extensions for simultaneous min/max and min/max element computations, + from Hervé Brönnimann.
    • +
  • mpl - Template metaprogramming + framework of compile-time algorithms, sequences and metafunction classes, + from Aleksey Gurtovoy.
    • +
  • multi_array - Multidimensional + containers and adaptors for arrays of contiguous data, from Ron Garcia.
    • +
  • multi_index - Containers with + multiple STL-compatible access interfaces, from Joaquín M López + Muñoz.
    • +
  • numeric/conversion - Optimized Policy-based Numeric Conversions, + from Fernando Cacciola.
    • +
  • operators - Templates + ease arithmetic classes and iterators, from Dave Abrahams + and Jeremy Siek.
    • +
  • optional - Discriminated-union + wrapper for optional values, from Fernando Cacciola.
    • + +
  • parameter - + Write functions that accept arguments by name, by David Abrahams + and Daniel Wallin.
    • + +
  • pointer container + - Containers for storing heap-allocated polymorphic objects to ease + OO-programming, from Thorsten Ottosen.
    • +
  • pool - Memory pool management, from + Steve Cleary.
    • +
  • preprocessor - Preprocessor + metaprogramming tools including repetition and recursion, from Vesa Karvonen + and Paul Mensonides.
    • +
  • program_options - Access to configuration + data given on command line, in config files and other sources, from Vladimir Prus.
    • +
  • property map + - Concepts defining interfaces which map key objects to + value objects, from Jeremy Siek.
    • +
  • python - Reflects C++ + classes and functions into Python, from Dave + Abrahams.
    • +
  • random - A complete + system for random number generation, from Jens Maurer.
    • +
  • range - A new infrastructure + for generic algorithms that builds on top + of the new iterator concepts, from Thorsten Ottosen.
    • +
  • rational - A rational + number class, from Paul Moore.
    • + +
  • ref - A utility library for + passing references to generic functions, from Jaako Järvi, + Peter Dimov, Doug Gregor, and Dave Abrahams.
    • + +
  • regex - Regular expression + library, from John Maddock.
    • +
  • serialization + - Serialization for persistence and marshalling, from Robert Ramey
    • +
  • signals - managed signals & + slots callback implementation, from Doug Gregor.
    • +
  • smart_ptr - Five smart + pointer class templates, from Greg Colvin, Beman Dawes, + Peter Dimov, and Darin Adler.
    • +
  • statechart - Arbitrarily + complex finite state machines can be implemented in easily readable and + maintainable C++ code, from Andreas Huber.
    • +
  • static_assert + - Static assertions (compile time assertions), from John + Maddock.
    • +
  • spirit - LL parser framework  + represents parsers directly as EBNF grammars in inlined C++, from Joel de + Guzman and team.
    • +
  • string_algo - + String algorithms library, from Pavol Droba
    • +
  • test - Support for simple program testing, + full unit testing, and for program + execution monitoring, from Gennadiy Rozental.
    • +
  • thread - Portable C++ + multi-threading, from William Kempf.
    • +
  • timer - Event timer, + progress timer, and progress display classes, from Beman + Dawes.
    • +
  • tokenizer - Break of a string or other + character sequence into a series of tokens, from John Bandela.
    • +
  • TR1 - An implementation of the Technical + Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.
    • +
  • tribool - 3-state boolean type library, from Doug Gregor.
    • +
  • tuple - Ease definition of functions returning multiple values, and more, + from Jaakko Järvi.
    • +
  • type_traits - + Templates for fundamental properties of types, from John + Maddock, Steve Cleary, et al.
    • +
  • typeof - + Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.
    • +
  • uBLAS - Basic linear algebra + for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.
    • +
  • utility - Class noncopyable + plus checked_delete(), checked_array_delete(), next(),  + prior() + function templates, plus base-from-member idiom, from Dave Abrahams and others.
    • +
  • value_initialized - Wrapper for uniform-syntax value initialization, + from Fernando Cacciola, based on the original idea of David Abrahams.
    • +
  • variant - Safe, generic, stack-based discriminated union + container, from Eric Friedman and Itay Maman.
    • +
  • wave - Standards conformant + implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut Kaiser
    • +
  • xpressive - Regular expressions that can be written as strings or as expression templates, + and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.
    • +
+ +
+ +

Libraries Listed by Category

+ +

String and text processing

+ +
    +
  • conversion/lexical_cast - lexical_cast + class template, from Kevlin Henney.
    • +
  • format - Type-safe 'printf-like' format + operations, from Samuel Krempp.
    • +
  • iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.
    • +
  • regex - Regular expression + library, from John Maddock
    • +
  • spirit - LL parser framework  + represents parsers directly as EBNF grammars in inlined C++, from Joel de + Guzman and team.
    • +
  • string_algo - + String algorithms library, from Pavol Droba
    • +
  • tokenizer - Break of a string or other + character sequence into a series of tokens, from John Bandela
    • +
  • wave - Standards conformant implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface, from Hartmut Kaiser.
    • +
  • xpressive - Regular expressions that can be written as strings or as expression templates, + and that can refer to each other and themselves recursively with the power of context-free grammars, from Eric Niebler.
    • +
+ +

Containers

+ +
    +
  • array - STL compliant + container wrapper for arrays of constant size, from + Nicolai Josuttis.
    • +
  • dynamic_bitset - A runtime sized version of std::bitset from Jeremy Siek and Chuck Allison.
    • +
  • graph - + Generic graph components and algorithms, from Jeremy Siek + and a University of Notre Dame team.
    • +
  • multi_array - Multidimensional + containers and adaptors for arrays of contiguous data, from Ron Garcia.
    • +
  • multi_index - Containers with + multiple STL-compatible access interfaces, from Joaquín M López + Muñoz.
    • +
  • pointer container + - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen.
    • +
  • property map + - Concepts defining interfaces which map key objects to + value objects, from Jeremy Siek.
    • +
  • variant - Safe, generic, stack-based + discriminated union container, from Eric Friedman and Itay Maman.
    • +
+ +

Iterators

+ +
    +
  • graph - + Generic graph components and algorithms, from Jeremy Siek + and a University of Notre Dame team.
    • +
  • iterators - Iterator + construction framework, adaptors, concepts, and more, from Dave + Abrahams, Jeremy Siek, and Thomas Witt.
    • +
  • operators - Templates + ease arithmetic classes and iterators, from Dave Abrahams + and Jeremy Siek.
    • +
  • tokenizer - Break of a string or other + character sequence into a series of tokens, from John Bandela.
    • +
+ +

Algorithms

+ +
    +
  • foreach - BOOST_FOREACH macro for easily + iterating over the elements of a sequence, from Eric Niebler.
    • +
  • graph - + Generic graph components and algorithms, from Jeremy Siek + and a University of Notre Dame team.
    • +
  • minmax - standard library + extensions for simultaneous min/max and min/max element computations, + from Hervé Brönnimann.
    • +
  • string_algo - + String algorithms library, from Pavol Droba
    • +
  • utility - Class next(),  prior() + function templates, from Dave Abrahams and others.
    • +
  • range - A new infrastructure + for generic algorithms that builds on top + of the new iterator concepts, from Thorsten Ottosen.
    • +
+ +

Function objects and higher-order programming

+ +
    +
  • bind and mem_fn - Generalized binders for function/object/pointers and member functions, from Peter Dimov.
    • + +
  • function - Function object wrappers + for deferred calls or callbacks, from Doug Gregor.
    • +
  • functional - Enhanced + function object adaptors, from Mark Rodgers.
    • +
  • functional/hash - + A TR1 hash function object that can be extended to hash user defined + types, from Daniel James.
    • +
  • lambda - Define small unnamed + function objects at the actual call site, and more, from Jaakko Järvi and + Gary Powell.
    • + +
  • ref - A utility library for + passing references to generic functions, from Jaako Järvi, + Peter Dimov, Doug Gregor, and Dave Abrahams.
    • + +
  • signals - managed signals & + slots callback implementation, from Doug Gregor.
    • + +
  • result_of - determines the type of a function call expression.
    • +
+ +

Generic Programming

+ +
    +
  • call_traits - + Defines types for passing parameters, from John Maddock, + Howard Hinnant, et al.
    • +
  • concept check + - Tools for generic programming, from Jeremy Siek.
    • +
  • enable_if - + Selective inclusion of function template overloads, from Jaakko + Järvi, Jeremiah Willcock, and Andrew Lumsdaine.
    • +
  • in_place_factory, typed_in_place_factory- Generic in-place construction + of contained objects with a variadic argument-list, from Fernando Cacciola.
    • +
  • operators - Templates + ease arithmetic classes and iterators, from Dave Abrahams + and Jeremy Siek.
    • + +
  • property map + - Concepts defining interfaces which map key objects to + value objects, from Jeremy Siek.
    • +
  • static_assert + - Static assertions (compile time assertions), from John + Maddock.
    • +
  • type_traits - + Templates for fundamental properties of types, from John + Maddock, Steve Cleary, et al.
    • +
+ +

Template Metaprogramming

+ +
    +
  • mpl - Template metaprogramming + framework of compile-time algorithms, sequences and metafunction classes, + from Aleksey Gurtovoy.
    • +
  • static_assert + - Static assertions (compile time assertions), from John + Maddock.
    • +
  • type_traits - + Templates for fundamental properties of types, from John + Maddock, Steve Cleary, et al.
    • +
+ +

Preprocessor Metaprogramming

+ +
    +
  • preprocessor - Preprocessor + metaprogramming tools including repetition and recursion, from Vesa Karvonen + and Paul Mensonides.
    • +
+ +

Concurrent Programming

+ +
    +
  • thread - Portable C++ + multi-threading, from William Kempf.
    • +
+ +

Math and numerics

+ +
    +
  • math - Several contributions in the + domain of mathematics, from various authors.
    • +
  • numeric/conversion - Optimized Policy-based Numeric Conversions, + from Fernando Cacciola.
    • +
  • integer - Headers to ease + dealing with integral types.
    • +
  • interval - Extends the + usual arithmetic functions to mathematical intervals, from Guillaume + Melquiond, Hervé Brönnimann and Sylvain Pion.
    • +
  • math/common_factor - Greatest + common divisor and least common multiple, from Daryle Walker.
    • +
  • math/octonion - + Octonions, from Hubert Holin.
    • +
  • math/quaternion - + Quaternions, from Hubert Holin.
    • +
  • math/special_functions - + Mathematical special functions such as atanh, sinc, and sinhc, + from Hubert Holin.
    • +
  • multi_array - Multidimensional + containers and adaptors for arrays of contiguous data, from Ron Garcia.
    • +
  • operators - Templates + ease arithmetic classes and iterators, from Dave Abrahams + and Jeremy Siek.
    • +
  • random - A complete + system for random number generation, from Jens Maurer.
    • +
  • rational - A rational + number class, from Paul Moore.
    • +
  • uBLAS - Basic linear algebra + for dense, packed and sparse matrices, from Joerg Walter and Mathias Koch.
    • +
+ +

Correctness and testing

+ +
    +
  • concept check + - Tools for generic programming, from Jeremy Siek.
    • +
  • static_assert + - Static assertions (compile time assertions), from John + Maddock.
    • +
  • test - Support for simple program testing, + full unit testing, and for program + execution monitoring, from Gennadiy Rozental.
    • +
+ +

Data structures

+ +
    +
  • any - Safe, generic container for single + values of different value types, from Kevlin Henney.
    • +
  • compressed_pair + - Empty member optimization, from John Maddock, Howard + Hinnant, et al.
    • +
  • multi_index - Containers with + multiple STL-compatible access interfaces, from Joaquín M López + Muñoz.
    • +
  • pointer container + - Containers for storing heap-allocated polymorphic objects to ease OO-programming, from Thorsten Ottosen.
    • +
  • tuple - Ease definition of functions returning multiple values, and more, + from Jaakko Järvi.
    • +
  • variant - Safe, generic, stack-based + discriminated union container, from Eric Friedman and Itay Maman.
    • +
+ +

Input/Output

+
    +
  • format - Type-safe 'printf-like' format + operations, from Samuel Krempp.
    • +
  • io state savers - Save I/O state to + prevent jumbled data, from Daryle Walker.
    • +
  • iostreams - Framework for defining streams, stream buffers and i/o filters, from Jonathan Turkanis.
    • +
  • program_options - Access to configuration + data given on command line, in config files and other sources, from Vladimir Prus.
    • +
  • serialization - Serialization +of arbitrary data for persistence and marshalling, from Robert Ramey
    • +
  • assign - Filling containers + with constant or generated data has never been + easier, from Thorsten Ottosen. +
    • + +
+ +

Inter-language support

+ +
    +
  • python - Reflects C++ + classes and functions into Python, from Dave + Abrahams.
    • +
+ +

Memory

+ +
    +
  • pool - Memory pool management, from + Steve Cleary.
    • +
  • smart_ptr - Five smart + pointer class templates, from Greg Colvin, Beman Dawes, + Peter Dimov, and Darin Adler.
    • +
  • utility - Class noncopyable + plus checked_delete(), checked_array_delete(), next(),  + prior() + function templates, plus base-from-member idiom, from Dave Abrahams and others.
    • +
+ +

Parsing

+ +
    +
  • spirit - LL parser framework  + represents parsers directly as EBNF grammars in inlined C++, from Joel de + Guzman and team.
    • +
+ +

Programming Interfaces

+ +
    +
  • function - Function object wrappers + for deferred calls or callbacks, from Doug Gregor.
    • + +
  • parameter - + Write functions that accept arguments by name, by David Abrahams + and Daniel Wallin.
    • +
+ +

Miscellaneous

+ +
    +
  • base-from-member - Idiom to + initialize a base class with a member, from Daryle Walker.
    • +
  • compressed_pair + - Empty member optimization, from John Maddock, Howard + Hinnant, et al.
    • +
  • conversion - Polymorphic and lexical casts, from Dave Abrahams and + Kevlin Henney.
    • +
  • numeric/conversion - Optimized Policy-based Numeric Conversions, + from Fernando Cacciola.
    • +
  • crc - Cyclic Redundancy Code, from Daryle + Walker.
    • +
  • date_time - Date-Time library from Jeff Garland.
    • +
  • filesystem - Portable paths, + iteration over directories, and other useful filesystem operations, from + Beman Dawes.
    • +
  • optional - Discriminated-union + wrapper for optional values, from Fernando Cacciola.
    • +
  • program_options - Access to configuration + data given on command line, in config files and other sources, from Vladimir Prus.
    • +
  • statechart - Arbitrarily + complex finite state machines can be implemented in easily readable and + maintainable C++ code, from Andreas Huber.
    • +
  • timer - Event timer, + progress timer, and progress display classes, from Beman + Dawes.
    • +
  • TR1 - An implementation of the Technical + Report on C++ Library Extensions, using other Boost libraries as a basis, from John Maddock.
    • +
  • tribool - 3-state boolean type library, from Doug Gregor.
    • +
  • typeof - + Typeof operator emulation, from Arkadiy Vertleyb and Peder Holt.
    • +
  • utility - Class noncopyable + plus checked_delete(), checked_array_delete(), next(),  + prior() + function templates, plus base-from-member idiom, from Dave Abrahams and others.
    • +
  • value_initialized - Wrapper for uniform-syntax value initialization, + from Fernando Cacciola, based on the original idea of David Abrahams.
    • +
+ +

Broken compiler workarounds

+ +
    +
  • compatibility - Help for + non-conforming standard libraries, from Ralf Grosse-Kunstleve and Jens + Maurer.
    • +
  • config - Helps boost + library developers adapt to compiler idiosyncrasies; not + intended for library users.
    • +
+ +

[Category suggestions from Aleksey Gurtovoy and Beman Dawes]

+ +
+ +

Libraries Retired from Boost

+ +
    +
  • compose - Functional composition adapters for the STL, + from Nicolai Josuttis. Removed in Boost version 1.32. + Please use Bind or Lambda instead.
    • +
+ +
+ +

Revised +12 Mar 2006

+ +

© Copyright Beman Dawes 2000-2004

+

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/libs/logic b/libs/logic new file mode 160000 index 0000000000..5749fb9ef1 --- /dev/null +++ b/libs/logic @@ -0,0 +1 @@ +Subproject commit 5749fb9ef1e4b24079e8709d02159c6897d35ffe diff --git a/libs/maintainers.txt b/libs/maintainers.txt new file mode 100644 index 0000000000..26709884a1 --- /dev/null +++ b/libs/maintainers.txt @@ -0,0 +1,65 @@ +algorithm/minmax Herve Bronnimann +algorithm/string Pavol Droba +any Alexander Nasonov +array +assign Thorsten Ottosen +bind Peter Dimov +concept_check Jeremy Siek +config John Maddock +conversion Alexander Nasonov +crc Daryle Walker +date_time Jeff Garland +disjoint_sets Jeremy Siek +dynamic_bitset Jeremy Siek +filesystem Beman Dawes +foreach Eric Niebler +format Samuel Krempp +function Douglas Gregor +functional +functional/hash Daniel James +graph Douglas Gregor +integer Daryle Walker +io Daryle Walker +iostreams Jonathan Turkanis +iterator David Abrahams , Thomas Witt +lambda Jaakko Jarvi +logic Douglas Gregor +math Hubert Holin , John Maddock +mpl Aleksey Gurtovoy +multi_array Ronald Garcia +multi_index Joaquin M Lopez Munoz +numeric/conversion Fernando Cacciola +numeric/interval Sylvain Pion , Herve Bronnimann , Guillaume Melquiond +numeric/ublas Michael Stevens +optional Fernando Cacciola +parameter David Abrahams , Daniel Wallin +pool Stephen Cleary +preprocessor Paul Mensonides +program_options Vladimir Prus +property_map Douglas Gregor +ptr_container Thorsten Ottosen +python David Abrahams +random Jens Maurer +range Thorsten Ottosen +rational Jonathan Turkanis +regex John Maddock +serialization Robert Ramey +signals Douglas Gregor +smart_ptr Beman Dawes , Peter Dimov +spirit Joel de Guzman +statechart Andreas Huber +static_assert John Maddock +test Gennadiy Rozental +thread Anthony Williams , Roland Schwarz +timer Beman Dawes +tokenizer John R. Bandela +tr1 John Maddock +tuple Jaakko Jarvi +type_traits John Maddock +typeof Arkadiy Vertleyb , Peder Holt +utility +utility/enable_if Jaakko Jarvi , Jeremiah Willcock +variant Eric Friedman +wave Hartmut Kaiser +xpressive Eric Niebler + diff --git a/libs/math b/libs/math new file mode 160000 index 0000000000..141dc671b6 --- /dev/null +++ b/libs/math @@ -0,0 +1 @@ +Subproject commit 141dc671b6af12b92d85522c485a3c2e93936902 diff --git a/libs/mpl b/libs/mpl new file mode 160000 index 0000000000..d71c289879 --- /dev/null +++ b/libs/mpl @@ -0,0 +1 @@ +Subproject commit d71c2898795e12ec7cdcfdccd4a25664611f7da6 diff --git a/libs/multi_array b/libs/multi_array new file mode 160000 index 0000000000..d8bf15754e --- /dev/null +++ b/libs/multi_array @@ -0,0 +1 @@ +Subproject commit d8bf15754e0fc3cbe913f370d6214615297ea561 diff --git a/libs/multi_index b/libs/multi_index new file mode 160000 index 0000000000..1434c7d727 --- /dev/null +++ b/libs/multi_index @@ -0,0 +1 @@ +Subproject commit 1434c7d7271b76c644b938aa4f3743017b0b72bf diff --git a/libs/numeric/conversion b/libs/numeric/conversion new file mode 160000 index 0000000000..5fb09c0c83 --- /dev/null +++ b/libs/numeric/conversion @@ -0,0 +1 @@ +Subproject commit 5fb09c0c83c6312cc3ed3b3ac766557fb0e1ac91 diff --git a/libs/numeric/index.html b/libs/numeric/index.html new file mode 100644 index 0000000000..6c74e6c741 --- /dev/null +++ b/libs/numeric/index.html @@ -0,0 +1,14 @@ + + + + + +Automatic redirection failed, please go to +ublas/doc/index.htm. 
+

© Copyright Beman Dawes, 2001

+

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/libs/numeric/interval b/libs/numeric/interval new file mode 160000 index 0000000000..9951d9a5f2 --- /dev/null +++ b/libs/numeric/interval @@ -0,0 +1 @@ +Subproject commit 9951d9a5f26aac7eb8bb62bd64248c7f34684cca diff --git a/libs/numeric/sublibs b/libs/numeric/sublibs new file mode 100644 index 0000000000..721d7c4a92 --- /dev/null +++ b/libs/numeric/sublibs @@ -0,0 +1 @@ +The existance of this file tells the regression reporting programs that the directory contains sub-directories which are libraries. \ No newline at end of file diff --git a/libs/numeric/ublas b/libs/numeric/ublas new file mode 160000 index 0000000000..124a75fbfb --- /dev/null +++ b/libs/numeric/ublas @@ -0,0 +1 @@ +Subproject commit 124a75fbfbef452048cab37a2b67e437190cf9c7 diff --git a/libs/optional b/libs/optional new file mode 160000 index 0000000000..4ba562871e --- /dev/null +++ b/libs/optional @@ -0,0 +1 @@ +Subproject commit 4ba562871e01d654d1d2ddee91a70b959ecfe239 diff --git a/libs/parameter b/libs/parameter new file mode 160000 index 0000000000..56ddeddfaf --- /dev/null +++ b/libs/parameter @@ -0,0 +1 @@ +Subproject commit 56ddeddfaf8418fe63dd1eb400ed428738be43bc diff --git a/libs/platform_maintainers.txt b/libs/platform_maintainers.txt new file mode 100644 index 0000000000..d30340ba2d --- /dev/null +++ b/libs/platform_maintainers.txt @@ -0,0 +1,2 @@ +gcc-3_3-darwin Noel Belcourt +cw-9_5-darwin Noel Belcourt diff --git a/libs/pool b/libs/pool new file mode 160000 index 0000000000..db37ad756d --- /dev/null +++ b/libs/pool @@ -0,0 +1 @@ +Subproject commit db37ad756dc30936ff98d07aba9c0cf1491ba4b1 diff --git a/libs/preprocessor b/libs/preprocessor new file mode 160000 index 0000000000..6a5b3283fc --- /dev/null +++ b/libs/preprocessor @@ -0,0 +1 @@ +Subproject commit 6a5b3283fc49b35aa63cdeceee7ab21119cf3911 diff --git a/libs/program_options b/libs/program_options new file mode 160000 index 0000000000..2cc29f6dfa --- /dev/null +++ b/libs/program_options @@ -0,0 +1 @@ +Subproject commit 2cc29f6dfa914d000b4193b0a0dfec206e4a95b4 diff --git a/libs/property_map b/libs/property_map new file mode 160000 index 0000000000..b485d6c83d --- /dev/null +++ b/libs/property_map @@ -0,0 +1 @@ +Subproject commit b485d6c83dca29828f685e6dcc6fb623a2498dcd diff --git a/libs/ptr_container b/libs/ptr_container new file mode 160000 index 0000000000..9ab52925ea --- /dev/null +++ b/libs/ptr_container @@ -0,0 +1 @@ +Subproject commit 9ab52925ea6acf5bce68959892d049517b33c59a diff --git a/libs/python b/libs/python new file mode 160000 index 0000000000..2392a6a3e2 --- /dev/null +++ b/libs/python @@ -0,0 +1 @@ +Subproject commit 2392a6a3e24b04b7213a1414304d9202b801c394 diff --git a/libs/random b/libs/random new file mode 160000 index 0000000000..63e54d3d79 --- /dev/null +++ b/libs/random @@ -0,0 +1 @@ +Subproject commit 63e54d3d7936ae2a22b32c5fac904ff8d8ec3d82 diff --git a/libs/range b/libs/range new file mode 160000 index 0000000000..25e932149c --- /dev/null +++ b/libs/range @@ -0,0 +1 @@ +Subproject commit 25e932149c792b3a95991f7b8f442108c8d162b8 diff --git a/libs/rational b/libs/rational new file mode 160000 index 0000000000..a004190637 --- /dev/null +++ b/libs/rational @@ -0,0 +1 @@ +Subproject commit a0041906374b1b45c3e3dd7565163b9612fe8f9c diff --git a/libs/regex b/libs/regex new file mode 160000 index 0000000000..f5af9ba18d --- /dev/null +++ b/libs/regex @@ -0,0 +1 @@ +Subproject commit f5af9ba18d64195cbef8d561f921bec78e8a870b diff --git a/libs/serialization b/libs/serialization new file mode 160000 index 0000000000..ce1c36ea98 --- /dev/null +++ b/libs/serialization @@ -0,0 +1 @@ +Subproject commit ce1c36ea98c3ae7234813e1031c9543433fac6d7 diff --git a/libs/signals b/libs/signals new file mode 160000 index 0000000000..16663e99e1 --- /dev/null +++ b/libs/signals @@ -0,0 +1 @@ +Subproject commit 16663e99e1cb4b083d27be05e726010c67a816bf diff --git a/libs/smart_ptr b/libs/smart_ptr index c47f309991..87c6b6b403 160000 --- a/libs/smart_ptr +++ b/libs/smart_ptr @@ -1 +1 @@ -Subproject commit c47f309991b83794f0f037a320dc223939d65b07 +Subproject commit 87c6b6b403c08a2d071c65a694b5533dedf0b232 diff --git a/libs/spirit b/libs/spirit new file mode 160000 index 0000000000..555b348d5a --- /dev/null +++ b/libs/spirit @@ -0,0 +1 @@ +Subproject commit 555b348d5ad3b0f1736b1ba6a7603cfb6f3e5c88 diff --git a/libs/statechart b/libs/statechart new file mode 160000 index 0000000000..8915ba42f5 --- /dev/null +++ b/libs/statechart @@ -0,0 +1 @@ +Subproject commit 8915ba42f5fcac51900237082097248cbb33b7e4 diff --git a/libs/static_assert b/libs/static_assert new file mode 160000 index 0000000000..851fd2622e --- /dev/null +++ b/libs/static_assert @@ -0,0 +1 @@ +Subproject commit 851fd2622e4c885946fd83ce4d3250972be0018a diff --git a/libs/test b/libs/test new file mode 160000 index 0000000000..6d1e9c19d9 --- /dev/null +++ b/libs/test @@ -0,0 +1 @@ +Subproject commit 6d1e9c19d9e9b5d9ceb994aa868f3df3eb2fac03 diff --git a/libs/thread b/libs/thread new file mode 160000 index 0000000000..1c0f470032 --- /dev/null +++ b/libs/thread @@ -0,0 +1 @@ +Subproject commit 1c0f47003239db48c8b13a1b3a26532ffe6bf6d9 diff --git a/libs/timer b/libs/timer new file mode 160000 index 0000000000..bd22233012 --- /dev/null +++ b/libs/timer @@ -0,0 +1 @@ +Subproject commit bd22233012b722f4d3d70f6e5363559cc7984d55 diff --git a/libs/tokenizer b/libs/tokenizer new file mode 160000 index 0000000000..e223113f8b --- /dev/null +++ b/libs/tokenizer @@ -0,0 +1 @@ +Subproject commit e223113f8ba344c511d66160ae4d8e24cc62bcce diff --git a/libs/tr1 b/libs/tr1 new file mode 160000 index 0000000000..8c5552376c --- /dev/null +++ b/libs/tr1 @@ -0,0 +1 @@ +Subproject commit 8c5552376c9add6675769da414a052d076615688 diff --git a/libs/tuple b/libs/tuple new file mode 160000 index 0000000000..310c0cda3f --- /dev/null +++ b/libs/tuple @@ -0,0 +1 @@ +Subproject commit 310c0cda3fe3853e1944f71978329ccc0a5197c2 diff --git a/libs/type_traits b/libs/type_traits new file mode 160000 index 0000000000..ed23fafc80 --- /dev/null +++ b/libs/type_traits @@ -0,0 +1 @@ +Subproject commit ed23fafc80de35522e675b5ad67477820caa9648 diff --git a/libs/typeof b/libs/typeof new file mode 160000 index 0000000000..8d8d35c1ae --- /dev/null +++ b/libs/typeof @@ -0,0 +1 @@ +Subproject commit 8d8d35c1ae55e98e7f90955c5850fac1919ef8a4 diff --git a/libs/utility b/libs/utility new file mode 160000 index 0000000000..6aa648d315 --- /dev/null +++ b/libs/utility @@ -0,0 +1 @@ +Subproject commit 6aa648d3157c6d274509ea90a4562d72fa4e81e8 diff --git a/libs/variant b/libs/variant new file mode 160000 index 0000000000..d465155ccc --- /dev/null +++ b/libs/variant @@ -0,0 +1 @@ +Subproject commit d465155ccc05bfb6a28711bf71497e28ffb3d77a diff --git a/libs/wave b/libs/wave new file mode 160000 index 0000000000..733cd588bf --- /dev/null +++ b/libs/wave @@ -0,0 +1 @@ +Subproject commit 733cd588bffb0b5f360ef7d4f643632db03de114 diff --git a/libs/xpressive b/libs/xpressive new file mode 160000 index 0000000000..ebf90dba26 --- /dev/null +++ b/libs/xpressive @@ -0,0 +1 @@ +Subproject commit ebf90dba264f87bee85fdf3387242d269a2a8cff diff --git a/more/Jamfile.v2 b/more/Jamfile.v2 new file mode 100644 index 0000000000..634be5d21c --- /dev/null +++ b/more/Jamfile.v2 @@ -0,0 +1,25 @@ +# Copyright David Abrahams 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) +import docutils ; + +import path ; +sources = getting_started.rst ; +bases = $(sources:S=) ; + +# This is a path relative to the html/ subdirectory where the +# generated output will eventually be moved. +stylesheet = "--stylesheet=../rst.css" ; + +for local b in $(bases) +{ + html $(b) : $(b).rst : + + # "PYTHONPATH=~/src/boost/tools && python ~/src/boost/tools/litre/active-rst.py" + # "-gdt --writer=html --source-url="./$(b).rst" --link-stylesheet --traceback --trim-footnote-reference-space --footnote-references=superscript "$(stylesheet) + "-gdt --source-url="./$(b).rst" --link-stylesheet --traceback --trim-footnote-reference-space --footnote-references=superscript "$(stylesheet) + ; +} + +alias htmls : $(bases) ; +stage . : $(bases) ; diff --git a/more/background.html b/more/background.html new file mode 100644 index 0000000000..37f890db38 --- /dev/null +++ b/more/background.html @@ -0,0 +1,221 @@ + + + + + + + + + Boost Background Information + + + + + + + + + + + + + + +
+ boost.png (6897 bytes) + + Home + + + Libraries + + People + + + FAQ + + More +
+

+ + Boost Background Information +

+

+ Why should an organization use Boost? +

+

+ 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. +

+

+ Who else is using Boost? +

+ +

+ 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. +

+

+ What do others say about Boost? +

+

+ "...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++ + +

+
+

+ How do users get support? +

+

+ 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. +

+

+ What about license issues? +

+

+ 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. +

+ +

+ What about other intellectual property issues? +

+

+ 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. +

+

+ Why would anyone give away valuable software for free? +

+

+ + 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. +

+

+ Who pays Boost's expenses? +

+

+ 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/more/bibliography.html b/more/bibliography.html new file mode 100644 index 0000000000..3c5480408a --- /dev/null +++ b/more/bibliography.html @@ -0,0 +1,538 @@ + + + + Boost Bibliography + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+

Boost Bibliography

+

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

+

Print publications about Boost or Boost + Libraries

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
[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 +
+

Online publications about Boost or Boost + Libraries

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
[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
+

Print mentions of Boost or Boost Libraries

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
[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 +
+

Online mentions of Boost or Boost Libraries

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
[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.
+

How to update this page

+

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.

+
    +
  • + If a publication is available both in print and online, cite it in the + appropriate print + section, with a hyperlink to the online version. +
  • + Bookmark the contents of [...] in the first column to make it easy to link to + the entry. +
  • + Identify the first entry an author has in a given year with just the two-digit + year. Subsequent entries for the same author and year should have a-z + appended. +
  • + Inside each section, entries are grouped by year and, within a year, alphabetically + sorted by author name. +
  • + In the text, spell out absolute URL's so that printed versions of this page + include the full URL. +
    • +
+

Acknowledgements

+

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/more/blanket-permission.txt b/more/blanket-permission.txt new file mode 100644 index 0000000000..018d5eaea8 --- /dev/null +++ b/more/blanket-permission.txt @@ -0,0 +1,101 @@ +The following people hereby grant permission to replace all existing +licenses on their contributions to Boost with the Boost Software +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( +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) +Bruce Barr (schmoost -at- yahoo.com) (See Boost list of Mon, 16 Aug 2004 15:06:43 -0500) +Bruno da Silva de Oliveira (bruno - at - esss.com.br) +Christain Engstrom (christian.engstrom -at- glindra.org) (See Boost list message of Mon, 30 Aug 2004 14:31:49 +0200) +Cromwell D Enage (sponage -at- yahoo.com) (See Boost list message of August 12, 2004 11:49:13 AM EST) +Dan Gohman (djg -at- cray.com) (See Boost list messsage of Sat, 21 Aug 2004 10:54:59 +0100) +Dan Nuffer (dan -at- nuffer.name) +Daniel Frey (d.frey -at- gmx.de, daniel.frey -at- aixigo.de) +Daniel Nuffer (dan -at- nuffer.name) +Darin Adler (darin -at- bentspoon.com) (Email to Andreas Huber, see change log) +Daryle Walker (darylew - at - hotmail.com) +Dave Abrahams (dave@boost-consulting.com) +Dave Moore (dmoore -at- viefinancial.com) (See Boost list message of 18 Dec 2003 15:35:50 -0500) +David Abrahams (dave@boost-consulting.com) +Dietmar Kuehl (dietmar_kuehl -at- yahoo.com) (Email to Andreas Huber, see change log) +Douglas Gregor (gregod -at- cs.rpi.edu, dgregor -at- cs.indiana.edu, doug.gregor -at- gmail.com) +Dr John Maddock (john - at - johnmaddock.co.uk) +Edward D. Brey (brey -at- ductape.net) (Email to Andreas Huber, see change log) +Eric Ford (un5o6n902 -at- sneakemail.com) (See Boost list message of Sun, 15 Aug 2004 10:29:13 +0100) +Eric Friedman (ebf@users.sourceforge.net) +Eric Niebler (eric@boost-consulting.com) +Fernando Cacciola (fernando_cacciola@ciudad.com.ar) +Fernando Luis Cacciola Carballal (fernando_cacciola@ciudad.com.ar) +Francois Faure (Francois.Faure -at- imag.fr) (See CVS log) +Gary Powell (powellg - at - amazon.com) (See Boost list message of 10 Feb 2004 14:22:46 -0800) +Gennadiy Rozental (rogeeff -at- mail.com) (Email to Andreas Huber, see change log) +Gottfried Ganssauge (Gottfried.Ganssauge -at- HAUFE.DE) (See Boost List message of Mon, 16 Aug 2004 10:09:19 +0200) +Gottfried Ganßauge (Gottfried.Ganssauge -at- HAUFE.DE) (Alternative spelling of Gottfried Ganssauge) +Greg Colvin (gregory.colvin -at- oracle.com) (See Boost list message of Sat, 14 Aug 2004 10:57:00 +0100) +Gregory Colvin (gregory.colvin -at- oracle.com) (See Boost list message of Sat, 14 Aug 2004 10:57:00 +0100) +Gunter Winkler (gunter.winkler -at- unibw-muenchen.de) (See Boost List message of Mon, 16 Aug 2004 10:24:17 +0200) +Hartmut Kaiser (hartmut.kaiser -at- gmail.com) +Herve Bronnimann (hbr -at- poly.edu) +Hervé Brönnimann (hbr -at- poly.edu) +Housemarque Oy (Ilari Kuittinen ilari.kuittinen -at- housemarque.fi) +Howard Hinnant (hinnant -at- twcny.rr.com) (See Boost list message of July 25, 2004 3:44:49 PM EST) +Hubert Holin (hubert_holin -at- users.sourceforge.net) +Indiana University () +Itay Maman (imaman -at- users.sourceforge.net) +Jaakko Järvi (jajarvi -at- osl.iu.edu) +Jaap Suter (j.suter -at- student.utwente.nl) (See Boost list message of Thu, 16 Sep 2004 09:32:43 -0700) +Jeff Garland (jeff - at - crystalclearsoftware.com) (see Boost list post of July 25, 2004 19:31:09 -0700) +Jens Maurer (Jens.Maurer@gmx.net) +Jeremy G Siek (jsiek@osl.iu.edu) +Jeremy Siek (jsiek@osl.iu.edu) +Joel de Guzman (joel -at- boost-consulting.com) (See Boost list message of July 25, 2004 8:32:00 PM EST) +John Bandela (jbandela-at-ufl.edu) +John Maddock (john - at - johnmaddock.co.uk) +John R Bandela (jbandela-at-ufl.edu) +Jonathan Turkanis (turkanis -at- coderage dot com) +Juergen Hunold (hunold -at- ive.uni-hannover.de) (See Boost List Message of Fri, 13 Aug 2004 19:39:55 +0200) +Kevlin Henney (kevlin -at- curbralan.com) (See Boost list message of Wed, 15 Sep 2004 18:15:17 +0200) +Kresimir Fresl (fresl -at- master.grad.hr) (See Boost List message of August 16, 2004 8:23:35 AM EST) +Lars Gullik Bjønnes (larsbj -at- lyx.org) (See Boost list message of Tue, 17 Aug 2004 15:49:02 +0100) +Lie-Quan Lee (liequan - at - slac.stanford.edu, llee - at - cs.indiana.edu) +Maarten Keijzer (mkeijzer -at- cs.vu.nl) (See Boost list message of Wed, 18 Aug 2004 21:43:18 +0100) +Mac Murrett (mmurrett -at- mac.com) +Marc Wintermantel (wintermantel -at- imes.mavt.ethz.ch, wintermantel -at- even-ag.ch) (See CVS log) +Michael Glassford (glassfordm - at - hotmail.com) +Michael Stevens (Michael.Stevens - at - epost.de) +Multi Media Ltd. (pdimov@mmltd.net) +Nicolai M Josuttis (solutions -at- josuttis.com) (See Boost list message of Mon, 30 Aug 2004 10:52:00 +0100) +Nikolay Mladenov (nickm -at- sitius.com) (See Boost list message of Tue, 17 Aug 2004 15:45:33 +0100) +Paul Mensonides (pmenso57 -at- comcast.net) (See Boost list message of July 21, 2004 1:12:21 AM EST) +Pavol Droba (droba -at- topmail.sk) +Peter Dimov (pdimov@mmltd.net) +R W Grosse-Kunstleve (RWGrosse-Kunstleve@lbl.gov) +Ralf W. Grosse-Kunstleve (RWGrosse-Kunstleve@lbl.gov) +Rational Discovery LLC (Greg Landrum Landrum -at- RationalDiscovery.com) (See Boost list post of Tue, 17 Aug 2004 10:35:36 +0100) +Rene Rivera (grafik/redshift-software.com, rrivera/acm.org) +Robert Ramey (ramey@www.rrsd.com) +Roland Richter (roland -at- flll.jku.at) (See Boost list post of Mon, 16 Aug 2004 22:16:55 +0200) +Roland Schwarz (roland.schwarz -at- chello.at) +Ronald Garcia (garcia -at- cs.indiana.edu) (Email to Andreas Huber, see change log) +Samuel Krempp (krempp -at- crans.ens-cachan.fr) (See Boost list message of Mon, 27 Sep 2004 13:18:36 +0200) +Stefan Seefeld (seefeld -at- sympatico.ca) +Stephen Cleary (scleary -at- jerviswebb.com) (See Boost list message of Tue, 28 Sep 2004 13:11:46 +0100) +Steve Cleary (Variant of Stephen Cleary) +Sylvain Pion (Sylvain.Pion - at - sophia.inria.fr) +The Trustees of Indiana University () +Thomas Witt (witt - at - ive.uni-hannover.de, witt - at - acm.org, witt - at - styleadvisor.com) +Thorsten Jørgen Ottosen (nesotto - at - cs.auc.dk) +Thorsten Ottosen (nesotto - at - cs.auc.dk) +Toon Knapen (toon dot knapen - at - fft.be) +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) + +--- end --- + diff --git a/more/boost-dark-trans.png b/more/boost-dark-trans.png new file mode 100644 index 0000000000..1aa16e202f Binary files /dev/null and b/more/boost-dark-trans.png differ diff --git a/more/boost_1_33_0.jpg b/more/boost_1_33_0.jpg new file mode 100644 index 0000000000..6f26ef38d3 Binary files /dev/null and b/more/boost_1_33_0.jpg differ diff --git a/more/borland_cpp.html b/more/borland_cpp.html new file mode 100644 index 0000000000..49781ed196 --- /dev/null +++ b/more/borland_cpp.html @@ -0,0 +1,394 @@ + + + + + + + + Portability Hints: Borland C++ 5.5.1 + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

Portability Hints: Borland C++ 5.5.1

+ +

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.

+ +

Preprocessor symbol

+ +

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 40x0540
Borland C++ Builder 50x0550
Borland C++ 5.50x0550
Borland C++ 5.5.10x0551
Borland C++ Builder 60x0560
+ +

Core Language

+ +

[using-directive] Mixing using-declarations and + using-directives

+ +

Mixing 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 template] using-declarations for class + templates

+ +

Identifiers 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 const arg] Deduction of constant arguments to function + templates

+ +

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);
+}
+
+ +

[function address] Resolving addresses of overloaded functions

+ +

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.

+ +

[string conversion] Converting const char * to + std::string

+ +

Implicitly 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 defaults] Dependent default arguments for template + value parameters

+ +

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).

+ +

[function partial ordering] Partial ordering of function templates

+ +

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.

+ +

[instantiate memfun ptr] Instantiation with member function + pointer

+ +

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.)

+ +

Library

+ +

[cmath.abs] Function double std::abs(double) missing

+ +

The 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.

+ +

Appendix: Additional issues with Borland C++ version 5.5

+ +

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.

+ +

[inline friend] Inline friend functions in template classes

+ +

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].

+
+ +

Valid HTML 4.01 Transitional

+ +

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/more/bugs.htm b/more/bugs.htm new file mode 100644 index 0000000000..6d07c54e0f --- /dev/null +++ b/more/bugs.htm @@ -0,0 +1,118 @@ + + + + + + + + + Bugs + + + + + + + + + + + + + + + + +
+ boost.png (6897 bytes)Home + Libraries + PeopleFAQMore
+ +

What to do about Boost bugs

+ +
    + +
  1. Make sure the bug isn't already fixed in the latest sources. The most + recent version of everything on the Boost web site is available from + the boost public + CVS repository.
    +
    +
    2. +
  2. If you are a Boost user, or a Boost developer that doesn't have a CVS + write access:
    +
    +
      +
    1. Submit a bug report to either + boost-users list, + boost mailing + list, or our bug + tracking facility; submitting it to either of the mailing + lists is a preferred way - because many of the Boost developers read the + lists on a daily basis, this way you are likely to get a quicker response, + and the discussions that often arise there from (possible) bug reports are + quite interesting and educational as well;
      +
      +
      2. +
    2. If you have a proposed patch to the code, post it along with your bug + report, preferably in the unified diffs format (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:
      +
      +
        +
      1. Download the latest version of intentional_bug.hpp from CVS.
        2. +
      2. Make sure that the bug is still present in the code.
        3. +
      3. Copy the file intentional_bug.hpp to a file called intentional_bug.hpp.orig.
        4. +
      4. Apply your changes to intentional_bug.hpp.
        5. +
      5. Run "diff -du intentional_bug.hpp.orig intentional_bug.hpp > intentional_bug.hpp.patch" from the command prompt.
        6. +
      6. Submit the patch file together with an explanation of the bug +and the proposed fix; and don't forget to include the word patch or bug +in the subject if you're submitting to the boost mailing list.
        +
        +
        7. +
      + +
      3. + +
    +
    3. +
  3. If you are a Boost developer, and you have a CVS write access:
    +
    +
      +
    1. If the bug is trivial (e.g. misspelled name, missed 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);
      +
      +
      2. +
    2. If the bug is non-trivial, and/or you don't have the time and resources to fix it, + submit a bug report (see p. 2 above); chances are that the maintainer(s) + will respond promptly and take care of the problem;
      +
      +
      3. +
    3. Otherwise, create a temporary branch in CVS, make your changes there, and + ask the library author(s)/maintainer(s) to review them; if they are ok with + the new code, either you or they can integrate the fixes into the main + trunk.
      4. +
    +
    4. +
+ +
+

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) +

+ +
+ + + diff --git a/more/count_bdy.htm b/more/count_bdy.htm new file mode 100644 index 0000000000..67e9087630 --- /dev/null +++ b/more/count_bdy.htm @@ -0,0 +1,774 @@ + + + + + + + + + + + Counted Body Techniques + + + +

Counted Body Techniques

+ +
+

Kevlin Henney
 + (kevlin@acm.org, khenney@qatraining.com)

+
+ +
+

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....

+
+
+ +

And then there were none...

+ +
+

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:

+ +
    +
  • Hidden: The handle is the object of interest, hiding the body + itself. The functionality of the handle is obtained by delegation to the + body, and the user of the handle is unaware of the body. Reference + counted strings offer a transparent optimisation. The body is shared + between copies of a string until such a time as a change is needed, at + which point a copy is made. Such a COPY ON WRITE + pattern (a specialisation of LAZY EVALUATION) requires the use of a hidden reference counted + body.
    • + +
  • Explicit: Here the body is of interest and the handle merely + provides intelligence for its access and housekeeping. In C++ this is + often implemented as the SMART POINTER idiom. One such application is that of reference + counted smart pointers that collaborate to keep a count of an object, + deleting it when the count falls to zero.
    • +
+
+
+ +

Attached vs detached

+ +
+

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]:

+ +
    +
  • COUNTED BODY or ATTACHED + COUNTED + HANDLE/BODY places the + count within the object being counted. The benefits are that + countability is a part of the object being counted, and that reference + counting does not require an additional object. The drawbacks are + clearly that this is intrusive, and that the space for the reference + count is wasted when the object is not heap based. Therefore the + reference counting ties you to a particular implementation and style of + use.
    • + +
  • DETACHED COUNTED + HANDLE/BODY places the + count outside the object being counted, such that they are handled + together. The clear benefit of this is that this technique is completely + unintrusive, with all of the intelligence and support apparatus in the + smart pointer, and therefore can be used on classes created + independently of the reference counted pointer. The main disadvantage is + that frequent use of this can lead to a proliferation of small objects, + i.e. the counter, being created on the heap.
    • +
+ +

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.

+
+
+ +

A requirements based approach

+ +
+

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:

+ +
    +
  • An acquire operation that registers + interest in a Countable object.
    • + +
  • A release operation unregisters + interest in a Countable object.
    • + +
  • An acquired query that returns + whether or not a Countable object is currently acquired.
    • + +
  • A dispose operation that is + responsible for disposing of an object that is no longer acquired.
    • +
+ +

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):

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
ExpressionReturn typeSemantics and notes
acquire(ptr)no requirementpost: acquired(ptr)
release(ptr)no requirementpre: acquired(ptr)
 + post: acquired(ptr) == #acquire - + #release
acquired(ptr)convertible to boolreturn: #acquire > #release
dispose(ptr, ptr)no requirementpre: !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:

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
ExpressionReturn typeSemantics and notes
acquire(null)no requirementaction: none
release(null)no requirementaction: none
acquired(null)convertible to boolreturn: false
dispose(null, null)no requirementaction: 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.

+
+
+ +

Getting smart

+ +
+

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);
+}
+
+
+
+
+
+ +

Public accountability

+ +
+

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
+
+
+
+
+
+ +

Runtime mixin

+ +
+

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 *.

+
+
+ +

Getting smarter

+ +
+

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.

+
+
+ +

Conclusion

+ +
+

There are two key concepts that this article has introduced:

+ +
    +
  • The use of a generic requirements based approach to simplify and + adapt the use of the COUNTED BODY pattern.
    • + +
  • The ability, through control of allocation, to dynamically and + non-intrusively add capabilities to fixed types using the RUNTIME MIXIN pattern.
    • +
+ +

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.

+
+ +
+
+ First published in Overload 25, + April 1998, ISSN 1354-3172 +
+ +

Valid HTML 4.01 Transitional

+ +

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/more/cpp_committee_meetings.html b/more/cpp_committee_meetings.html new file mode 100644 index 0000000000..26bc51af5b --- /dev/null +++ b/more/cpp_committee_meetings.html @@ -0,0 +1,125 @@ + + + + + + + + +C++ Committee Meetings + + + + +

C++ Committee Meeting FAQ for Boost Members

+

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/more/css_0/boost_bullet.gif b/more/css_0/boost_bullet.gif new file mode 100644 index 0000000000..f659f9524d Binary files /dev/null and b/more/css_0/boost_bullet.gif differ diff --git a/more/css_0/common.css b/more/css_0/common.css new file mode 100644 index 0000000000..ec1a6f02a0 --- /dev/null +++ b/more/css_0/common.css @@ -0,0 +1,241 @@ +/* + Copyright 2004-2005 Redshift Software, Inc. + Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) +*/ +/* The base font size. The first one is for IE, the second for everyone else. */ +body { + font-size: smaller; +} +* > body { + font-size: 10pt; +} +/* Global defaults. */ +* { + margin: 0; + padding: 0; + font-weight: normal; + font-size: 100%; + text-decoration: none; +} +body { + font-family: sans-serif; + color: #000000; + background-color: #CCCCCC; +} +/* Links, black with sharp slate blue underline in all states. */ +a { + text-decoration: none; + color: #000000; + border-bottom: 1px solid #8AB4CA; +} +a:hover { + border-bottom: 1px solid #005090; +} +/* A generic class to clear this element. */ +.clear { + clear: both; + width: 100%; + height: 1px; + overflow: hidden; +} +/* Enforce a minimum width. */ +/* - For IE we can't really control this so we only make + sure the container doesn't look strange at small sizes by + making the body have enough whitespace. */ +/* #content h1, #content h2, #content h3 { + white-space: nowrap; +} */ +/* - New browsers have the easy way to set this. */ +.body-0 { + min-width: 55em; +} +/* The shadow arrangement. */ +.body-0 { + padding-left: 50px; + background: url(shadow-light-dark.png) repeat-y left; +} +.body-1 { + padding-right: 50px; + background: url(shadow-dark-light.png) repeat-y right; +} +.body-2 { + background-color: #FFFFFF; +} +/* */ +#content { + padding: 1em; +} +/* Heading, title and logo. */ +#heading { + background: #005080 url(heading-background.jpg) repeat bottom left; + border: 2px solid #FFFFFF; + position: relative; +} +#heading * { + color: #FFFFFF; +} +#heading h1 { + padding: 2em 0.25em 0.25em 0.75em; + float: left; + position: relative; + white-space: nowrap; +} +#heading h1 img { + border: none; +} +#heading #boost { + font-size: 250%; + font-weight: 900; + font-family: Impact, sans-serif; +} +#heading #cpplibraries { + font-size: 100%; + font-weight: 900; + padding-left: 0.75em; +} +#heading-quote { + white-space: nowrap; + margin: 0.75em 0.75em 0em -7em; + float: right; + clear: right; + position: relative; + text-align: right; +} +#heading-quote .quote { + font-size: 80%; + display: block; +} +#heading-quote .attribution { + font-size: 75%; + display: block; +} +#heading-quote a { + border-bottom: 1px solid #0080C0; +} +#heading-quote a:hover { + border-bottom: 1px solid #c8dae3; +} +/* Content sections, inside the top content section. */ +.section { + padding-left: 28px; + margin-bottom: 3em; +} +.section-body p { + margin: 0em 0em 0.75em 0em; +} +.section-body h2 { + margin: 0em 0em 0.5em 0em; + padding: 0em 0em 0em 0em; + font-size: 140%; + clear: both; +} +.section-body h3 { + margin: 0em; + padding: 0em; + font-size: 120%; + clear: both; +} +.section-body h4 { + margin: 0.5em 0em 0.5em 0em; + font-size: 110%; + clear: both; +} +.section-body ul { + margin: 0em 0em 0.75em 0em; + padding: 0em 0em 0em 2em; +} +.section-body ul li { + margin: 0.75em 0em 0em 0em; + text-indent: -1.75em; + padding: 0em; + list-style-type: none; +} +.section-body ul li ul { + margin: 0.75em 0em 0em 0em; + padding: 0em; +} +.section-body ul li ul li { + display: block; + margin: 0em; + padding: 0em 0em 0em 1em; + list-style-type: none; + background: url(boost_bullet.gif) no-repeat 0em 0.5em; + text-indent: 0em; +} +.section-body blockquote { + margin: 0.5em 1em 0em 2em; + border-right: 1px dashed #CCCCCC; + border-left: 1px dashed #CCCCCC; + text-align: justify; + padding-right: 0.5em; + padding-left: 0.5em; +} +.section-body .left-inset { + float: left; + margin: 0em 1em 1em 0em; +} +.section-body .library { + display: block; + margin: 0em 0em 0.5em 0em; +} +.section-body .faq { + margin: 0em 0em 1em 0em; +} +.section-body .faq .faq-question { + color: #005080; + font-weight: bold; +} +.section-body .faq .faq-answer { +} +.section-body .note { + margin: 0em 0em 1em 0em; +} +.section-body .note .note-label { + color: #005080; + font-weight: bold; +} +.section-body .note .note-body { +} +.section-body table { + width: 90%; + margin-left: auto; + margin-right: auto; + border-spacing: 0.5em; + border: none; +} +.section-body table caption { + margin-left: auto; + margin-right: auto; + border-bottom: 1pt solid #000000; + padding: 0em 0em 0.2em 0em; +} +.section-body table tr th { + border: none; + border-bottom: 1pt solid #000000; + text-align: left; + vertical-align: bottom; + font-weight: bold; + padding: 0em 0em 0.2em 0em; +} +.section-body table tr td { + border: none; + text-align: left; + vertical-align: top; + padding: 0em 0em 0.2em 0em; +} +/* Section headings, all use the same stream op indicator style. */ +#content h1, #content h2 { + padding-left: 24px; + background: url(section_head.png) no-repeat left center; + text-indent: 4px; + vertical-align: middle; + font-size: 140%; + position: relative; + left: -28px; +} +/* Uniformly color everything that's a heading */ +#content h1, #content h2, #content h3, #content h4 { + color: #005080; + font-weight: bold; +} diff --git a/more/css_0/csshover.htc b/more/css_0/csshover.htc new file mode 100644 index 0000000000..bab62c367a --- /dev/null +++ b/more/css_0/csshover.htc @@ -0,0 +1,91 @@ + + \ No newline at end of file diff --git a/more/css_0/front.css b/more/css_0/front.css new file mode 100644 index 0000000000..974db16c01 --- /dev/null +++ b/more/css_0/front.css @@ -0,0 +1,206 @@ +/* + Copyright 2004-2005 Redshift Software, Inc. + Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) +*/ +@import url(common.css); +/* */ +#news { + margin-bottom: 0em; +} +#content table { + border-spacing: 0em; +} +#sidebars-top { + vertical-align: top; +} +#sidebars-bottom { + vertical-align: bottom; +} +.sidebar { + width: 22em; + margin: 0em 0em 1em 1em +} +#content h1, #content h2 { + margin: 0em 0em 0.5em 0em; +} +/* The shadow and inner layout of the sidebars. */ +.sidebar { + background: url(sidebar-shadow-bottom.png) no-repeat left bottom; +} +.sidebar-0 { + background: url(sidebar-shadow-right.png) no-repeat right top; +} +.sidebar-1 { + padding: 0px 8px 8px 0px; + background: url(sidebar-shadow-bottom-right.png) no-repeat right bottom; +} +.sidebar-2 { + border: 1px solid #c8dae3; +} +.sidebar-3 { + padding: 0em 0.5em 0.5em 0em; +} +/* Arrangement of the various side cells. */ +#libraries, #search, #tests, +#groups, #contribute, #support, +#other, #official, #unofficial, #footer { + float: left; +} +#search, +#official, +#footer { + clear: left; +} +/* */ +.sidecell { + width: 50%; +} +.sidecell-0 { + padding: 0.5em 0em 0em 0.5em; + font-size: 85%; +} +.sidecell h4 { + display: block; margin: 0em; padding: 0em; + border-bottom: 1px solid #8AB4CA; +} +.sidecell:hover h4 { + border-bottom-color: #005090; +} +.sidecell form { + display: block; margin: 0em; padding: 0em; +} +.sidecell ul { + display: block; margin: 0em; padding: 0em; +} +/* Lists in sidecells are menus. */ +.sidecell ul a { + border: none; + padding-left: 14px; +} +.sidecell ul a:hover { + border: none; + background: url(menu_link_indicator.png) no-repeat left center; +} +.sidecell ul { + list-style-type: none; +} +.sidecell ul li { + margin: 0em; padding: 0em; +} +/* Search box */ +#search { + width: 98.5%; +} +/* - The three parts of the search widget. */ +#search #search-text { + display: block; + height: 1.8em; + margin: 0.25em 0em 0em 0em; + padding: 0em 48% 0em 0em; +} +#search #search-choice { + display: block; + height: 1.8em; + margin: -1.8em 0em 0em 55%; + padding: 0em 30px 0em 0em; +} +#search #go { + display: block; + height: 1.8em; + margin: -1.8em 0em 0em 55%; + text-align: right; +} +#search #search-text #q { + width: 100%; + margin: 0em; padding: 1px; + border: 1px solid #003399; + color: #000000; + background-color: #FFFFFF; +} +#search #search-choice #hq { + width: 100%; + margin: 0em; padding: 0em; + border: 1px solid #003399; + color: #000000; + background-color: #FFFFFF; +} +#search #go #search-button { + width: 26px; height: 20px; + margin: 0em; padding: 0em; + background-image: url(search-button.png); +} +/* - The custom Google banner and link. */ +#search #google { + display: block; + clear: both; + margin: 0em 0em 0em 0em; + border: none; + text-align: center; +} +#search #google a { + font-size: 10px; +} +#search #google img { + width: 75px; height: 32px; + margin: 0em -20px 0em 0em; + border: none; +} +/* Footer with copyright and license. */ +#footer-sidebar, +#footer-sidebar .sidebar-0, #footer-sidebar .sidebar-1, +#footer-sidebar .sidebar-2, #footer-sidebar .sidebar-3 { + background: #FFFFFF; + border: none; +} +#footer-sidebar { + padding: 3em 0em 0em 0em; +} +#footer { + width: 100%; +} +#footer p { + margin: 0em; padding: 0em; + text-align: left; +} +#footer #revised { + display: block; + border-bottom: 1px solid #8AB4CA; +} +#footer:hover #revised { + border-bottom-color: #005090; +} +#footer #revised p { +} +#footer #copyright { + display: block; + margin: 0.25em 0em 1em 14px; +} +#footer #copyright p { + margin: 0em; + padding: 0em 0em 0em 1.5em; + text-indent: -1.5em; +} +#footer #license { + display: block; + margin: 0.25em 0em 1em 14px; +} +#footer #license p { + margin: 0em; + padding: 0em 0em 0em 1.5em; + text-indent: -1.5em; +} +#footer #banners { + display: block; + margin: 0.25em 0em 0em 0em; + text-align: center; +} +#footer #banners p { + display: inline; +} +#footer #banners img { + border: none; +} +#footer #banners a { + border: none; +} diff --git a/more/css_0/heading-background.jpg b/more/css_0/heading-background.jpg new file mode 100644 index 0000000000..f02efb2d2b Binary files /dev/null and b/more/css_0/heading-background.jpg differ diff --git a/more/css_0/inner.css b/more/css_0/inner.css new file mode 100644 index 0000000000..1b873ec968 --- /dev/null +++ b/more/css_0/inner.css @@ -0,0 +1,70 @@ +/* + Copyright 2004-2005 Redshift Software, Inc. + Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) +*/ +@import url(common.css); +/* Heading quick pick menu. */ +#heading ul { + float: right; + clear: right; + margin: 0.5em 1em 0em 0em; + padding: 0.25em 0em 0.25em 0em; + position: relative; + list-style-type: none; + white-space: nowrap; +} +#heading ul li { + display: inline; + margin: 0em; padding: 0em; +} +#heading ul li a { + margin: 0em; + padding: 0em 0.25em 0em 0.25em; + background-color: #005080; + border: 1px solid #0080C0; +} +#heading ul li a:hover { + border: 1px solid #c8dae3; +} +#heading h1 a { + color: #FFFFFF; + border: none; +} +#heading h1 a:hover { + border: none; +} +/* */ +#history { + margin: 0em; + padding: 0em; + padding-left: 28px; +} +#content h1, #content h2 { + left: 0; +} +.section-body h3 { + margin: 1.5em 0em 0.5em 0em; +} +/* Footer with copyright and license. */ +#footer { + background-color: #c8dae3; + border: 2px solid #FFFFFF; + color: #000000; + padding: 0.5em; +} +#footer p { + margin: 0em; + padding: 0em; + font-size: 80%; + margin: 0em; + padding: 0em 0.5em 0em 0.5em; + text-align: center; +} +#footer a { + color: #000000; + border-bottom: 1px solid #A0B0C0; +} +#footer a:hover { + border-bottom: 1px solid #0080C0; +} diff --git a/more/css_0/menu_link_indicator.png b/more/css_0/menu_link_indicator.png new file mode 100644 index 0000000000..d604822e81 Binary files /dev/null and b/more/css_0/menu_link_indicator.png differ diff --git a/more/css_0/search-button.png b/more/css_0/search-button.png new file mode 100644 index 0000000000..c90815dfc3 Binary files /dev/null and b/more/css_0/search-button.png differ diff --git a/more/css_0/section_head.png b/more/css_0/section_head.png new file mode 100644 index 0000000000..0caaab4a94 Binary files /dev/null and b/more/css_0/section_head.png differ diff --git a/more/css_0/shadow-dark-light.png b/more/css_0/shadow-dark-light.png new file mode 100644 index 0000000000..bea4995eff Binary files /dev/null and b/more/css_0/shadow-dark-light.png differ diff --git a/more/css_0/shadow-light-dark.png b/more/css_0/shadow-light-dark.png new file mode 100644 index 0000000000..b4ed2c4aa4 Binary files /dev/null and b/more/css_0/shadow-light-dark.png differ diff --git a/more/css_0/sidebar-shadow-bottom-right.png b/more/css_0/sidebar-shadow-bottom-right.png new file mode 100644 index 0000000000..b19bfca615 Binary files /dev/null and b/more/css_0/sidebar-shadow-bottom-right.png differ diff --git a/more/css_0/sidebar-shadow-bottom.png b/more/css_0/sidebar-shadow-bottom.png new file mode 100644 index 0000000000..a0f9e4c40d Binary files /dev/null and b/more/css_0/sidebar-shadow-bottom.png differ diff --git a/more/css_0/sidebar-shadow-right.png b/more/css_0/sidebar-shadow-right.png new file mode 100644 index 0000000000..6f1e5dee81 Binary files /dev/null and b/more/css_0/sidebar-shadow-right.png differ diff --git a/more/cvs.html b/more/cvs.html new file mode 100644 index 0000000000..7b85554924 --- /dev/null +++ b/more/cvs.html @@ -0,0 +1,112 @@ + + + + + Boost CVS Repository + + + + + + + + + + + + + + +
+ + + + + +
+ + + + +
+

. Home
+ . Libraries
+ . People
+ . FAQ
+ . More

+
+
+
+ +

Boost's CVS Repository

+ +

All Boost files, including the entire distribution tree including web + site HTML is maintained in a CVS repository. Command line, GUI, or browser + access is available.

+ +

Boost CVS access via command line or graphical clients

For those + who have CVS clients installed, the libraries are also available from the + public Boost CVS + repository. Free command line clients (often already installed on + Linux/Unix systems) are available for many systems, and free GUI clients + are available for Windows, Mac, and other systems. + +

See the much improved CVS documentation (Section + F) from SourceForge, which includes links to the home pages for various GUI + and command line clients.

+ +

The general procedure for command-line clients is something like + this:

+ +
+ cvs -d:pserver:anonymous@boost.cvs.sourceforge.net:/cvsroot/boost + login
+ [Hit <return> when it asks for a password]
+ cvs -z3 -d:pserver:anonymous@boost.cvs.sourceforge.net:/cvsroot/boost + checkout boost
+ cvs -d:pserver:anonymous@boost.cvs.sourceforge.net:/cvsroot/boost + logout +
Read the manual for your CVS client for further information. + +

This access is read-only; if you are a library author and wish to have + CVS write access, please contact one of the moderators.

+ +

Boost CVS access via web Browser

For access to the CVS archive from any modern web + browser, you can also use the web + browser  interface.  Try one of the color diffs to see how a + file has changed over time. Note: this interface is only suitable + for viewing individual files and their revision histories. + +

Documentation generated from + BoostBook in CVS

+ +

Some of the Boost documentation is generated from BoostBook XML source stored in the CVS + repository, and will not appear directly in the CVS tree as readable HTML. + View a nightly build of the generated HTML on the + Nightly Generated Documentation page. Where generated HTML is missing + from the CVS tree, an attempt has been made to include redirection to this + nightly build, but if you are away from an internet connection you may want + to download the generated documentation archive from the aforementioned + page so you can browse those documents offline.

+ +
+ +

Revised $Date$

+ +

Copyright © Rene Rivera 2003.
+ Copyright © Jens Maurer 2001.
+ Copyright © John Maddock 2004.

+ +

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/more/discussion_policy.htm b/more/discussion_policy.htm new file mode 100644 index 0000000000..3a584af600 --- /dev/null +++ b/more/discussion_policy.htm @@ -0,0 +1,370 @@ + + + + + + + + + + + Boost Discussion Policy + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

Boost Discussion Policy

+ +

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.

+ +

Contents

+ +
+
Acceptable Topics
+ +
Unacceptable Topics
+ +
Effective Posting
+ +
Prohibited Behavior
+ +
Culture
+ +
Library Names
+
+ +

Acceptable topics

+ +
    +
  • Queries to determine interest in a possible library submission.
    • + +
  • Technical discussions about a proposed or existing library, including + bug reports and requests for help.
    • + +
  • Formal Reviews of proposed libraries.
    • + +
  • Reports of user experiences with Boost libraries.
    • + +
  • Boost administration or policies.
    • + +
  • Compiler specific workarounds as applied to Boost libraries.
    • +
+ +

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.

+ +

Unacceptable Topics

+ +
    +
  • Advertisements for commercial products.
    • + +
  • Requests for help getting non-boost code to compile with your + compiler. Try the comp.lang.c++.moderated newsgroup instead.
    • + +
  • Requests for help interpreting the C++ standard. Try the comp.std.c++ + newsgroup instead.
    • + +
  • Job offers.
    • + +
  • Requests for solutions to homework assignments.
    • +
+ +

Effective Posting

+ +

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.

+ +

Well-Crafted Posting is Worth the Effort

+ +

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.

+ +

Put the Library Name in the Subject Line

+ +

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. + +

+ +

Don't Use Tabs

If you use tabs to indent your source code, convert + them to spaces before inserting the code in a posting. Something in the + processing chain usually strips all the indentation and leaves a mess + behind. + +

+ +

Limit Line Length

If you put source code in your postings and your + mailer wraps long lines automatically, either keep the code narrow or + insert the code as an (inline, if possible) attachment. That will help + ensure others can read what you've posted. + +

+ +

Don't Overquote

Please prune extraneous quoted text from + replies so that only the relevant parts are included. Some people have to + pay for, or wait for, each byte that they download from the list. More + importantly, it will save time and make your post more valuable when + readers do not have to find out which exact part of a previous message you + are responding to. + +

Use a Readable Quotation Style

+ +

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:

+ +
+ 
+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.
+...
+
+
+
For more information about effective use of quotation in + posts, see this + helpful guide. + +

Keep the Formatting of Quotations Consistent

+ +

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.

+ +

Summarizing and Referring to Earlier Messages

+ +

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).

+ +

Maintain the Integrity of Discussion Threads

+ +

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.

+ +

Keep The Size of Your Posting Manageable

+ +

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

+ +

Prohibited behavior will not be tolerated. The moderators will ban + postings by abusers.

+ +

Flame wars

+ +

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.

+ +

Third-party attacks

+ +

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.

+ +

Off-topic posts

+ +

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.

+ +

Culture

+ +

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.

+ +

Guidelines for Effective Discussions

+ +

Apply social engineering to prevent heated technical discussion from + degenerating into a shouting match, and to actively encourage the + cooperation upon which Boost depends.

+ +
    +
  • Questions help. If someone suggests something that you don't think + will work, then replying with a question like "will that compile?" or + "won't that fail to compile, or am I missing something?" is a lot + smoother than "That's really stupid - it won't compile."  Saying + "that fails to compile for me, and seems to violate section n.n.n of the + standard" would be yet another way to be firm without being + abrasive.
    • + +
  • If most of the discussion has been code-free generalities, posting a + bit of sample code can focus people on the practical issues.
    • + +
  • If most of the discussion has been in terms of specific code, try to + talk a bit about hidden assumptions and generalities that may be + preventing discussion closure.
    • + +
  • Taking a time-out is often effective. Just say: "Let me think about + that for a day or two. Let's take a time-out to digest the discussion so + far."
    • +
+ +

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. 

+ +

Library Names

+ +

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:

+ +
    +
  • the proposed Boost Name library
    • + +
  • the Boost.Name candidate
    • + +
  • the Name library (probably the best choice where + applicable)
    • +
+ +

Note that this policy only applies to discussions, not to the + documentation, directory structure, or even identifiers in the code of + potential Boost libraries.

+
+ +

Valid HTML 4.01 Transitional

+ +

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/more/error_handling.html b/more/error_handling.html new file mode 100644 index 0000000000..14364048f5 --- /dev/null +++ b/more/error_handling.html @@ -0,0 +1,240 @@ + + + + + + + + Error and Exception Handling + + + +

Error and Exception Handling

+ +

References

+ +

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 +
+ +

Guidelines

+ +

When should I use exceptions?

+ +

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.

+ +

How should I design my exception classes?

+ +
    +
  1. Derive your exception class + from 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. + +
  2. Use virtual inheritance. This insight is due + to Andrew Koenig. Using virtual inheritance from your + exception's base class(es) prevents ambiguity problems at the + catch-site in case someone throws an exception derived from + multiple bases which have a base class in common: + +
    +#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. + +
    3. + +
  3. + Don't embed a std::string object or any other data + member or base class whose copy constructor could throw an exception. + That could lead directly to std::terminate() at the throw point. + Similarly, it's a bad idea to use a base or member whose ordinary + constructor(s) might throw, because, though not necessarily fatal to + your program, you may report a different exception than intended from + a throw-expression that includes construction such as: + +
    +
    +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.

    +
    4. + +
  4. Format the 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 throws
    5. + +
  5. Don't worry too much about the what() + 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...
    6. + +
  6. Expose relevant information about the cause of the error in + your exception class' public interface. A fixation on the + 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.
    7. + +
  7. Make your exception class immune to double-destruction if + possible. Unfortunately, several popular compilers occasionally cause + exception objects to be destroyed twice. If you can arrange for that to + be harmless (e.g. by zeroing deleted pointers) your code will be more + robust.
    8. +
+ +

What About Programmer Errors?

+ +

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. + +

How should I handle exceptions?

+ +

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.

+ +

Avoid catch(...) when possible

+ Unfortunately, operating systems other than Windows also wind non-C++ + "exceptions" (such as thread cancellation) into the C++ EH machinery, and + there is sometimes no workaround corresponding to the + _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/more/faq.htm b/more/faq.htm new file mode 100644 index 0000000000..39c68f2f7c --- /dev/null +++ b/more/faq.htm @@ -0,0 +1,178 @@ + + + + + +Boost FAQ + + + + + + + + + + + + + + +
+ boost.png (6897 bytes)Home Libraries People FAQ More
+ +

Boost Frequently Asked Questions

+ +

How do I download the libraries? +  See Download instructions.

+ +

What support is available for the libraries?  The +Boost-Users mailing list is a good start.

+ +

What do the Boost version numbers mean?  The scheme is x.y.z, where x is incremented only for massive changes, such as a reorganization of many libraries, y is incremented whenever a new library is added, and z is incremented for maintenance releases. y and z are reset to 0 if +the value to the left changes. 
+
+Is there any assurance libraries actually work as claimed? No. The review +process will hopefully eliminate the most seriously flawed libraries, but a well +constructed library with hidden defects is likely to slip through. Encouraging ordinary +users to report their experience with a library is intended to address such concerns.  +See the Status page for an +indication of how well a library works on specific platforms.

+ +

+How can the Boost libraries be used successfully for important projects?  +Many of the Boost libraries are actively maintained and improved, so backward compatibility with prior version isn't always possible. Deal with this by freezing the version of the Boost libraries used by your project. Only upgrade at points in your project's life cycle where a bit of change will not cause problems. Individual bug fixes can always be obtained from the CVS repository.

+ +

How is a library accepted for posting on the site? +See Library Submission Process

+ +

How does someone submit a Formal Review comment?  Send email to boost@lists.boost.org.  See the Formal +Review page for more information.

+ +

How does someone submit a library? See Library +Guidelines

+ +

Are commercial libraries requiring a fee acceptable? No. However, a library that +a commercial enterprise makes available without fee is acceptable. If the description of +the library makes a low-key plug for the supplier, that is acceptable as long as the +library delivers real value and isn't just a Trojan horse for the plug.

+ +

Are shareware libraries acceptable? No. Only free libraries +will be accepted.

+ +

Are open source license libraries acceptable?  Some +are, many are not. +Open source licenses often require redistribution or availability of source code, +inclusion of license document with machine-executable redistribution, give the initial +developer rights to licensee modifications, or need a lawyer to understand.  These +would be immediate disqualifications for many business, commercial, and consumer +applications. Boost aims to avoid subjecting users to hard-to-comply-with license +terms. See License requirements.
+
+This is subject to review for a particularly important piece of software, or as the +industry changes.

+ +

Must full source code be provided? Yes, these are source code libraries.

+ +

What about documentation? A very simple library might be accepted with only a +well commented header file. For more substantial libraries, some form of documentation is +certainly going to be expected.  HTML is the preferred form.

+ +

Are platform specific libraries acceptable? There is a preference for portable +libraries. Libraries will be accepted that have portable interfaces but require platform +specific implementations, as long as the author supplies implementations for a couple of +disparate major operating systems.

+ +

Must a library do useful work? No. A library meant as a teaching example or +demonstration might not actually do any work.

+ +

Can an existing library be accepted by Boost? Yes, although it would +have to be "Boostified" to meet the requirements.  The Boost +Graph and Regex libraries are examples of libraries which began life elsewhere.

+ +

Who owns the libraries? Presumably many authors will copyright their libraries. +Others authors may wish to place their libraries in the public domain. The Boost.org +policy is to only accept libraries with a clear copyright notice and meeting the +License requirements..  It is up to +potential users to decide if the terms acceptable, and not to use +libraries with unacceptable copyrights or licenses.

+ +

Is there a formal relationship between Boost.org and the C++ Standards Committee? + No, although there is a strong informal relationship in that many members +of the committee participate in Boost, and the people who started Boost were all +committee members.

+ +

Will the Boost.org libraries become part of the next C++ Standard?  Some +might, someday, but that is up to the standards committee.  Committee +members who also participate in Boost will definitely be proposing at least some +Boost libraries for standardization.

+ +

Libraries which are "existing practice" are most likely to be +accepted by the C++ committee for future standardization. Having a library +accepted by Boost is +one way to establish existing practice.

+ +

Where does the name "Boost" come from? Boost began with +Robert Klarer and I fantasizing about a new library effort over dinner at a C++ +committee meeting in Sofia Antipolis, France, in 1998. Robert mentioned that Herb Sutter +was working on a spoof proposal for a new language named Booze, which was +supposed to be better than Java. Somehow that kicked off the idea of +"Boost" as a name. We'd probably had a couple of glasses of good +French wine at that point. It was just a working name, but no one ever came up +with a replacement. (Beman Dawes)

+ +

Is the web site a commercial business? No. It is just some people getting together +as a kind of cyberspace civic association. If it ever needs to incorporate, it would be as +a +non-profit organization.

+ +

Is there any charge for submitting libraries or reviews to Boost.org? No. Unlike +the standards committees, you don't have to pay to volunteer!

+ +

Will the site include material beyond libraries? The main focus is on libraries, +but if people contribute occasional articles or other material to make the site more +interesting, that could be a nice fit.

+ +

Why isn't there a separate boost mailing list for my favorite +library?  One of the reasons for boost's success has been the cross-pollination of ideas between diverse library +projects and the occasional look into other threads by otherwise uninterested parties. The more people participate, the less they tend to be annoyed by +"noise".

+ +

How can I cope with the large volume of boost mailing list messages?  +One approach is to use the "digest" option; that cuts the email blizzard +down to several (long) messages per day, so you can glance over the subjects +summary at the top and quickly read what you think is important. The  "no +mail" option turns off list email entirely.

+ +

Another approach is to follow the list traffic via an NTTP newsgroup reader. +See Mailing List newsgroup +information.

+ +

Why do Boost headers have a .hpp suffix rather than .h or none at all? +File extensions communicate the "type" of the file, both to humans and +to computer programs. The '.h' extension is used for C header files, and +therefore communicates the wrong thing about C++ header files. Using no +extension communicates nothing and forces inspection of file contents to +determine type. Using '.hpp' unambiguously identifies it as C++ header file, and +works well in actual practice. (Rainer Deyke)

+ +

What should I do if I spot a bug in the Boost code or documentation? +See the suggestions on the Bugs page.

+ +

How can I request a new feature in a Boost Library? See the +Requesting New Features page.

+ +
+ +

Revised 23 June, 2005

+ +

© 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/more/favicon.ico b/more/favicon.ico new file mode 100644 index 0000000000..e2b448618a Binary files /dev/null and b/more/favicon.ico differ diff --git a/more/feature_model_diagrams.htm b/more/feature_model_diagrams.htm new file mode 100644 index 0000000000..2ca017a933 --- /dev/null +++ b/more/feature_model_diagrams.htm @@ -0,0 +1,112 @@ + + + + + + + +Feature Model Diagrams + + + + +

Boost logo

+

Feature Model Diagrams in text and HTML

+

By Beman Dawes

+

Introduction

+

In their seminal book, Generative Programming, Czarnecki and Eisenecker (C&E)) +describe how to build feature models [C&E 4.4] consisting of a feature +diagram plus semantic, rationale, and other attributes.  Feature models are +then used to drive design cycles which eventually lead to manual or automatic +assembly of configurations.

+

Feature models provide a language to describe the library variability that is +often such an issue in boost.org discussions. The Whorf hypothesis that +"Language shapes the way we think, and determines what we can think +about" seems to apply.  In discussion of library variability issues, +we have been crippled by lack of a good language. With feature models we now +have a language to carry on the dialog.

+

The graphical feature diagrams presented by C&E are not in a suitable +form for the email discussions boost.org depends upon. The hierarchical nature +of feature diagrams can be represented by a simple text-based feature diagram +language.  A feature model can also take advantage of the hyperlinks +inherent in HTML.

+

Grammar

+

The grammar for the feature diagram language is expressed in Extended +Bakus-Naur Form; ::= represents productions, [...] represents options, {...} +represents zero or more instances, and represents | alternatives.

+
+ 
feature-model       ::= concept-name details { feature }
+ 
feature             ::= feature-name [details]
+ 
details             ::= "(" feature-list ")"      // required features
+                      | "[" feature-list "]"      // optional features
+ 
feature-list        ::= element { "|" element }   // one only
+                      | element { "+" element }   // one or more
+                      | element { "," element }   // all
+                                                  // [a+b] equivalent to [a,b]
+ 
element             ::= feature
+                      | details
+ 
concept-name        ::= name
+ 
feature-name        ::= name
+
+

The usual lexical conventions apply. Names are case-insensitive and consist +of a leading letter, followed by letters, digits, underscores or hyphens, with +no spaces allowed.

+

At least one instance of each name should be hyperlinked to the corresponding +Feature Description.

+

While the grammar is intended for written communication between people, it +may also be trivially machine parsed for use by automatic tools.

+

+

Descriptive information is associated with each concept or feature. According +to [C&E 4.4.2] this includes:

+
    +
  • Semantic descriptions.
    • +
  • Rationale.
    • +
  • Stakeholders and client programs.
    • +
  • Exemplar systems.
    • +
  • Constraints and default dependency rules.
    • +
  • Availability sites, binding sites, and binding mode.
    • +
  • Open/Closed attribute.
    • +
+

What is a Feature?

+

A feature [C&E 4.9.1] is "anything users or client programs might +want to control about a concept.  Thus, during feature modeling, we +document no only functional features ... but also implementation features, ..., +various optimizations, alternative implementation techniques, and so on."

+

Example

+
+ 
special-container ( organization,
+                    performance,
+                    interface  )         // all required
+ 
organization [ ordered + indexed ]       // zero or more (4 configurations)
+ 
indexed [ hash-function ]                // zero or one  (2 configurations)
+ 
performance ( fast | small | balanced )  // exactly one  (3 configurations)
+ 
interface ( STL-style + cursor-style )   // one or more  (3 configurations)
+
+

There should be feature descriptions for some-container, organization, +ordered, indexed, hash-function, performance, fast, small, balanced, interface, +STL-style, and cursor-style.

+

The number of possible configurations is  (2 + 2*2) * 3 * 3 = 54, +assuming no constraints.

+

There are equivalent representations. For example:

+
+ 
special-container ( organization[ ordered+indexed[ hash-function ]],
+                    performance( fast|small|balanced ),
+                    interface( STL-style+cursor-style ) )
+
+

References

+

Krzysztof Czarnecki and Ulrich W. Eisenecker, Generative +Programming, Addison-Wesley, 2000, ISBN 0-201-30977-7

+
+

Revised 26 August 2004

+

© 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/more/formal_review_process.htm b/more/formal_review_process.htm new file mode 100644 index 0000000000..2f4c161d3b --- /dev/null +++ b/more/formal_review_process.htm @@ -0,0 +1,321 @@ + + + + + + + + + + Boost Formal Review Process + + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

Boost Formal Review Process

+
+

Before Requesting a Formal Review

+

Read and follow the Boost submission process.  There are at + least four steps a library author must take before a formal review is + requested.

+
+ +

Introduction
+ What to include in Review Comments
+ Results
+ Notes for Review Managers
+ Notes for Library Submitters
+ Review Wizard
+ Fast Track Reviews

+ +

Introduction

+ +

Proposed libraries are accepted into Boost only after undergoing a + formal review, where Boost mailing list members comment on their evaluation + of the library.

+ +

The final "accept" or "reject" decision is made by the Review Manager, based on the review comments received + from boost mailing list members.

+ +

Boost mailing list members are encouraged to submit Formal Review + comments:

+ +
+
    +
  • Publicly on the mailing list.
    • + +
  • Privately to the Review Manager.
    • +
+
+ +

Private comments to a library submitter may be helpful to her or him, + but won't help the Review Manager reach a decision, so the other forms are + preferred.

+ +

What to include in Review Comments

+ +

Your comments may be brief or lengthy, but basically the Review Manager + 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:

+ +
    +
  • What is your evaluation of the design?
    • + +
  • What is your evaluation of the implementation?
    • + +
  • What is your evaluation of the documentation?
    • + +
  • What is your evaluation of the potential usefulness of the + library?
    • + +
  • Did you try to use the library?  With what compiler?  Did + you have any problems?
    • + +
  • How much effort did you put into your evaluation? A glance? A quick + reading? In-depth study?
    • + +
  • Are you knowledgeable about the problem domain?
    • +
+ +

And finally, every review should answer this question:

+ +
    +
  • Do you think the library should be accepted as a Boost library?  + Be sure to say this explicitly so that your other comments don't obscure + your overall opinion.
    • +
+ +

Results

+ +

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 + rejected.  A rationale is also helpful, but its extent is up to the + Review Manager. If there are suggestions, or conditions that must be met + before final inclusion, they should be stated.

+ +

Notes for Review + Managers

+ +

Before a library can be scheduled for formal review, an active boost + member not connected with the library submission must volunteer to be the + "Review Manager" for the library.

+ +

The Review Manager:

+ +
    +
  • Checks the submission to make sure it really is complete enough to + warrant formal review.  See the Boost + Library Requirements and Guidelines.  If necessary, work with + the submitter to verify the code compiles and runs correctly on several + compilers and platforms.
    • + +
  • Finalizes the schedule with the Review Wizard + and the submitter .
    • + +
  • Posts a notice of the review schedule on the regular boost mailing list, the + boost-users + mailing list, and the boost-announce mailing + list. + +
      +
    • The notice should include a brief description of the library and + what it does, to let readers know if the library is one they are + interested in reviewing.
      • + +
    • If the library is known to fail with certain compilers, please + mention them in the review notice so reviewers with those compilers + won't waste time diagnosing known problems.
      • +
    +
    • + +
  • Inspects the Boost library + catalogue for libraries which may interact with the new submission. + These potential interactions should be pointed out in the review + announcement, and the author(s) of these libraries should be privately + notified and urged to participate in the review.
    • + +
  • Urges people to do reviews if they aren't forthcoming.
    • + +
  • Follows review discussions regarding the library, moderating or + answering questions as needed.
    • + +
  • Asks the review wizard for permission to extend + the review schedule if it appears that too few reviews will be submitted + during the review period.
    • + +
  • Decides if there is consensus to accept the library, and if there are + any conditions attached.
    • + +
  • Posts a notice of the review results on the + regular boost mailing + list, the boost-users mailing list, + and the boost-announce mailing + list.
    • +
+ +

In other words, it is the Review Manager's responsibility to make sure + the review process works smoothly.

+ +

Notes for Library Submitters

+ +

See Submission Process for a + description of the steps a library developer goes through to get a library + accepted by Boost.

+ +

A proposed library should remain stable during the review period; it + will just confuse and irritate reviewers if there are numerous + changes.  It is, however, useful to upload fixes for serious bugs + right away, particularly those which prevent reviewers from fully + evaluating the library.  Post a notice of such fixes on the mailing + list.

+ +

Library improvements suggested by reviewers should normally be held + until after the completion of review period.  If the suggested changes + might affect reviewer's judgments, post a notice of the pending change + on the mailing list.

+ +

Review Wizard

+ +

The Review Wizard coordinates the formal review schedule:

+ +
    +
  • Maintains a list of review manager volunteers, in the form of a + queue, so that volunteers who least recently managed reviews become the + prime candidates for upcoming reviews.
    • + +
  • When a formal review is requested for a library:
    • + +
  •   + +
      +
    • Assign a review manager and suggests a schedule, after checking + (via private email) availability of the volunteers at the top of + review manager queue.
      • + +
    • Finalize the schedule, once the review manager verifies the + library is actually ready for review.
      • + +
    • Resolve schedule slips or other issues with review managers and + submitters.
      • +
    +
    • + +
  • Maintains a schedule of both past and pending reviews, in the form of + the Review Schedule web + page.
    • + +
  • Resolves questions from review managers and library submitters, who + sometimes want a third opinion on questions such as "Should we extend the + review period because ...?"
    • + +
  • Monitors the general review process, and makes minor adjustments as + needed, or queries the list about possible major adjustments.
    • +
The role of Boost Review Wizard is currently played by Tom Brinkman and Ronald Garcia (garcia at + cs dot indiana dot edu). + +

Fast Track Reviews

+ +

To qualify for fast track review:

+ +
    +
  • The component must be small.
    • + +
  • The technique must be already in use in Boost libraries and the new + component provides a common implementation.
    • + +
  • A full Boost-conformant implementation is available in the + sandbox.
    • + +
  • The Review Wizard determines that the proposal qualifies for fast + track review.
    • +
+ +

Procedure:

+ +
    +
  • The Boost Review Wizard posts a review announcement to the main Boost + developer's list. The review period will normally last for 5 days. No two + fast track reviews will run in parallel. Fast track reviews may run + during full reviews, though generally this is to be avoided.
    • + +
  • After the review period ends, the submitter will post a review + summary containing proposed changes to the reviewed implementation.
    • + +
  • The Review Wizard will accept or reject the proposed library and + proposed changes.
    • + +
  • After applying the proposed changes, the component is checked into + CVS like any other library.
    +  
    • +
+
+ +

Revised + 15 + 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)

+ + diff --git a/more/formal_review_schedule.html b/more/formal_review_schedule.html new file mode 100644 index 0000000000..219c4b5363 --- /dev/null +++ b/more/formal_review_schedule.html @@ -0,0 +1,649 @@ + + + + + + + + +Formal Review Schedule + + + + + + + + + + + + + +
+ boost.png (6897 bytes)Home + Libraries + PeopleFAQMore
+

Formal Review Schedule

+

Reviews are usually scheduled on a first-come-first-served basis, and +normally last ten days.  See Formal +Review Process for more information.

+

In addition to +upcoming reviews, the schedule includes recent reviews already completed; that helps +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.

+

Schedule

+ + + + + + + + + + + + + + + + + + + + + + + + + +
SubmissionSubmitterLinkReview
+ Manager		Review
+ Dates
Function Types (Re-review)Tobias SchwingerBoost Sandbox VaultTom Brinkman-
Message PassingDoug Gregor + + http://www.osl.iu.edu/~dgregor/boost.mpi/boost-mpi-20060628.tgzNeeded-
+

Past Review Results and Milestones

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
SubmissionSubmitterReview
+ Manager		Review
+ Dates		Result
Physical Quantities SystemAndy LittleFred Bertsch2006 May 31 - 2006 June 9 + Rejected
Pimpl PointerAsger MangaardRene Rivera2006 May 15 - 2006 May 24 + Pending
FusionJoel de GuzmanRonald Garcia2006 May 1 - 2006 May 10 + Accepted
Property TreeMarcin KalicinskiThorsten Ottosen2006 April 18 - 2006 April 30 + Accepted
Promotion Traits (fast-track)Alexander NasonovTobias Schwinger2006 April 1 - 2006 April 9 + Accepted
Review Wizard Status ReportTom Brinkman2006 March 30Report
ShmemIon GaztanagaFred Bertsch2006 February 6 - 2006 February 15 + Accepted
Fixed StringsReece DunnHarmut Kaiser2006 January 19 - 2006 February 5 + Rejected
Review Wizard Status ReportRonald Garcia2006 January 19Report
asioChristopher KohlhoffJeff Garland2005 December 10 -
2005 December 30		 + Accepted
Boost 1.33.1 ReleasedDoug Gregor2005 December 5 + Notes
Review Wizard Status ReportRonald Garcia2005 December 1 + Report
Logging LibraryJohn TorjoHartmut Kaiser2005 November 7 - 2005 November 16th + Rejected
Boost 1.33.1 Beta ReleasedDoug Gregor2005 November 9 + Notes
binary_intScott Schurr and Matt CalabresePavel Vozenilek2005 October 13 - 2005 October 20 + Accepted -- not yet added.
TR1John MaddockBeman Dawes2005 September 24 - 2005 October 5Accepted -- added to cvs
XpressiveEric NieblerThomas Witt 2005 September 8 - 2005 September 18Accepted -- Added to CVS
Boost 1.33.0 ReleasedDoug Gregor17 August 2005 + Notes
Function TypesTobias SchwingerJohn Maddock2005-Jun-6 to 2005-June-16 + Accepted Provisionally
TypeofArkadiy Vertleyb and Peder HoltAndy Little2005 May 20 - 2005 May 30Accepted -- Added to CVS
SingletonJason HisePavel Vozenilek2005 May 5 - 2005 May 15 + Rejected
FOREACH MacroEric NieblerGennadiy Rozental2005 April 25 - 2005 May 1Accepted -- Added to CVS
HashDaniel JamesThorsten Ottosen2005 Mar 21 - 2005 March 12Accepted -- Added in 1.33
State ChartAndreas HuberPavel Vozenilek2005 Feb 23 - 2005 March 9Accepted -- Added to CVS
WaveHartmut KaiserTom Brinkman2005 Feb 7 - 2005 Feb 20Accepted -- Added in 1.33
Pointer ContainersThorsten OttosenPavol Droba2004 Sept 26 - Oct 5Accepted -- Added in 1.33
Named ParamsDavid Abrahams & Daniel WallinDoug Gregor2004 Nov 1 - 2004 Nov 20Accepted -- Added in 1.33
Output FormattersReece DunnJohn Torjo2004 Sept 11 - Sept 25 + Rejected
IostreamsJonathan TurkanisJeff Garland2004 Aug 28 - Sep 11Accepted -- Added in 1.33
More IODaryle WalkerTom Brinkman2004 Aug 21 - 28Rejected
TriboolDouglas GregorThomas Witt2004 May 19-29Accepted -- Added in 1.32
AssignmentThorsten OttosenTom Brinkman2004 Apr 1 - 11Accepted -- Added in 1.32
Serialization (re-review)Robert RameyJeff Garland2004 Apr 13 - 26Accepted -- Added in 1.32
Container Traits (renamed boost.range)Thorsten OttosenHartmut Kaiser2004 Apr 28 - May 7Accepted -- Added in 1.32
Indexed SetJoaqu� M L�ez Mu�zPavel Vozenilek2004 Mar 20 - 30Accepted -- Added in 1.32
Circular BufferJan GasparPavel Vozenilek2004 Mar 5 - 15Accepted -- not added yet
enable_ifJaakko Järvi & Jeremiah Willcock & Andrew Lumsdaine(fasttrack)Dec 2003Accepted -- added in 1.31
FC++Brian McNamara & Yannis SmaragdakisMat Marcus2004 Feb 14 - Mar 1Rejected
Numeric Conversions LibraryFernando CacciolaThorsten Ottosen8 - 22 Dec 2003Accepted -- added in 1.32
String Algorithm LibraryPavol DrobaThorsten Ottosen17 - 30 Oct 2003Accepted -- added in 1.32
Shifted PointerPhilippe A. BouchardDoug Gregor24 - 30 Sep 2003Rejected
Fixed-Point DecimalBill SeymourJens Maurer11 - 21 Jul 2003Rejected
Math ConstantsPaul A. BristowJaap Suter06 - 15 Jun 2003Rejected
Command Line & ConfigVladimir PrusAleksey Gurtovoy21 May - 03 Jun 2003Accepted -- added in 1.32
I/O Manipulators and AdaptorsDaryle WalkerEd Brey27 Feb - 11 Mar 2003-
VariantEric Friedman & Itay MamanJeff Garland16 - 25 Feb 2003Accepted -- added in 1.31
OptionalFernando CacciolaDouglas Gregor09 - 18 Dec 2002Accepted -- added in 1.30
SerializationRobert RameyDave Abrahams02 - 11 Nov 2002Rejected
SpiritJoel de GuzmanJohn Maddock11 - 20 Oct 2002Accepted -- added in 1.30
MinmaxHervé BronnimannThomas Witt28 Sep - 07 Oct 2002Accepted -- added in 1.32
FilesystemBeman DawesWilliam Kempf14 - 23 Sep 2002Accepted -- added in 1.30
Interval Arithmetic LibraryHervé Bronnimann & Guillaume Melquiond & Sylvain PionBeman Dawes31 Aug - 09 Sep 2002Accepted -- added in 1.30
Template Meta Programming Library MPLAleksey GurtovoyDouglas Gregor15 - 29 Jul 2002Accepted -- added in 1.30
uBLASJoerg Walter & Mathias KochEd Brey21 Jun - 01 Jul 2002Accepted -- added in 1.29
Dynamic BitsetChuck Alison & Jeremy SiekMat Marcus08 - 17 Jun 2002Accepted -- added in 1.29
Date / TimeJeff GarlandDarin Adler15 - 24 Apr 2002Accepted -- added in 1.29
LambdaJaakko J�vi & Gary PowellAleksey Gurtovoy08 - 20 Mar 2002Accepted and added
SignalsDouglas GregorWilliam Kempf18 - 27 Feb 2002Accepted -- added in 1.29
I/O State SaverDaryle WalkerBeman Dawes06 - 16 Feb 2002Accepted and added
printf-like formatting for iostreamsSamuel KremppJens Maurer13 - 23 Jan 2002Accepted -- added in 1.29
Multi-arrayRon GarciaJohn Maddock02 - 12 Jan 2002Accepted -- added in 1.29
Unit Test LibraryGennadiy RozentalJeremy Siek01 - 13 Dec 2001Accepted and added
GCD Library plus integer additionsDaryle WalkerDave Abrahams17 - 26 Sep 2001-
Thread LibraryBill KempfEd BreyAug 30 - Sep 8Accepted and added
Config SystemJohn MaddockDoug GregorAug 20 - 29 Accepted and added
Bind LibraryPeter DimovDarin AdlerAug 10 - 19Accepted and added
Base from Member LibraryDaryle WalkerBeman DawesJul 30 - Aug 9-
Coding GuidelinesDave AbrahamsAleksey GurtovoyJul 20 - 29-
Preprocessor LibraryVesa KarvonenJeremy SiekJun 28 - Jul 9Accepted and added
Tuples LibraryJaakko J�viBeman DawesJun 17 - 26Accepted and added
Function LibraryDoug GregorJohn MaddockJun 6 - 16Accepted and added
TokenizerJohn BandelaDoug GregorMay 28 - Jun 6Accepted and added
Special FunctionsHubert HolinJens MaurerMay 18 - 27Accepted and added
+

Review Managers

+

We try to rotate the task of Review Manager between many experienced Boost +members, both to ensure fairness, and to spread the workload.  If you would +like to volunteer to become a review manager, please contact +Tom Brinkman (Review Wizard).

+
+

Revised +15 Apr 2005 +

+

Copyright Beman Dawes, Tom Brinkman, Jeff Garland 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/more/generic_exception_safety.html b/more/generic_exception_safety.html new file mode 100644 index 0000000000..1d03d9387a --- /dev/null +++ b/more/generic_exception_safety.html @@ -0,0 +1,683 @@ + + + + + Exception-Safety in Generic Components + + + +

Exception-Safety in Generic Components

+ +

Lessons Learned from Specifying Exception-Safety + for the C++ Standard Library + +

David Abrahams

+ +

+ david.abrahams@rcn.com

+ +

Abstract. This paper represents the knowledge accumulated in + response to a real-world need: that the C++ Standard Template Library + exhibit useful and well-defined interactions with exceptions, the + error-handling mechanism built-in to the core C++ language. It explores the + meaning of exception-safety, reveals surprising myths about exceptions and + genericity, describes valuable tools for reasoning about program + correctness, and outlines an automated testing procedure for verifying + exception-safety. + +

Keywords: exception-safety, exceptions, STL, C++ + +

1 What is exception-safety?

+ +

Informally, exception-safety in a component means that it exhibits + reasonable behavior when an exception is thrown during its execution. For + most people, the term ``reasonable'' includes all the usual + expectations for error-handling: that resources should not be leaked, and + that the program should remain in a well-defined state so that execution + can continue. For most components, it also includes the expectation that + when an error is encountered, it is reported to the caller. + +

More formally, we can describe a component as minimally exception-safe + if, when exceptions are thrown from within that component, its invariants + are intact. Later on we'll see that at least three different levels of + exception-safety can be usefully distinguished. These distinctions can help + us to describe and reason about the behavior of large systems. + +

In a generic component, we usually have an additional expectation of + exception-neutrality, which means that exceptions thrown by a + component's type parameters should be propagated, unchanged, to the + component's caller. + +

2 Myths and Superstitions

+ +

Exception-safety seems straightforward so far: it doesn't constitute + anything more than we'd expect from code using more traditional + error-handling techniques. It might be worthwhile, however, to examine the + term from a psychological viewpoint. Nobody ever spoke of + ``error-safety'' before C++ had exceptions. + +

It's almost as though exceptions are viewed as a mysterious + attack on otherwise correct code, from which we must protect ourselves. + Needless to say, this doesn't lead to a healthy relationship with error + handling! During standardization, a democratic process which requires broad + support for changes, I encountered many widely-held superstitions. In order + to even begin the discussion of exception-safety in generic components, it + may be worthwhile confronting a few of them. + +

``Interactions between templates and exceptions are not + well-understood.'' This myth, often heard from those who consider + these both new language features, is easily disposed of: there simply are + no interactions. A template, once instantiated, works in all respects like + an ordinary class or function. A simple way to reason about the behavior of + a template with exceptions is to think of how a specific instantiation of + that template works. Finally, the genericity of templates should not cause + special concern. Although the component's client supplies part of the + operation (which may, unless otherwise specified, throw arbitrary + exceptions), the same is true of operations using familiar virtual + functions or simple function pointers. + +

``It is well known to be impossible to write an exception-safe + generic container.'' This claim is often heard with reference to + an article by Tom Cargill [4] + in which he explores the problem of exception-safety for a generic stack + template. In his article, Cargill raises many useful questions, but + unfortunately fails to present a solution to his problem.1 + He concludes by suggesting that a solution may not be possible. + Unfortunately, his article was read by many as ``proof'' of that + speculation. Since it was published there have been many examples of + exception-safe generic components, among them the C++ standard library + containers. + +

``Dealing with exceptions will slow code down, and templates are + used specifically to get the best possible performance.'' A good + implementation of C++ will not devote a single instruction cycle to dealing + with exceptions until one is thrown, and then it can be handled at a speed + comparable with that of calling a function [7]. + That alone gives programs using exceptions performance equivalent to that + of a program which ignores the possibility of errors. Using exceptions can + actually result in faster programs than ``traditional'' error + handling methods for other reasons. First, a catch block clearly indicates + to the compiler which code is devoted to error-handling; it can then be + separated from the usual execution path, improving locality of reference. + Second, code using ``traditional'' error handling must typically + test a return value for errors after every single function call; using + exceptions completely eliminates that overhead. + +

``Exceptions make it more difficult to reason about a program's + behavior.'' Usually cited in support of this myth is the way + ``hidden'' execution paths are followed during stack-unwinding. + Hidden execution paths are nothing new to any C++ programmer who expects + local variables to be destroyed upon returning from a function: + +

+
ErrorCode f( int& result )         // 1 
+{                                  // 2 
+    X x;                           // 3 
+    ErrorCode err = x.g( result ); // 4 
+    if ( err != kNoError )         // 5 
+        return err;                // 6 
+    // ...More code here... 
+    return kNoError;               // 7 
+}
+
+
+ +

In the example above, there is a ``hidden'' call to + X::~X() in lines 6 and 7. Granted, using exceptions, there is + no code devoted to error handling visible: + +

+
int f()                 // 1 
+{                       // 2 
+    X x;                // 3 
+    int result = x.g(); // 4 
+    // ...More code here... 
+    return result;      // 5 
+} 
+
+
+ +

For many programmers more familiar with exceptions, the second example + is actually more readable and understandable than the first. The + ``hidden'' code paths include the same calls to destructors of + local variables. In addition, they follow a simple pattern which acts + exactly as though there were a potential return statement after each + function call in case of an exception. Readability is enhanced because the + normal path of execution is unobscured by error-handling, and return values + are freed up to be used in a natural way. + +

There is an even more important way in which exceptions can enhance + correctness: by allowing simple class invariants. In the first example, if + x's constructor should need to allocate resources, it has no + way to report a failure: in C++, constructors have no return values. The + usual result when exceptions are avoided is that classes requiring + resources must include a separate initializer function which finishes the + job of construction. The programmer can therefore never be sure, when an + object of class X is used, whether he is handling a + full-fledged X or some abortive attempt to construct one (or + worse: someone simply forgot to call the initializer!) + +

3 A contractual basis for exception-safety

+ +

A non-generic component can be described as exception-safe in isolation, + but because of its configurability by client code, exception-safety in a + generic component usually depends on a contract between the component and + its clients. For example, the designer of a generic component might require + that an operation which is used in the component's destructor not throw any + exceptions.2 + The generic component might, in return, provide one of the following + guarantees: + +

    +
  • The basic guarantee: that the invariants of the component are + preserved, and no resources are leaked. + +
  • The strong guarantee: that the operation has either completed + successfully or thrown an exception, leaving the program state exactly as + it was before the operation started. + +
  • The no-throw guarantee: that the operation will not throw an + exception. +
+ +

The basic guarantee is a simple minimum standard for exception-safety to + which we can hold all components. It says simply that after an exception, + the component can still be used as before. Importantly, the preservation of + invariants allows the component to be destroyed, potentially as part of + stack-unwinding. This guarantee is actually less useful than it might at + first appear. If a component has many valid states, after an exception we + have no idea what state the component is in|only that the state is valid. + The options for recovery in this case are limited: either destruction or + resetting the component to some known state before further use. Consider + the following example: + +

+
template <class X> 
+void print_random_sequence() 
+{ 
+    std::vector<X> v(10); // A vector of 10 items 
+    try { 
+        // Provides only the basic guarantee 
+        v.insert( v.begin(), X() ); 
+    } 
+    catch(...) {} // ignore any exceptions above 
+    // print the vector's contents 
+    std::cout "(" << v.size() << ") "; 
+    std::copy( v.begin(), v.end(), 
+    std::ostream_iterator<X>( std::cout, " " ) ); 
+} 
+
+
+ +

Since all we know about v after an exception is that it is valid, the + function is allowed to print any random sequence of Xs.3 + It is ``safe'' in the sense that it is not allowed to crash, but + its output may be unpredictable. + +

The strong guarantee provides full + ``commit-or-rollback'' semantics. In the case of C++ standard + containers, this means, for example, that if an exception is thrown all + iterators remain valid. We also know that the container has exactly the + same elements as before the exception was thrown. A transaction that has no + effects if it fails has obvious benefits: the program state is simple and + predictable in case of an exception. In the C++ standard library, nearly + all of the operations on the node-based containers list, set, multiset, + map, and multimap provide the strong guarantee.4). + +

The no-throw guarantee is the strongest of all, and it says that + an operation is guaranteed not to throw an exception: it always completes + successfully. This guarantee is necessary for most destructors, and indeed + the destructors of C++ standard library components are all guaranteed not + to throw exceptions. The no-throw guarantee turns out to be + important for other reasons, as we shall see.5 + +

4 Legal Wrangling

+ +

Inevitably, the contract can get more complicated: a quid pro quo + arrangement is possible. Some components in the C++ Standard Library give + one guarantee for arbitrary type parameters, but give a stronger guarantee + in exchange for additional promises from the client type that no exceptions + will be thrown. For example, the standard container operation + vector<T>::erase gives the basic guarantee for + any T, but for types whose copy constructor and copy + assignment operator do not throw, it gives the no-throw guarantee.6 + +

5 What level of exception-safety should a component specify?

+ +

From a client's point-of-view, the strongest possible level of safety + would be ideal. Of course, the no-throw guarantee is simply + impossible for many operations, but what about the strong guarantee? + For example, suppose we wanted atomic behavior for + vector<T>::insert. Insertion into the middle of a vector + requires copying elements after the insertion point into later positions, + to make room for the new element. If copying an element can fail, rolling + back the operation would require ``undoing'' the previous + copies...which depends on copying again. If copying back should fail (as it + likely would), we have failed to meet our guarantee. + +

One possible alternative would be to redefine insert to + build the new array contents in a fresh piece of memory each time, and only + destroy the old contents when that has succeeded. Unfortunately, there is a + non-trivial cost if this approach is followed: insertions near the end of a + vector which might have previously caused only a few copies would now cause + every element to be copied. The basic guarantee is a + ``natural'' level of safety for this operation, which it can + provide without violating its performance guarantees. In fact all of the + operations in the library appear to have such a ``natural'' level + of safety. + +

Because performance requirements were already a well-established part of + the draft standard and because performance is a primary goal of the STL, + there was no attempt to specify more safety than could be provided within + those requirements. Although not all of the library gives the strong + guarantee, almost any operation on a standard container which gives the + basic guarantee can be made strong using the ``make a + new copy'' strategy described above: + +

+
template <class Container, class BasicOp> 
+void MakeOperationStrong( Container& c, const BasicOp& op ) 
+{ 
+    Container tmp(c); // Copy c 
+    op(tmp); // Work on the copy 
+    c.swap(tmp); // Cannot fail7
+}
+
+
+ +

This technique can be folded into a wrapper class to make a similar + container which provides stronger guarantees (and different performance + characteristics).8 + +

6 Should we take everything we can get?

+ +

By considering a particular implementation, we can hope to discern a + natural level of safety. The danger in using this to establish requirements + for a component is that the implementation might be restricted. If someone + should come up with a more-efficient implementation which we'd like to use, + we may find that it's incompatible with our exception-safety requirements. + One might expect this to be of no concern in the well-explored domains of + data structures and algorithms covered by the STL, but even there, advances + are being made. A good example is the recent introsort algorithm [6], + which represents a substantial improvement in worst-case complexity over + the well-established quicksort. + +

To determine exactly how much to demand of the standard components, I + looked at a typical real-world scenario. The chosen test case was a + ``composite container.'' Such a container, built of two or more + standard container components, is not only commonly needed, but serves as a + simple representative case for maintaining invariants in larger systems: + +

+
// SearchableStack - A stack which can be efficiently searched 
+// for any value. 
+template <class T> 
+class SearchableStack 
+{ 
+ public: 
+    void push(const T& t); // O(log n) 
+    void pop(); // O(log n) 
+    bool contains(const T& t) const; // O(log n) 
+    const T& top() const; // O(1) 
+ private: 
+    std::set<T> set_impl; 
+    std::list<std::set<T>::iterator> list_impl; 
+}; 
+
+
+ +

The idea is that the list acts as a stack of set iterators: every + element goes into the set first, and the resulting position is pushed onto + the list. The invariant is straightforward: the set and the list should + always have the same number of elements, and every element of the set + should be referenced by an element of the list. The following + implementation of the push function is designed to give the strong + guarantee within the natural levels of safety provided by set and list: + +

+
template <class T>                                // 1 
+void SearchableStack<T>::push(const T& t)         // 2 
+{                                                       // 3 
+    set<T>::iterator i = set_impl.insert(t);      // 4 
+    try                                                 // 5 
+    {                                                   // 6 
+        list_impl.push_back(i);                         // 7 
+    }                                                   // 8 
+    catch(...)                                          // 9 
+    {                                                   // 10 
+        set_impl.erase(i);                              // 11 
+        throw;                                          // 12 
+    }                                                   // 13 
+}                                                       // 14 
+
+
+ +

What does our code actually require of the library? We need to examine + the lines where non-const operations occur: + +

    +
  • Line 4: if the insertion fails but set_impl is modified + in the process, our invariant is violated. We need to be able to rely on + the strong guarantee from set<T>::insert. + +
  • Line 7: likewise, if push_back fails, but + list_impl is modified in the process, our invariant is + violated, so we need to be able to rely on the strong guarantee + from list<T>::insert. + +
  • Line 11: here we are ``rolling back'' the insertion on line + 4. If this operation should fail, we will be unable to restore our + invariant. We absolutely depend on the no-throw guarantee from + set<T>::erase.9 + +
  • Line 11: for the same reasons, we also depend on being able to pass + the i to the erase function: we need the + no-throw guarantee from the copy constructor of + set<T>::iterator. +
+ +

I learned a great deal by approaching the question this way during + standardization. First, the guarantee specified for the composite container + actually depends on stronger guarantees from its components (the + no-throw guarantees in line 11). Also, I took advantage of all of + the natural level of safety to implement this simple example. Finally, the + analysis revealed a requirement on iterators which I had previously + overlooked when operations were considered on their own. The conclusion was + that we should provide as much of the natural level of safety as possible. + Faster but less-safe implementations could always be provided as extensions + to the standard components. 10 + +

7 Automated testing for exception-safety

+ +

As part of the standardization process, I produced an exception-safe + reference implementation of the STL. Error-handling code is seldom + rigorously tested in real life, in part because it is difficult to cause + error conditions to occur. It is very common to see error-handling code + which crashes the first time it is executed ...in a shipping product! To + bolster confidence that the implementation actually worked as advertised, I + designed an automated test suite, based on an exhaustive technique due to + my colleague Matt Arnold. + +

The test program started with the basics: reinforcement and + instrumentation, especially of the global operators new and + delete.11Instances of the components (containers and + algorithms) were created, with type parameters chosen to reveal as many + potential problems as possible. For example, all type parameters were given + a pointer to heap-allocated memory, so that leaking a contained object + would be detected as a memory leak. + +

Finally, a scheme was designed that could cause an operation to throw an + exception at each possible point of failure. At the beginning of every + client-supplied operation which is allowed to throw an exception, a call to + ThisCanThrow was added. A call to ThisCanThrow + also had to be added everywhere that the generic operation being tested + might throw an exception, for example in the global operator + new, for which an instrumented replacement was supplied. + +

+
// Use this as a type parameter, e.g. vector<TestClass> 
+struct TestClass 
+{ 
+    TestClass( int v = 0 ) 
+        : p( ThisCanThrow(), new int( v ) ) {} 
+    TestClass( const TestClass& rhs ) 
+        : p( ThisCanThrow(), new int( *rhs.p ) ) {} 
+    const TestClass& operator=( const TestClass& rhs ) 
+        { ThisCanThrow(); *p = *rhs.p; } 
+    bool operator==( const TestClass& rhs ) const
+        { ThisCanThrow(); return *p == *rhs.p; } 
+    ...etc... 
+    ~TestClass() { delete p; } 
+};
+
+
+ +

ThisCanThrow simply decrements a ``throw + counter'' and, if it has reached zero, throws an exception. Each test + takes a form which begins the counter at successively higher values in an + outer loop and repeatedly attempts to complete the operation being tested. + The result is that the operation throws an exception at each successive + step along its execution path that can possibly fail. For example, here is + a simplified version of the function used to test the strong + guarantee: 12 + +

+
extern int gThrowCounter; // The throw counter
+void ThisCanThrow() 
+{ 
+    if (gThrowCounter-- == 0) 
+        throw 0; 
+} 
+ 
+template <class Value, class Operation> 
+void StrongCheck(const Value& v, const Operation& op) 
+{ 
+    bool succeeded = false; 
+    for (long nextThrowCount = 0; !succeeded; ++nextThrowCount) 
+    { 
+        Value duplicate = v; 
+        try 
+        { 
+            gThrowCounter = nextThrowCount; 
+            op( duplicate ); // Try the operation 
+            succeeded = true; 
+        } 
+        catch(...) // Catch all exceptions 
+        { 
+            bool unchanged = duplicate == v; // Test strong guarantee 
+            assert( unchanged ); 
+        } 
+        // Specialize as desired for each container type, to check 
+        // integrity. For example, size() == distance(begin(),end()) 
+        CheckInvariant(v); // Check any invariant 
+    } 
+}
+
+
+ +

Notably, this kind of testing is much easier and less intrusive with a + generic component than with non-generics, because testing-specific type + parameters can be used without modifying the source code of the component + being tested. Also, generic functions like StrongCheck above + were instrumental in performing the tests on a wide range of values and + operations. + +

8 Further Reading

+ To my knowledge, there are currently only two descriptions of STL + exception-safety available. The original specification [2] + for the reference exception-safe implementation of the STL is an informal + specification, simple and self-explanatory (also verbose), and uses the + basic- and strong-guarantee distinctions outlined in this + article. It explicitly forbids leaks, and differs substantively from the + final C++ standard in the guarantees it makes, though they are largely + identical. I hope to produce an updated version of this document soon. + +

The description of exception-safety in the C++ Standard [1] + is only slightly more formal, but relies on hard-to-read + ``standardese'' and an occasionally subtle web of implication.13 + In particular, leaks are not treated directly at all. It does have the + advantage that it is the standard. + +

The original reference implementation [5] + of the exception-safe STL is an adaptation of an old version of the SGI + STL, designed for C++ compilers with limited features. Although it is not a + complete STL implementation, the code may be easier to read, and it + illustrates a useful base-class technique for eliminating + exception-handling code in constructors. The full test suite [3] + used to validate the reference implementation has been used successfully to + validate all recent versions of the SGI STL, and has been adapted to test + one other vendor's implementation (which failed). As noted on the + documentation page, it also seems to have the power to reveal hidden + compiler bugs, particularly where optimizers interact with + exception-handling code. + +

References

+ +
    +
  1. International Standard ISO/IEC 14882, + Information Technology-Programming Languages-C++, Document Number + ISO/IEC 14882-1998, available from http://webstore.ansi.org/ansidocstore/default.asp. + +
  2. D. Abrahams, Exception Safety in + STLport, available at http://www.stlport.org/doc/exception_safety.html. + +
  3. D. Abrahams and B. Fomitchev, Exception + Handling Test Suite, available at http://www.stlport.org/doc/eh_testsuite.html. + +
  4. Tom Cargill, ``Exception Handling: + A False Sense of Security,'' C++ Report, Nov-Dec 1994, also + available at http://www.awprofessional.com/content/images/020163371x/supplements/Exception_Handling_Article.html. + +
  5. B. Fomitchev, Adapted SGI STL Version + 1.0, with exception handling code by D. Abrahams, available at http://www.stlport.org. + +
  6. D. R. Musser, ``Introspective Sorting + and Selection Algorithms,'' Software-Practice and Experience + 27(8):983-993, 1997. + +
  7. Bjarne Stroustrup, The Design And + Evolution of C++. Addison Wesley, Reading, MA, 1995, ISBN + 0-201-54330-3, Section 16.9.1. +
+ +

Footnotes

+ +

1 Probably the greatest impediment to a solution + in Cargill's case was an unfortunate combination of choices on his part: + the interface he chose for his container was incompatible with his + particular demands for safety. By changing either one he might have solved + the problem. + +

2 It is usually inadvisable to throw an + exception from a destructor in C++, since the destructor may itself be + called during the stack-unwinding caused by another exception. If the + second exception is allowed to propagate beyond the destructor, the program + is immediately terminated. + +

3 In practice of course, this function would + make an extremely poor random sequence generator! + +

4 It is worth noting that mutating algorithms + usually cannot provide the strong guarantee: to roll back a modified + element of a range, it must be set back to its previous value using + operator=, which itself might throw. In the C++ standard + library, there are a few exceptions to this rule, whose rollback behavior + consists only of destruction: uninitialized_copy, + uninitialized_fill, and uninitialized_fill_n. + +

5 All type parameters supplied by clients of the + C++ standard library are required not to throw from their destructors. In + return, all components of the C++ standard library provide at least the + basic guarantee. + +

6 Similar arrangements might have been made in + the C++ standard for many of the mutating algorithms, but were never + considered due to time constraints on the standardization process. + +

7 Associative containers whose + Compare object might throw an exception when copied cannot use + this technique, since the swap function might fail. + +

8 This suggests another potential use for the + oft-wished-for but as yet unseen container_traits<> + template: automated container selection to meet exception-safety + constraints. + +

9 One might be tempted to surround the erase + operation with a try/catch block to reduce the + requirements on set<T> and the problems that arise in + case of an exception, but in the end that just begs the question. First, + erase just failed and in this case there are no viable alternative ways to + produce the necessary result. Second and more generally, because of the + variability of its type parameters a generic component can seldom be + assured that any alternatives will succeed. + +

10 The prevalent philosophy in the design of + STL was that functionality that wasn't essential to all uses should be left + out in favor of efficiency, as long as that functionality could be obtained + when needed by adapting the base components. This departs from that + philosophy, but it would be difficult or impossible to obtain even the + basic guarantee by adapting a base component that doesn't already + have it. + +

11 An excellent discussion on how to fortify + memory subsystems can be found in: Steve Maguire, Writing Solid Code, + Microsoft Press, Redmond, WA, 1993, ISBN 1-55615- 551-4. + +

12 Note that this technique requires that the + operation being tested be exception-neutral. If the operation ever tries to + recover from an exception and proceed, the throw counter will be negative, + and subsequent operations that might fail will not be tested for + exception-safety. + +

13 The changes to the draft standard which + introduced exception-safety were made late in the process, when amendments + were likely to be rejected solely on the basis of the number of altered + words. Unfortunately, the result compromises clarity somewhat in favor of + brevity. Greg Colvin was responsible for the clever language-lawyering + needed to minimize the extent of these changes. diff --git a/more/generic_programming.html b/more/generic_programming.html new file mode 100644 index 0000000000..23a12413e0 --- /dev/null +++ b/more/generic_programming.html @@ -0,0 +1,474 @@ + + + + + + + + + + Generic Programming Techniques + + + + boost.png (6897 bytes) + +

Generic Programming Techniques

+ +

This is an incomplete survey of some of the generic programming + techniques used in the boost libraries.

+ +

Table of Contents

+ + + +

Introduction

+ +

Generic programming is about generalizing software components so that + they can be easily reused in a wide variety of situations. In C++, class + and function templates are particularly effective mechanisms for generic + programming because they make the generalization possible without + sacrificing efficiency.

+ +

As a simple example of generic programming, we will look at how one + might generalize the memcpy() function of the C standard + library. An implementation of memcpy() might look like the + following:
+
+

+ +
+
+void* memcpy(void* region1, const void* region2, size_t n)
+{
+  const char* first = (const char*)region2;
+  const char* last = ((const char*)region2) + n;
+  char* result = (char*)region1;
+  while (first != last)
+    *result++ = *first++;
+  return result;
+}
+
+
+ The memcpy() function is already generalized to some extent by + the use of void* so that the function can be used to copy arrays + of different kinds of data. But what if the data we would like to copy is + not in an array? Perhaps it is in a linked list. Can we generalize the + notion of copy to any sequence of elements? Looking at the body of + memcpy(), the function's minimal requirements are + that it needs to traverse through the sequence using some sort + of pointer, access elements pointed to, write the elements + to the destination, and compare pointers to know when to stop. The + C++ standard library groups requirements such as these into + concepts, in this case the Input Iterator + concept (for region2) and the Output Iterator + concept (for region1). + +

If we rewrite the memcpy() as a function template, and use + the Input + Iterator and Output Iterator + concepts to describe the requirements on the template parameters, we can + implement a highly reusable copy() function in the following + way:
+
+

+ +
+
+template <typename InputIterator, typename OutputIterator>
+OutputIterator
+copy(InputIterator first, InputIterator last, OutputIterator result)
+{
+  while (first != last)
+    *result++ = *first++;
+  return result;
+}
+
+
+ +

Using the generic copy() function, we can now copy elements + from any kind of sequence, including a linked list that exports iterators + such as std::list.
+
+

+ +
+
+#include <list>
+#include <vector>
+#include <iostream>
+
+int main()
+{
+  const int N = 3;
+  std::vector<int> region1(N);
+  std::list<int> region2;
+
+  region2.push_back(1);
+  region2.push_back(0);
+  region2.push_back(3);
+  
+  std::copy(region2.begin(), region2.end(), region1.begin());
+
+  for (int i = 0; i < N; ++i)
+    std::cout << region1[i] << " ";
+  std::cout << std::endl;
+}
+
+
+ +

Anatomy of a Concept

+ A concept is a set of requirements + consisting of valid expressions, associated types, invariants, and + complexity guarantees. A type that satisfies the requirements is + said to model the concept. A concept can extend the + requirements of another concept, which is called + refinement. + +
    +
  • Valid Expressions are C++ + expressions which must compile successfully for the objects involved in + the expression to be considered models of the concept.
    • + +
  • Associated Types are types + that are related to the modeling type in that they participate in one + or more of the valid expressions. Typically associated types can be + accessed either through typedefs nested within a class definition for + the modeling type, or they are accessed through a traits class.
    • + +
  • Invariants are run-time characteristics of the objects that + must always be true, that is, the functions involving the objects must + preserve these characteristics. The invariants often take the form of + pre-conditions and post-conditions.
    • + +
  • Complexity Guarantees are maximum limits on how long the + execution of one of the valid expressions will take, or how much of + various resources its computation will use.
    • +
+ +

The concepts used in the C++ Standard Library are documented at the SGI STL + site.

+ +

Traits

+ +

A traits class provides a way of associating information with a + compile-time entity (a type, integral constant, or address). For example, + the class template std::iterator_traits<T> + looks something like this:

+ +
+
+template <class Iterator>
+struct iterator_traits {
+  typedef ... iterator_category;
+  typedef ... value_type;
+  typedef ... difference_type;
+  typedef ... pointer;
+  typedef ... reference;
+};
+
+
+ The traits' value_type gives generic code the type which the + iterator is "pointing at", while the iterator_category can be + used to select more efficient algorithms depending on the iterator's + capabilities. + +

A key feature of traits templates is that they're + non-intrusive: they allow us to associate information with + arbitrary types, including built-in types and types defined in + third-party libraries, Normally, traits are specified for a particular + type by (partially) specializing the traits template.

+ +

For an in-depth description of std::iterator_traits, see this page + provided by SGI. Another very different expression of the traits idiom in + the standard is std::numeric_limits<T> which provides + constants describing the range and capabilities of numeric types.

+ +

Tag Dispatching

+ +

Tag dispatching is a way of using function overloading to + dispatch based on properties of a type, and is often used hand in + hand with traits classes. A good example of this synergy is the + implementation of the std::advance() + function in the C++ Standard Library, which increments an iterator + n times. Depending on the kind of iterator, there are different + optimizations that can be applied in the implementation. If the iterator + is random + access (can jump forward and backward arbitrary distances), then the + advance() function can simply be implemented with i += + n, and is very efficient: constant time. Other iterators must be + advanced in steps, making the operation linear in n. If the + iterator is bidirectional, + then it makes sense for n to be negative, so we must decide + whether to increment or decrement the iterator.

+ +

The relation between tag dispatching and traits classes is that the + property used for dispatching (in this case the + iterator_category) is often accessed through a traits class. The + main advance() function uses the iterator_traits + class to get the iterator_category. It then makes a call the the + overloaded advance_dispatch() function. The appropriate + advance_dispatch() is selected by the compiler based on whatever + type the iterator_category resolves to, either input_iterator_tag, + bidirectional_iterator_tag, + or random_access_iterator_tag. + A tag is simply a class whose only purpose is to convey + some property for use in tag dispatching and similar techniques. Refer to + this page + for a more detailed description of iterator tags.

+ +
+
+namespace std {
+  struct input_iterator_tag { };
+  struct bidirectional_iterator_tag { };
+  struct random_access_iterator_tag { };
+
+  namespace detail {
+    template <class InputIterator, class Distance>
+    void advance_dispatch(InputIterator& i, Distance n, input_iterator_tag) {
+      while (n--) ++i;
+    }
+
+    template <class BidirectionalIterator, class Distance>
+    void advance_dispatch(BidirectionalIterator& i, Distance n, 
+       bidirectional_iterator_tag) {
+      if (n >= 0)
+        while (n--) ++i;
+      else
+        while (n++) --i;
+    }
+
+    template <class RandomAccessIterator, class Distance>
+    void advance_dispatch(RandomAccessIterator& i, Distance n, 
+       random_access_iterator_tag) {
+      i += n;
+    }
+  }
+
+  template <class InputIterator, class Distance>
+  void advance(InputIterator& i, Distance n) {
+    typename iterator_traits<InputIterator>::iterator_category category;
+    detail::advance_dispatch(i, n, category);
+  }
+}
+
+
+ +

Adaptors

+ +

An adaptor is a class template which builds on another type or + types to provide a new interface or behavioral variant. Examples of + standard adaptors are std::reverse_iterator, + which adapts an iterator type by reversing its motion upon + increment/decrement, and std::stack, which adapts a + container to provide a simple stack interface.

+ +

A more comprehensive review of the adaptors in the standard can be + found + here.

+ +

Type Generators

+ +

Note: The type generator concept has largely been + superseded by the more refined notion of a metafunction. See + C++ Template + Metaprogramming for an in-depth discussion of metafunctions.

+ +

A type generator is a template whose only purpose is to + synthesize a new type or types based on its template argument(s)[1]. The generated type is usually expressed as a nested typedef + named, appropriately type. A type generator is usually used to + consolidate a complicated type expression into a simple one. This example + uses an old version of iterator_adaptor + whose design didn't allow derived iterator types. As a result, every + adapted iterator had to be a specialization of iterator_adaptor + itself and generators were a convenient way to produce those types.

+ +
+
+template <class Predicate, class Iterator, 
+    class Value = complicated default,
+    class Reference = complicated default,
+    class Pointer = complicated default,
+    class Category = complicated default,
+    class Distance = complicated default
+         >
+struct filter_iterator_generator {
+    typedef iterator_adaptor<
+        
+        Iterator,filter_iterator_policies<Predicate,Iterator>,
+        Value,Reference,Pointer,Category,Distance> type;
+};
+
+
+ +

Now, that's complicated, but producing an adapted filter iterator + using the generator is much easier. You can usually just write:

+ +
+
+boost::filter_iterator_generator<my_predicate,my_base_iterator>::type
+
+
+ +

Object Generators

+ +

An object generator is a function template whose only purpose + is to construct a new object out of its arguments. Think of it as a kind + of generic constructor. An object generator may be more useful than a + plain constructor when the exact type to be generated is difficult or + impossible to express and the result of the generator can be passed + directly to a function rather than stored in a variable. Most Boost + object generators are named with the prefix "make_", after + std::make_pair(const T&, const U&).

+ +

For example, given:

+ +
+
+struct widget {
+  void tweak(int);
+};
+std::vector<widget *> widget_ptrs;
+
+
+ By chaining two standard object generators, std::bind2nd() + and std::mem_fun(), + we can easily tweak all widgets: + +
+
+void tweak_all_widgets1(int arg)
+{
+   for_each(widget_ptrs.begin(), widget_ptrs.end(),
+      bind2nd(std::mem_fun(&widget::tweak), arg));
+}
+
+
+ +

Without using object generators the example above would look like + this:

+ +
+
+void tweak_all_widgets2(int arg)
+{
+   for_each(struct_ptrs.begin(), struct_ptrs.end(),
+      std::binder2nd<std::mem_fun1_t<void, widget, int> >(
+          std::mem_fun1_t<void, widget, int>(&widget::tweak), arg));
+}
+
+
+ +

As expressions get more complicated the need to reduce the verbosity + of type specification gets more compelling.

+ +

Policy Classes

+ +

A policy class is a template parameter used to transmit behavior. An + example from the standard library is std::allocator, + which supplies memory management behaviors to standard containers.

+ +

Policy classes have been explored in detail by Andrei Alexandrescu in this chapter + of his book, Modern C++ Design. He writes:

+ +
+

In brief, policy-based class design fosters assembling a class with + complex behavior out of many little classes (called policies), each of + which takes care of only one behavioral or structural aspect. As the + name suggests, a policy establishes an interface pertaining to a + specific issue. You can implement policies in various ways as long as + you respect the policy interface.

+ +

Because you can mix and match policies, you can achieve a + combinatorial set of behaviors by using a small core of elementary + components.

+
+ +

Andrei's description of policy classes suggests that their power is + derived from granularity and orthogonality. Less-granular policy + interfaces have been shown to work well in practice, though. + This paper describes an old version of iterator_adaptor + that used non-orthogonal policies. There is also precedent in the + standard library: std::char_traits, + despite its name, acts as a policies class that determines the behaviors + of std::basic_string.

+ +

Notes

+ [1] Type generators are sometimes viewed as a workaround + for the lack of ``templated typedefs'' in C++. +
+ +

Revised + 18 + August 2004 +

+ +

© Copyright David Abrahams 2001. Permission to copy, use, modify, + sell and distribute this document is granted provided this copyright + notice appears in all copies. This document is provided "as is" without + express or implied warranty, and with no claim as to its suitability for + any purpose. + + + + + + +

+ + + diff --git a/more/getting_started.html b/more/getting_started.html new file mode 100644 index 0000000000..62d669e763 --- /dev/null +++ b/more/getting_started.html @@ -0,0 +1,12 @@ + + + + + +Automatically loading index page... if nothing happens, please go to +getting_started/index.html. + + + + + diff --git a/more/getting_started.rst b/more/getting_started.rst new file mode 100644 index 0000000000..131d7ee1ad --- /dev/null +++ b/more/getting_started.rst @@ -0,0 +1,1004 @@ +============================ + |(logo)|__ Getting Started +============================ + +.. |(logo)| image:: ../boost.png + :alt: Boost + :class: boost-logo + +__ ../index.htm + + +.. section-numbering:: + :depth: 2 + +.. contents:: Contents + :depth: 2 + :class: sidebar small + +.. ## Update this substitution for each release + +.. |boost_ver| replace:: ``boost_1_34_0`` +.. |boost_ver-bold| replace:: **boost_1_34_0** + +.. |root| replace:: ``/``\ *path*\ ``/``\ *to*\ ``/``\ |boost_ver| +.. |winroot| replace:: *path*\ ``\``\ *to*\ ``\``\ |boost_ver| +.. |winroot-default| replace:: ``C:\Program``\ `` ``\ ``Files\boost\``\ |boost_ver| +.. |bold-winroot-default| replace:: **C:\\Program Files\\boost\\**\ |boost_ver-bold| + +Introduction +============ + +Welcome to the Boost libraries! By the time you've completed this +tutorial, you'll be at least somewhat comfortable with the contents +of a Boost distribution and how to go about using it. + +What's Here +----------- + +This document is designed to be an *extremely* gentle introduction, +so we included a fair amount of material that may already be very +familiar to you. To keep things simple, we also left out some +information intermediate and advanced users will probably want. At +the end of this document, we'll refer you on to resources that can +help you pursue these topics further. + +Preliminaries +------------- + +We use one typographic convention that might not be immediately +obvious: *italic* text in examples is meant as a descriptive +placeholder for something else, usually information that you'll +provide. For example: + +.. parsed-literal:: + + **$** echo "My name is *your name*\ " + +Here you're expected to imagine replacing the text “your name†with +your actual name. + +We identify Unix and its variants such as Linux, FreeBSD, and MacOS +collectively as \*nix. If you're not targeting Microsoft Windows, +the instructions for \*nix users will probably work for you. +Cygwin users working from the Cygwin ``bash`` prompt should also +follow the \*nix instructions. To use your Cygwin compiler from +the Windows command prompt, follow the instructions for Windows +users. + +Although Boost supports a wide variety of Windows compilers +(including older Microsoft compilers), most instructions for +Windows users cover only the Visual Studio .NET 2003 and Visual +Studio 2005. We hope that gives you enough information to adapt +them for your own compiler or IDE. + +Get Boost +========= + +There are basically three ways to get Boost on your system: + +1. **Windows Installer**: Boost Consulting provides an installer_ + for Windows platforms that installs a complete Boost + distribution, plus optional precompiled library binaries for + Visual Studio, and (optionally) a prebuilt version of the + ``bjam`` build tool. + + .. _Windows installer: http://www.boost-consulting.com/download.html + .. |Windows installer| replace:: **Windows installer** + .. _Boost Consulting: http://boost-consulting.com + .. _installer: `Windows installer`_ + + +2. **Download**: users of other platforms—and Windows + users who prefer to build everything from scratch—can `download + a complete Boost distribution`__ from SourceForge. + + .. ## Update this link for each release + __ http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=8041&release_id=376197 + + - **Windows**: Download and run |boost_ver|\ ``.exe`` + to unpack the distribution. [#zip]_ + + - ***nix**: Download |boost_ver|\ ``.tar.bz2``. Then, in the + directory where you want to put the Boost installation, + execute + + .. parsed-literal:: + + tar --bzip2 -xf */path/to/*\ |boost_ver|\ .tar.bz2 + +3. **Boost packages** from RedHat, Debian, or some other + distribution packager: these instructions may not work for you + if you use 3rd party packages, because other packagers sometimes + choose to break Boost up into several packages or to reorganize + the directory structure of the Boost distribution. [#packagers]_ + +The Structure of a Boost Distribution +===================================== + +This is is a sketch of the directory structure you'll get when you +unpack your Boost installation (windows users replace forward +slashes with backslashes): + +.. parsed-literal:: + + |boost_ver-bold|\ **/** .................\ *The “boost root directoryâ€* + **index.htm** .........\ *A copy of www.boost.org starts here* + **boost/** .........................\ *All Boost Header files* + **libs/** ............\ *Tests, .cpp*\ s\ *, docs, etc., by library* [#installer-src]_ + **index.html** ........\ *Library documentation starts here* + **algorithm/** + **any/** + **array/** + *…more libraries…* + **status/** .........................\ *Boost-wide test suite* + **tools/** ...........\ *Utilities, e.g. bjam, quickbook, bcp* + **more/** ..........................\ *Policy documents, etc.* + **doc/** ...............\ *A subset of all Boost library docs* + +.. sidebar:: Header Organization + :class: small + + The organization of Boost library headers isn't entirely uniform, + but most libraries follow a few patterns: + + * Some older libraries and most very small libraries place all + public headers directly into ``boost/``. + + * Most libraries' public headers live in a subdirectory of + ``boost/`` named after the library. For example, you'll find + the Type Traits Library's ``is_void.hpp`` header in + ``boost/type_traits/is_void.hpp``. + + * Some libraries have an “aggregate header†in ``boost/`` that + ``#include``\ s all of the library's other headers. For + example, Boost.Python_'s aggregate header is + ``boost/python.hpp``. + + * Most libraries place private headers in a subdirectory called + ``detail/`` or ``aux_/``. Don't look in these directories and + expect to find anything you can use. + +A few things are worth noting right off the bat: + +1. The path to the “boost root directory†is sometimes referred to + as ``$BOOST_ROOT`` in documentation and mailing lists. If you + used the Windows installer, that will usually be |winroot-default|. + +2. To compile anything in Boost, you need a directory containing + the ``boost/`` subdirectory in your ``#include`` path. For most + compilers, that means adding + + .. parsed-literal:: + + -I\ |root| + + to the command line. Specific steps for setting up ``#include`` + paths in Microsoft Visual Studio follow later in this document; + if you use another IDE, please consult your product's + documentation for instructions. + +3. Since all of Boost's header files have the ``.hpp`` extension, + and live in the ``boost/`` subdirectory of the boost root, your + Boost ``#include`` directives will look like: + + .. parsed-literal:: + + #include + + or + + .. parsed-literal:: + + #include "boost/\ *whatever*\ .hpp" + + depending on your religion as regards the use of angle bracket + includes. Even Windows users can use forward slashes in + ``#include`` directives; your compiler doesn't care. + +4. Don't be distracted by the ``doc/`` subdirectory; it only + contains a subset of the Boost documentation. Start with + ``libs/index.html`` if you're looking for the whole enchilada. + +Header-Only Libraries +===================== + +The first thing many people want to know is, “how do I build +Boost?†The good news is that often, there's nothing to build. + +.. admonition:: Nothing to Build + + Most Boost libraries are **header-only**: they consist *entirely + of header files* containing templates and inline functions, and + require no separately-compiled library binaries or special + treatment when linking. + +.. _separate: + +The only Boost libraries that can't be used without separate +compilation are: + +* Boost.Filesystem +* Boost.IOStreams +* Boost.ProgramOptions +* Boost.Python_ +* Boost.Regex +* Boost.Serialization +* Boost.Signals +* Boost.Test +* Boost.Thread +* Boost.Wave + +The DateTime library has a separately-compiled component that +is only needed if you're using its to/from_string and/or +serialization features or if you're targeting Visual C++ 6.x or +Borland. The Graph library also has a separately-compiled part, +but you won't need it unless you intend to `parse GraphViz +files`__. + +__ ../libs/graph/doc/read_graphviz.html + +.. ## Keep the list of non-header-only libraries up-to-date + +Build a Simple Program Using Boost +================================== + +To keep things simple, let's start by using a header-only library. +The following program reads a sequence of integers from standard +input, uses Boost.Lambda to multiply each number by three, and +writes them to standard output:: + + #include + #include + #include + #include + + int main() + { + using namespace boost::lambda; + typedef std::istream_iterator in; + + std::for_each( + in(std::cin), in(), std::cout << (_1 * 3) << " " ); + } + +Copy the text of this program into a file called ``example.cpp``. + +.. _unix-header-only: + +Build on \*nix +-------------- + +In the directory where you saved ``example.cpp``, issue the +following command: + +.. parsed-literal:: + + c++ -I |root| example.cpp -o example + +To test the result, type: + +.. parsed-literal:: + + echo 1 2 3 | ./example + +.. |next| replace:: *next...* + +|next|__ + +__ `Errors and Warnings`_ + +Build from the Visual Studio Command Prompt +------------------------------------------- + +From your computer's *Start* menu, if you are a Visual +Studio 2005 user, select + + *All Programs* > *Microsoft Visual Studio 2005* + > *Visual Studio Tools* > *Visual Studio 2005 Command Prompt* + +or, if you're a Visual Studio .NET 2003 user, select + + *All Programs* > *Microsoft Visual Studio .NET 2003* + > *Visual Studio .NET Tools* > *Visual Studio .NET 2003 Command Prompt* + +to bring up a special `command prompt`_ window set up for the Visual +Studio compiler. In that window, type the following command and +hit the return key: + +.. parsed-literal:: + + cl /EHsc /I\ |winroot| *path*\ \\\ *to*\ \\example.cpp + +To test the result, type: + +.. parsed-literal:: + + echo 1 2 3 | example + +|next|__ + +__ `Errors and Warnings`_ + +.. _vs-header-only: + +Build in the Visual Studio IDE +------------------------------ + +* From Visual Studio's *File* menu, select *New* > *Project…* +* In the left-hand pane of the resulting *New Project* dialog, + select *Visual C++* > *Win32*. +* In the right-hand pane, select *Win32 Console Application* + (VS8.0) or *Win32 Console Project* (VS7.1). +* In the *name* field, enter “example†+* Right-click **example** in the *Solution Explorer* pane and + select *Properties* from the resulting pop-up menu +* In *Configuration Properties* > *C/C++* > *General* > *Additional Include + Directories*, enter the path to the Boost root directory, e.g. + |winroot-default|. +* In *Configuration Properties* > *C/C++* > *Precompiled Headers*, change + *Use Precompiled Header (/Yu)* to *Not Using Precompiled + Headers*. [#pch]_ +* Replace the contents of the ``example.cpp`` generated by the IDE + with the example code above. +* From the *Build* menu, select *Build Solution*. + +To test your application, hit the F5 key and type the following +into the resulting window, followed by the return key:: + + 1 2 3 + +Then hold down the control key and press "Z", followed by the +return key. + +Errors and Warnings +------------------- + +Don't be alarmed if you see compiler warnings from Boost headers. +We try to eliminate them, but doing so isn't always practical. +[#warnings]_ + +Errors are another matter. If you're seeing compilation errors at +this point in the tutorial, check to be sure you've copied the +example program correctly and that you've correctly identified the +Boost root directory. + +Get Boost Library Binaries +========================== + +If you want to use any of the separately-compiled Boost libraries, +you'll need library binaries. + +Install Visual Studio Binaries +------------------------------ + +The `Windows installer`_ supplied by Boost Consulting will download +and install pre-compiled binaries into the ``lib\`` subdirectory of +the boost root, typically |winroot-default|\ ``\lib\``. + +|next|__ + +__ `Link Your Program to a Boost Library`_ + +Build and Install \*nix Binaries +-------------------------------- + +Issue the following commands in the shell (don't type ``$``; it +represents the shell's prompt): + +.. parsed-literal:: + + **$** cd |root| + **$** ./configure --help + +Select your configuration options and invoke ``./configure`` again. +Unless you have write permission in your system's ``/usr/local/`` +directory, you'll probably want to at least use + +.. parsed-literal:: + + **$** ./configure **--prefix=**\ *path*\ /\ *to*\ /\ *installation*\ /\ *prefix* + +to install somewhere else. Finally, + +.. parsed-literal:: + + **$** make install + +which will leave Boost binaries in the ``lib/`` subdirectory of +your installation prefix. You will also find a copy of the Boost +headers in the ``include/`` subdirectory of the installation +prefix, so you can henceforth use that directory as an ``#include`` +path in place of the Boost root directory. + +|next|__ + +__ `Expected Build Output`_ + +Build and Install Other Binaries +-------------------------------- + +If you're not using Visual C++ 7.1 or 8.0, or you're a \*nix user +who wants want to build with a toolset other than your system's +default, or if you want a nonstandard variant build of Boost +(e.g. optimized, but with debug symbols), you'll need to use +Boost.Build_ to create your own binaries. + +Boost.Build_ is a text-based system for developing, testing, and +installing software. To use it, you'll need an executable called +``bjam``. + +.. |precompiled-bjam| replace:: pre-compiled ``bjam`` executables + + +.. _precompiled-bjam: http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=72941 +.. _Boost.Jam documentation: Boost.Jam_ +.. _Boost.Build: ../tools/build/index.html +.. _Boost.Jam: ../tools/jam/index.html +.. _Boost.Build documentation: Boost.Build_ + +Get ``bjam`` +............ + +``bjam`` is the `command-line tool`_ that drives the Boost Build +system. To build Boost binaries, you'll invoke ``bjam`` from the +Boost root. + +Boost provides |precompiled-bjam|_ for a variety of platforms. +Alternatively, you can build ``bjam`` yourself using `these +instructions`__. + +__ http://www.boost.org/doc/html/jam/building.html + + +.. _toolset: +.. _toolset-name: + +Identify Your Toolset +..................... + +First, find the toolset corresponding to your compiler in the +following table. + ++-----------+--------------------+-----------------------------+ +|Toolset |Vendor |Notes | +|Name | | | ++===========+====================+=============================+ +|``acc`` |Hewlett Packard |Only very recent versions are| +| | |known to work well with Boost| ++-----------+--------------------+-----------------------------+ +|``borland``|Borland | | ++-----------+--------------------+-----------------------------+ +|``como`` |Comeau Computing |Using this toolset may | +| | |require configuring__ another| +| | |toolset to act as its backend| ++-----------+--------------------+-----------------------------+ +|``cw`` |Metrowerks/FreeScale|The CodeWarrior compiler. We| +| | |have not tested versions of | +| | |this compiler produced since | +| | |it was sold to FreeScale. | ++-----------+--------------------+-----------------------------+ +|``dmc`` |Digital Mars |As of this Boost release, no | +| | |version of dmc is known to | +| | |handle Boost well. | ++-----------+--------------------+-----------------------------+ +|``darwin`` |Apple Computer |Apple's version of the GCC | +| | |toolchain with support for | +| | |Darwin and MacOS X features | +| | |such as frameworks. | ++-----------+--------------------+-----------------------------+ +|``gcc`` |The Gnu Project |Includes support for Cygwin | +| | |and MinGW compilers. | ++-----------+--------------------+-----------------------------+ +|``hp_cxx`` |Hewlett Packard |Targeted at the Tru64 | +| | |operating system. | ++-----------+--------------------+-----------------------------+ +|``intel`` |Intel | | ++-----------+--------------------+-----------------------------+ +|``kylix`` |Borland | | ++-----------+--------------------+-----------------------------+ +|``msvc`` |Microsoft | | ++-----------+--------------------+-----------------------------+ +|``qcc`` |QNX Software Systems| | ++-----------+--------------------+-----------------------------+ +|``sun`` |Sun |Only very recent versions are| +| | |known to work well with | +| | |Boost. | ++-----------+--------------------+-----------------------------+ +|``vacpp`` |IBM |The VisualAge C++ compiler. | ++-----------+--------------------+-----------------------------+ + +__ Boost.Build_ + +If you have multiple versions of a particular compiler installed, +you can apend the version number to the toolset name, preceded by a +hyphen, e.g. ``msvc-7.1`` or ``gcc-3.4``. + +.. Note:: if you built ``bjam`` yourself, you may + have selected a toolset name for that purpose, but that does not + affect this step in any way; you still need to select a Boost.Build + toolset from the table. + +.. _build directory: +.. _build-directory: + +Select a Build Directory +........................ + +Boost.Build_ will place all intermediate files it generates while +building into the **build directory**. If your Boost root +directory is writable, this step isn't strictly necessary: by +default Boost.Build will create a ``bin.v2/`` subdirectory for that +purpose in your current working directory. + +Invoke ``bjam`` +............... + +.. |build-directory| replace:: *build-directory* +.. |toolset-name| replace:: *toolset-name* + +Change your current directory to the Boost root directory and +invoke ``bjam`` as follows: + +.. parsed-literal:: + + bjam **--build-dir=**\ |build-directory|_ **\\** + **--toolset=**\ |toolset-name|_ stage + +For example, on Windows, your session might look like: + +.. parsed-literal:: + + C:\WINDOWS> cd |winroot-default| + |winroot-default|> bjam **\\** + **--build-dir=**\ %TEMP%\\build-boost **\\** + **--toolset=msvc stage** + +And on Unix: + +.. parsed-literal:: + + $ cd ~/|boost_ver| + $ bjam **--build-dir=**\ ~/build-boost **--prefix=**\ ~/boost + +In either case, Boost.Build will place the Boost binaries in the +``stage/`` subdirectory of your `build directory`_. + +.. Note:: ``bjam`` is case-sensitive; it is important that all the + parts shown in **bold** type above be entirely lower-case. + +For a description of other options you can pass when invoking +``bjam``, type:: + + bjam --help + +Expected Build Output +--------------------- + +During the process of building Boost libraries, you can expect to +see some messages printed on the console. These may include + +* Notices about Boost library configuration—for example, the Regex + library outputs a message about ICU when built without Unicode + support, and the Python library may be skipped without error (but + with a notice) if you don't have Python installed. + +* Messages from the build tool that report the number of targets + that were built or skipped. Don't be surprised if those numbers + don't make any sense to you; there are many targets per library. + +* Build action messages describing what the tool is doing, which + look something like: + + .. parsed-literal:: + + *toolset-name*.c++ *long*\ /\ *path*\ /\ *to*\ /\ *file*\ /\ *being*\ /\ *built* + +* Compiler warnings. + +In Case of Build Errors +----------------------- + +The only error messages you see when building Boost—if any—should +be related to the IOStreams library's support of zip and bzip2 +formats as described here__. Install the relevant development +packages for libz and libbz2 if you need those features. Other +errors when building Boost libraries are cause for concern. + +If it seems like the build system can't find your compiler and/or +linker, consider setting up a ``user-config.jam`` file as described +in the `Boost.Build documentation`_. If that isn't your problem or +the ``user-config.jam`` file doesn't work for you, please address +questions about configuring Boost for your compiler to the +`Boost.Build mailing list`_. + +__ file:///home/dave/src/boost/libs/iostreams/doc/installation.html + +Link Your Program to a Boost Library +==================================== + +To demonstrate linking with a Boost binary library, we'll use the +following simple program that extracts the subject lines from +emails. It uses the Boost.Regex_ library, which has a +separately-compiled binary component. :: + + #include + #include + #include + + int main() + { + std::string line; + boost::regex pat( "^Subject: (Re: |Aw: )*(.*)" ); + + while (std::cin) + { + std::getline(std::cin, line); + boost::smatch matches; + if (boost::regex_match(line, matches, pat)) + std::cout << matches[2] << std::endl; + } + } + +.. _Boost.Regex: ../libs/regex + +There are two main challenges associated with linking: + +1. Tool configuration, e.g. choosing command-line options or IDE + build settings. + +2. Identifying the library binary, among all the build variants, + whose compile configuration is compatible with the rest of your + project. + +.. Note:: Boost.Python_ users should read that library's own `build + documentation`__ as there are several library-specific issues to + consider. + +.. _Boost.Python: ../libs/python/index.html +__ ../libs/python/doc/building.html + +Link to a Boost Library on Windows +---------------------------------- + +.. _auto-linking: + +Most Windows compilers and linkers have so-called “auto-linking +support,†which eliminates the second challenge. Special code in +Boost header files detects your compiler options and uses that +information to encode the name of the correct library into your +object files; the linker selects the library with that name from +the directories you've told it to search. + +Link to a Boost Library from the Visual Studio Command Prompt +............................................................. + +For example, we can compile and link the above program from the +Visual C++ command-line by simply adding the **bold** text below to +the command line we used earlier, assuming your Boost binaries are +in |winroot-default|\ ``\lib``: + +.. parsed-literal:: + + cl /EHsc /I |winroot| example.cpp **\\** + **/link /LIBPATH:** |bold-winroot-default|\ **\\lib** + +|next|__ + +__ `Test Your Program`_ + +Link to a Boost Library in the Visual Studio IDE +................................................ + +Starting with the `header-only example project`__ we created +earlier: + +__ vs-header-only_ + +1. Right-click **example** in the *Solution Explorer* pane and + select *Properties* from the resulting pop-up menu +2. In *Configuration Properties* > *Linker* > *Additional Library + Directories*, enter the path to the Boost binaries, + e.g. |winroot-default|\ ``\lib\``. +3. From the *Build* menu, select *Build Solution*. + +|next|__ + +__ `Test Your Program`_ + +Link to a Boost Library On \*nix +-------------------------------- + +There are two main ways to link to libraries: + +A. You can specify the full path to each library: + + .. parsed-literal:: + + $ c++ -I |root| example.cpp -o example **\\** + **~/boost/lib/libboost_regex-gcc-3.4-mt-d-1_34.a** + +B. You can separately specify a directory to search (with ``-L``\ + *directory*) and a library name to search for (with ``-l``\ + *library*, [#lowercase-l]_ dropping the filename's leading ``lib`` and trailing + suffix (``.a`` in this case): + + .. parsed-literal:: + + $ c++ -I |root| example.cpp -o example **\\** + **-L~/boost/lib/ -lboost_regex-gcc-3.4-mt-d-1_34** + + As you can see, this method is just as terse as method A for one + library; it *really* pays off when you're using multiple + libraries from the same directory. Note, however, that if you + use this method with a library that has both static (``.a``) and + dynamic (``.so``) builds, the system may choose one + automatically for you unless you pass a special option such as + ``-static`` on the command line. + +In both cases above, the bold text is what you'd add to `the +command lines we explored earlier`__. + +__ unix-header-only_ + +Library Naming +-------------- + +When auto-linking is not available, you need to know how Boost +binaries are named so you can choose the right one for your build +configuration. Each library filename is composed of a common +sequence of elements that describe how it was built. For example, +``libboost_regex-vc71-mt-d-1_34.lib`` can be broken down into the +following elements: + +``lib`` + *Prefix*: except on Microsoft Windows, every Boost library + name begins with this string. On Windows, only ordinary static + libraries use the ``lib`` prefix; import libraries and DLLs do + not. [#distinct]_ + +``boost_regex`` + *Library name*: all boost library filenames begin with ``boost_``. + +``-vc71`` + *Toolset tag*: identifies the toolset and version used to build + the binary. + +``-mt`` + *Threading tag*: indicates that the library was + built with multithreading support enabled. Libraries built + without multithreading support can be identified by the absence + of ``-mt``. + +``-d`` + *ABI tag*: encodes details that affect the library's + interoperability with other compiled code. For each such + feature, a single letter is added to the tag: + + +-----+------------------------------------------------------------------------------+ + |Key |Use this library when: | + +=====+==============================================================================+ + |``s``|linking statically to the C++ standard library and compiler runtime support | + | |libraries. | + +-----+------------------------------------------------------------------------------+ + |``g``|using debug versions of the standard and runtime support libraries. | + +-----+------------------------------------------------------------------------------+ + |``y``|using a special `debug build of Python`__. | + +-----+------------------------------------------------------------------------------+ + |``d``|building a debug version of your code. [#debug-abi]_ | + +-----+------------------------------------------------------------------------------+ + |``p``|using the STLPort standard library rather than the default one supplied with | + | |your compiler. | + +-----+------------------------------------------------------------------------------+ + |``n``|using STLPort's deprecated “native iostreams†feature. [#native]_ | + +-----+------------------------------------------------------------------------------+ + + For example, if you build a debug version of your code for use + with debug versions of the static runtime library and the + STLPort standard library in “native iostreams†mode, + the tag would be: ``-sgdpn``. If none of the above apply, the + ABI tag is ommitted. + +``-1_34`` + *Version tag*: the full Boost release number, with periods + replaced by underscores. For example, version 1.31.1 would be + tagged as "-1_31_1". + +``.lib`` + *Extension*: determined according to the operating system's usual + convention. On most \*nix platforms the extensions are ``.a`` + and ``.so`` for static libraries (archives) and shared libraries, + respectively. On Windows, ``.dll`` indicates a shared library + and—except for static libraries built by ``gcc`` toolset, whose + names always end in ``.a``— ``.lib`` indicates a static or import + library. Where supported by \*nix toolsets, a full version + extension is added (e.g. ".so.1.34") and a symbolic link to the + library file, named without the trailing version number, will + also be created. + +.. _Boost.Build toolset names: toolset-name_ + +__ ../libs/python/doc/building.html#variants + +Test Your Program +----------------- + +To test our subject extraction, we'll filter the following text +file. Copy it out of your browser and save it as ``jayne.txt``:: + + To: George Shmidlap + From: Rita Marlowe + Subject: Will Success Spoil Rock Hunter? + --- + See subject. + +Test Your Program on Microsoft Windows +...................................... + +In a `command prompt`_ window, type: + +.. parsed-literal:: + + *path*\ \\\ *to*\ \\\ *compiled*\ \\example < *path*\ \\\ *to*\ \\\ jayne.txt + +The program should respond with the email subject, “Will Success +Spoil Rock Hunter?†+ +Test Your Program on \*nix +.......................... + +If you linked to a shared library, you may need to prepare some +platform-specific settings so that the system will be able to find +and load it when your program is run. Most platforms have an +environment variable to which you can add the directory containing +the library. On many platforms (Linux, FreeBSD) that variable is +``LD_LIBRARY_PATH``, but on MacOS it's ``DYLD_LIBRARY_PATH``, and +on Cygwin it's simply ``PATH``. In most shells other than ``csh`` +and ``tcsh``, you can adjust the variable as follows (again, don't +type the ``$``\ —that represents the shell prompt): + +.. parsed-literal:: + + **$** *VARIABLE_NAME*\ =\ *path/to/lib/directory*\ :${\ *VARIABLE_NAME*\ } + **$** export *VARIABLE_NAME* + +On ``csh`` and ``tcsh``, it's + +.. parsed-literal:: + + **$** setenv *VARIABLE_NAME* *path/to/lib/directory*\ :${\ *VARIABLE_NAME*\ } + +Once the necessary variable (if any) is set, you can run your +program as follows: + +.. parsed-literal:: + + **$** *path*\ /\ *to*\ /\ *compiled*\ /\ example < *path*\ /\ *to*\ /\ jayne.txt + +The program should respond with the email subject, “Will Success +Spoil Rock Hunter?†+ +Conclusion and Further Resources +================================ + +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 +we may have a “Book 2 in the Getting Started series†that addresses +them. Until then, we suggest you pursue the following resources. +If you can't find what you need, or there's anything we can do to +make this document clearer, please post it to the `Boost Users' +mailing list`_. + +* `Boost.Build reference manual`_ +* `Boost.Jam reference manual`_ +* `Boost Users' mailing list`_ +* `Boost.Build mailing list`_ +* `Boost.Build Wiki`_ + +.. Admonition:: Onward + + .. epigraph:: + + Good luck, and have fun! + + -- the Boost Developers + +.. _Boost.Build reference manual: ../tools/build/v2 +.. _Boost.Jam reference manual: `Boost.Jam`_ +.. _Boost Users' mailing list: mailing_lists.htm#users +.. _Boost.Build Wiki: http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Boost.Build_V2 +.. _Boost.Build mailing list: mailing_lists.htm#jamboost + + +.. _`Using command-line tools in Windows`: +.. _`command prompt`: +.. _`command-line tool`: + +Appendix: Using command-line tools in Windows +============================================= + +In Windows, a command-line tool is invoked by typing its name, +optionally followed by arguments, into a *Command Prompt* window +and pressing the Return (or Enter) key. + +To open *Command Prompt*, click the *Start* menu button, click +*Run*, type “cmdâ€, and then click OK. + +All commands are executed within the context of a **current +directory** in the filesystem. To set the current directory, +type: + +.. parsed-literal:: + + cd *path*\ \\\ *to*\ \\\ *some*\ \\\ *directory* + +followed by Return. For example, + +.. parsed-literal:: + + cd |winroot-default| + +One way to name a directory you know about is to write + +.. parsed-literal:: + + %HOMEDRIVE%%HOMEPATH%\\\ *directory-name* + +which indicates a sibling folder of your “My Documents†folder. + +Long commands can be continued across several lines by typing +backslashes at the ends of all but the last line. Many of the +examples on this page use that technique to save horizontal +space. + +------------------------------ + +.. [#zip] If you prefer not to download executable programs, download + |boost_ver|\ ``.zip`` and use an external tool to decompress + it. We don't recommend using Windows' built-in decompression as + it can be painfully slow for large archives. + +.. [#packagers] If developers of Boost packages would like to work + with us to make sure these instructions can be used with their + packages, we'd be glad to help. Please make your interest known + to the `Boost developers' list`_. + +.. _Boost developers' list: mailing_lists.htm#main + +.. [#installer-src] If you used the `Windows installer`_ from Boost + Consulting and deselected “Source and Documentation†(it's + selected by default), you won't see the ``libs/`` subdirectory. + That won't affect your ability to use precompiled binaries, but + you won't be able to rebuild libraries from scratch. + +.. [#warnings] Remember that warnings are specific to each compiler + implementation. The developer of a given Boost library might + not have access to your compiler. Also, some warnings are + extremely difficult to eliminate in generic code, to the point + where it's not worth the trouble. Finally, some compilers don't + have any source code mechanism for suppressing warnings. + +.. [#pch] There's no problem using Boost with precompiled headers; + these instructions merely avoid precompiled headers because it + would require Visual Studio-specific changes to the source code + used in the examples. + +.. [#lowercase-l] That option is a dash followed by a lowercase “L†+ character, which looks very much like a numeral 1 in some fonts. + +.. [#distinct] 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. + +.. [#debug-abi] These libraries were compiled without optimization + or inlining, with full debug symbols enabled, and without + ``NDEBUG`` ``#define``\ d. All though it's true that sometimes + these choices don't affect binary compatibility with other + compiled code, you can't count on that with Boost libraries. + +.. [#native] This feature of STLPort is deprecated because it's + impossible to make it work transparently to the user; we don't + recommend it. + diff --git a/more/getting_started/Jamfile.v2 b/more/getting_started/Jamfile.v2 new file mode 100644 index 0000000000..770aae934d --- /dev/null +++ b/more/getting_started/Jamfile.v2 @@ -0,0 +1,23 @@ +# Copyright David Abrahams 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) +import docutils ; + +import path ; +sources = [ path.glob . : *.rst ] ; +bases = $(sources:S=) ; + +# This is a path relative to the html/ subdirectory where the +# generated output will eventually be moved. +stylesheet = "--stylesheet=../../rst.css" ; + +for local b in $(bases) +{ + html $(b) : $(b).rst : + + "--link-stylesheet --traceback --trim-footnote-reference-space --footnote-references=superscript "$(stylesheet) + ; +} + +alias htmls : $(bases) ; +stage . : $(bases) ; diff --git a/more/getting_started/detail/binary-head.rst b/more/getting_started/detail/binary-head.rst new file mode 100644 index 0000000000..21f32aba72 --- /dev/null +++ b/more/getting_started/detail/binary-head.rst @@ -0,0 +1,10 @@ +.. Copyright David Abrahams 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) + +Prepare to Use a Boost Library Binary +===================================== + +If you want to use any of the separately-compiled Boost libraries, +you'll need to acquire library binaries. + diff --git a/more/getting_started/detail/build-from-source-head.rst b/more/getting_started/detail/build-from-source-head.rst new file mode 100644 index 0000000000..57cdf9f383 --- /dev/null +++ b/more/getting_started/detail/build-from-source-head.rst @@ -0,0 +1,126 @@ +.. Copyright David Abrahams 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) + +Boost.Build_ is a text-based system for developing, testing, and +installing software. To use it, you'll need an executable called +``bjam``. + +.. |precompiled-bjam| replace:: pre-compiled ``bjam`` executables + + +.. _precompiled-bjam: http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=72941 +.. .. _Boost.Jam documentation: Boost.Jam_ +.. _Boost.Build: ../../tools/build/index.html +.. _Boost.Jam: ../../tools/jam/index.html +.. _Boost.Build documentation: Boost.Build_ + +Get ``bjam`` +............ + +``bjam`` is the |command-line tool| that drives the Boost Build +system. To build Boost binaries, you'll invoke ``bjam`` from the +Boost root. + +Boost provides |precompiled-bjam|_ for a variety of platforms. +Alternatively, you can build ``bjam`` yourself using `these +instructions`__. + +__ `building bjam`_ + + +.. _toolset: +.. _toolset-name: + +Identify Your Toolset +..................... + +First, find the toolset corresponding to your compiler in the +following table. + +.. Note:: If you previously chose a toolset for the purposes of + `building bjam`_, you should assume it won't work and instead + choose newly from the table below. + +.. _building bjam: ../../doc/html/jam/building.html + ++-----------+--------------------+-----------------------------+ +|Toolset |Vendor |Notes | +|Name | | | ++===========+====================+=============================+ +|``acc`` |Hewlett Packard |Only very recent versions are| +| | |known to work well with Boost| ++-----------+--------------------+-----------------------------+ +|``borland``|Borland | | ++-----------+--------------------+-----------------------------+ +|``como`` |Comeau Computing |Using this toolset may | +| | |require configuring__ another| +| | |toolset to act as its backend| ++-----------+--------------------+-----------------------------+ +|``cw`` |Metrowerks/FreeScale|The CodeWarrior compiler. We| +| | |have not tested versions of | +| | |this compiler produced since | +| | |it was sold to FreeScale. | ++-----------+--------------------+-----------------------------+ +|``dmc`` |Digital Mars |As of this Boost release, no | +| | |version of dmc is known to | +| | |handle Boost well. | ++-----------+--------------------+-----------------------------+ +|``darwin`` |Apple Computer |Apple's version of the GCC | +| | |toolchain with support for | +| | |Darwin and MacOS X features | +| | |such as frameworks. | ++-----------+--------------------+-----------------------------+ +|``gcc`` |The Gnu Project |Includes support for Cygwin | +| | |and MinGW compilers. | ++-----------+--------------------+-----------------------------+ +|``hp_cxx`` |Hewlett Packard |Targeted at the Tru64 | +| | |operating system. | ++-----------+--------------------+-----------------------------+ +|``intel`` |Intel | | ++-----------+--------------------+-----------------------------+ +|``kylix`` |Borland | | ++-----------+--------------------+-----------------------------+ +|``msvc`` |Microsoft | | ++-----------+--------------------+-----------------------------+ +|``qcc`` |QNX Software Systems| | ++-----------+--------------------+-----------------------------+ +|``sun`` |Sun |Only very recent versions are| +| | |known to work well with | +| | |Boost. | ++-----------+--------------------+-----------------------------+ +|``vacpp`` |IBM |The VisualAge C++ compiler. | ++-----------+--------------------+-----------------------------+ + +__ Boost.Build_ + +If you have multiple versions of a particular compiler installed, +you can append the version number to the toolset name, preceded by +a hyphen, e.g. ``intel-9.0`` or +``borland-5.4.3``. |windows-version-name-caveat| + + +.. _build directory: +.. _build-directory: + +Select a Build Directory +........................ + +Boost.Build_ will place all intermediate files it generates while +building into the **build directory**. If your Boost root +directory is writable, this step isn't strictly necessary: by +default Boost.Build will create a ``bin.v2/`` subdirectory for that +purpose in your current working directory. + +Invoke ``bjam`` +............... + +.. |build-directory| replace:: *build-directory* +.. |toolset-name| replace:: *toolset-name* + +Change your current directory to the Boost root directory and +invoke ``bjam`` as follows: + +.. parsed-literal:: + + bjam **--build-dir=**\ |build-directory|_ **--toolset=**\ |toolset-name|_ stage diff --git a/more/getting_started/detail/build-from-source-tail.rst b/more/getting_started/detail/build-from-source-tail.rst new file mode 100644 index 0000000000..5a07b715cb --- /dev/null +++ b/more/getting_started/detail/build-from-source-tail.rst @@ -0,0 +1,67 @@ +.. Copyright David Abrahams 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) + +Building the special ``stage`` target places Boost +library binaries in the ``stage``\ |/| subdirectory of your `build +directory`_. + +.. Note:: ``bjam`` is case-sensitive; it is important that all the + parts shown in **bold** type above be entirely lower-case. + +For a description of other options you can pass when invoking +``bjam``, type:: + + bjam --help + +In particular, to limit the amount of time spent building, you may +be interested in: + +* reviewing the list of library names with ``--show-libraries`` +* limiting which libraries get built with the ``--with-``\ + *library-name* or ``--without-``\ *library-name* options +* choosing a specific build variant by adding ``release`` or + ``debug`` to the command line. + +Expected Build Output +--------------------- + +During the process of building Boost libraries, you can expect to +see some messages printed on the console. These may include + +* Notices about Boost library configuration—for example, the Regex + library outputs a message about ICU when built without Unicode + support, and the Python library may be skipped without error (but + with a notice) if you don't have Python installed. + +* Messages from the build tool that report the number of targets + that were built or skipped. Don't be surprised if those numbers + don't make any sense to you; there are many targets per library. + +* Build action messages describing what the tool is doing, which + look something like: + + .. parsed-literal:: + + *toolset-name*.c++ *long*\ /\ *path*\ /\ *to*\ /\ *file*\ /\ *being*\ /\ *built* + +* Compiler warnings. + +In Case of Build Errors +----------------------- + +The only error messages you see when building Boost—if any—should +be related to the IOStreams library's support of zip and bzip2 +formats as described here__. Install the relevant development +packages for libz and libbz2 if you need those features. Other +errors when building Boost libraries are cause for concern. + +__ ../../libs/iostreams/doc/installation.html + +If it seems like the build system can't find your compiler and/or +linker, consider setting up a ``user-config.jam`` file as described +in the `Boost.Build documentation`_. If that isn't your problem or +the ``user-config.jam`` file doesn't work for you, please address +questions about configuring Boost for your compiler to the +`Boost.Build mailing list`_. + diff --git a/more/getting_started/detail/build-simple-head.rst b/more/getting_started/detail/build-simple-head.rst new file mode 100644 index 0000000000..487610e344 --- /dev/null +++ b/more/getting_started/detail/build-simple-head.rst @@ -0,0 +1,28 @@ +.. Copyright David Abrahams 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) + +Build a Simple Program Using Boost +================================== + +To keep things simple, let's start by using a header-only library. +The following program reads a sequence of integers from standard +input, uses Boost.Lambda to multiply each number by three, and +writes them to standard output:: + + #include + #include + #include + #include + + int main() + { + using namespace boost::lambda; + typedef std::istream_iterator in; + + std::for_each( + in(std::cin), in(), std::cout << (_1 * 3) << " " ); + } + +Copy the text of this program into a file called ``example.cpp``. + diff --git a/more/getting_started/detail/common-footnotes.rst b/more/getting_started/detail/common-footnotes.rst new file mode 100644 index 0000000000..980600b719 --- /dev/null +++ b/more/getting_started/detail/common-footnotes.rst @@ -0,0 +1,26 @@ +.. Copyright David Abrahams 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) + +.. [#warnings] Remember that warnings are specific to each compiler + implementation. The developer of a given Boost library might + not have access to your compiler. Also, some warnings are + extremely difficult to eliminate in generic code, to the point + where it's not worth the trouble. Finally, some compilers don't + have any source code mechanism for suppressing warnings. + +.. [#distinct] 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. + +.. [#debug-abi] These libraries were compiled without optimization + or inlining, with full debug symbols enabled, and without + ``NDEBUG`` ``#define``\ d. Although it's true that sometimes + these choices don't affect binary compatibility with other + compiled code, you can't count on that with Boost libraries. + +.. [#native] This feature of STLPort is deprecated because it's + impossible to make it work transparently to the user; we don't + recommend it. + diff --git a/more/getting_started/detail/common-unix.rst b/more/getting_started/detail/common-unix.rst new file mode 100644 index 0000000000..c1cdf491c5 --- /dev/null +++ b/more/getting_started/detail/common-unix.rst @@ -0,0 +1,24 @@ +.. Copyright David Abrahams 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) + +.. |//| replace:: **/** +.. |/| replace:: ``/`` + +.. |default-root| replace:: ``/usr/local/``\ |boost_ver| +.. |default-root-bold| replace:: **/usr/local/**\ |boost_ver-bold| + +.. |root| replace:: *path/to/*\ |boost_ver| + +.. |forward-slashes| replace:: `` `` + +.. |precompiled-dir| replace:: `` `` + +.. |include-paths| replace:: `` `` + +.. |windows-version-name-caveat| replace:: `` `` + +.. |command-line tool| replace:: command-line tool + + +.. include:: common.rst diff --git a/more/getting_started/detail/common-windows.rst b/more/getting_started/detail/common-windows.rst new file mode 100644 index 0000000000..fa0102c4e3 --- /dev/null +++ b/more/getting_started/detail/common-windows.rst @@ -0,0 +1,34 @@ +.. Copyright David Abrahams 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) + +.. |//| replace:: **\\** +.. |/| replace:: ``\`` + +.. |default-root| replace:: ``C:\Program Files\boost\``\ |boost_ver| +.. |default-root-bold| replace:: **C:\\Program Files\\boost\\**\ |boost_ver-bold| + +.. |root| replace:: *path\\to\\*\ |boost_ver| + +.. |include-paths| replace:: Specific steps for setting up ``#include`` + paths in Microsoft Visual Studio follow later in this document; + if you use another IDE, please consult your product's + documentation for instructions. + +.. |forward-slashes| replace:: Even Windows users can (and, for + portability reasons, probably should) use forward slashes in + ``#include`` directives; your compiler doesn't care. + +.. |precompiled-dir| replace:: + + **lib**\ |//| .....................\ *precompiled library binaries* + + +.. |windows-version-name-caveat| replace:: **On Windows, append a version + number even if you only have one version installed** (unless you + are using the msvc or gcc toolsets, which have special version + detection code) or `auto-linking`_ will fail. + +.. |command-line tool| replace:: `command-line tool`_ + +.. include:: common.rst diff --git a/more/getting_started/detail/common.rst b/more/getting_started/detail/common.rst new file mode 100644 index 0000000000..591c05b175 --- /dev/null +++ b/more/getting_started/detail/common.rst @@ -0,0 +1,5 @@ +.. Copyright David Abrahams 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) + +.. |next| replace:: *skip to the next step* diff --git a/more/getting_started/detail/conclusion.rst b/more/getting_started/detail/conclusion.rst new file mode 100644 index 0000000000..7c74e95342 --- /dev/null +++ b/more/getting_started/detail/conclusion.rst @@ -0,0 +1,39 @@ +.. Copyright David Abrahams 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) + +Conclusion and Further Resources +================================ + +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 +we may have a “Book 2 in the Getting Started series†that addresses +them. Until then, we suggest you pursue the following resources. +If you can't find what you need, or there's anything we can do to +make this document clearer, please post it to the `Boost Users' +mailing list`_. + +* `Boost.Build reference manual`_ +* `Boost.Jam reference manual`_ +* `Boost Users' mailing list`_ +* `Boost.Build mailing list`_ +* `Boost.Build Wiki`_ +* `Index of all Boost library documentation`_ + +.. _Index of all Boost library documentation: ../../libs/index.html + +.. Admonition:: Onward + + .. epigraph:: + + Good luck, and have fun! + + -- the Boost Developers + +.. _Boost.Build reference manual: ../../tools/build/v2/index.html +.. _Boost.Jam reference manual: `Boost.Jam`_ +.. _Boost Users' mailing list: ../../more/mailing_lists.htm#users +.. _Boost.Build Wiki: http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Boost.Build_V2 +.. _Boost.Build mailing list: ../../more/mailing_lists.htm#jamboost + diff --git a/more/getting_started/detail/distro.rst b/more/getting_started/detail/distro.rst new file mode 100644 index 0000000000..708dfd1ab6 --- /dev/null +++ b/more/getting_started/detail/distro.rst @@ -0,0 +1,88 @@ +.. Copyright David Abrahams 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) + +The Boost Distribution +====================== + +This is a sketch of the resulting directory structure: + +.. parsed-literal:: + + |boost_ver-bold|\ |//| .................\ *The “boost root directoryâ€* + **index.htm** .........\ *A copy of www.boost.org starts here* + **boost**\ |//| .........................\ *All Boost Header files* + |precompiled-dir| + **libs**\ |//| ............\ *Tests, .cpp*\ s\ *, docs, etc., by library* + **index.html** ........\ *Library documentation starts here* + **algorithm**\ |//| + **any**\ |//| + **array**\ |//| + *…more libraries…* + **status**\ |//| .........................\ *Boost-wide test suite* + **tools**\ |//| ...........\ *Utilities, e.g. bjam, quickbook, bcp* + **more**\ |//| ..........................\ *Policy documents, etc.* + **doc**\ |//| ...............\ *A subset of all Boost library docs* + +.. sidebar:: Header Organization + + .. class:: pre-wrap + + The organization of Boost library headers isn't entirely uniform, + but most libraries follow a few patterns: + + * Some older libraries and most very small libraries place all + public headers directly into ``boost``\ |/|. + + * Most libraries' public headers live in a subdirectory of + ``boost``\ |/|, named after the library. For example, you'll find + the Python library's ``def.hpp`` header in + + .. parsed-literal:: + + ``boost``\ |/|\ ``python``\ |/|\ ``def.hpp``. + + * Some libraries have an “aggregate header†in ``boost``\ |/| that + ``#include``\ s all of the library's other headers. For + example, Boost.Python_'s aggregate header is + + .. parsed-literal:: + + ``boost``\ |/|\ ``python.hpp``. + + * Most libraries place private headers in a subdirectory called + ``detail``\ |/|, or ``aux_``\ |/|. Don't expect to find + anything you can use in these directories. + +It's important to note the following: + +.. _Boost root directory: + +1. The path to the **boost root directory** (often |default-root|) is + sometimes referred to as ``$BOOST_ROOT`` in documentation and + mailing lists . + +2. To compile anything in Boost, you need a directory containing + the ``boost``\ |/| subdirectory in your ``#include`` path. |include-paths| + +3. Since all of Boost's header files have the ``.hpp`` extension, + and live in the ``boost``\ |/| subdirectory of the boost root, your + Boost ``#include`` directives will look like: + + .. parsed-literal:: + + #include + + or + + .. parsed-literal:: + + #include "boost/\ *whatever*\ .hpp" + + depending on your preference regarding the use of angle bracket + includes. |forward-slashes| + +4. Don't be distracted by the ``doc``\ |/| subdirectory; it only + contains a subset of the Boost documentation. Start with + ``libs``\ |/|\ ``index.html`` if you're looking for the whole enchilada. + diff --git a/more/getting_started/detail/errors-and-warnings.rst b/more/getting_started/detail/errors-and-warnings.rst new file mode 100644 index 0000000000..770d46eae3 --- /dev/null +++ b/more/getting_started/detail/errors-and-warnings.rst @@ -0,0 +1,16 @@ +.. Copyright David Abrahams 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) + +Errors and Warnings +------------------- + +Don't be alarmed if you see compiler warnings originating in Boost +headers. We try to eliminate them, but doing so isn't always +practical. [#warnings]_ **Errors are another matter**. If you're +seeing compilation errors at this point in the tutorial, check to +be sure you've copied the `example program`__ correctly and that you've +correctly identified the `Boost root directory`_. + +__ `Build a Simple Program Using Boost`_ + diff --git a/more/getting_started/detail/header-only.rst b/more/getting_started/detail/header-only.rst new file mode 100644 index 0000000000..c1f1dd3b3e --- /dev/null +++ b/more/getting_started/detail/header-only.rst @@ -0,0 +1,48 @@ +.. Copyright David Abrahams 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) + +Header-Only Libraries +===================== + +The first thing many people want to know is, “how do I build +Boost?†The good news is that often, there's nothing to build. + +.. admonition:: Nothing to Build? + + Most Boost libraries are **header-only**: they consist *entirely + of header files* containing templates and inline functions, and + require no separately-compiled library binaries or special + treatment when linking. + +.. .. _separate: + +The only Boost libraries that *must* be built separately are: + +* Boost.Filesystem_ +* Boost.IOStreams_ +* Boost.ProgramOptions_ +* Boost.Python_ (see the `Boost.Python build documentation`__ + before building and installing it) +* Boost.Regex_ +* Boost.Serialization_ +* Boost.Signals_ +* Boost.Thread_ +* Boost.Wave_ + +__ ../../libs/python/doc/building.html + +A few libraries have optional separately-compiled binaries: + +* Boost.DateTime_ has a binary component that is only needed if + you're using its ``to_string``\ /\ ``from_string`` or serialization + features, or if you're targeting Visual C++ 6.x or Borland. + +* Boost.Graph_ also has a binary component that is only needed if + you intend to `parse GraphViz files`__. + +* Boost.Test_ can be used in “header-only†or “separately compiled†+ mode, although **separate compilation is recommended for serious + use**. + +__ ../../libs/graph/doc/read_graphviz.html diff --git a/more/getting_started/detail/library-naming.rst b/more/getting_started/detail/library-naming.rst new file mode 100644 index 0000000000..76d99ed5c2 --- /dev/null +++ b/more/getting_started/detail/library-naming.rst @@ -0,0 +1,80 @@ +.. Copyright David Abrahams 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) + +In order to choose the right binary for your build configuration +you need to know how Boost binaries are named. Each library +filename is composed of a common sequence of elements that describe +how it was built. For example, +``libboost_regex-vc71-mt-d-1_34.lib`` can be broken down into the +following elements: + +``lib`` + *Prefix*: except on Microsoft Windows, every Boost library + name begins with this string. On Windows, only ordinary static + libraries use the ``lib`` prefix; import libraries and DLLs do + not. [#distinct]_ + +``boost_regex`` + *Library name*: all boost library filenames begin with ``boost_``. + +``-vc71`` + *Toolset tag*: identifies the toolset_ and version used to build + the binary. + +``-mt`` + *Threading tag*: indicates that the library was + built with multithreading support enabled. Libraries built + without multithreading support can be identified by the absence + of ``-mt``. + +``-d`` + *ABI tag*: encodes details that affect the library's + interoperability with other compiled code. For each such + feature, a single letter is added to the tag: + + +-----+------------------------------------------------------------------------------+ + |Key |Use this library when: | + +=====+==============================================================================+ + |``s``|linking statically to the C++ standard library and compiler runtime support | + | |libraries. | + +-----+------------------------------------------------------------------------------+ + |``g``|using debug versions of the standard and runtime support libraries. | + +-----+------------------------------------------------------------------------------+ + |``y``|using a special `debug build of Python`__. | + +-----+------------------------------------------------------------------------------+ + |``d``|building a debug version of your code. [#debug-abi]_ | + +-----+------------------------------------------------------------------------------+ + |``p``|using the STLPort standard library rather than the default one supplied with | + | |your compiler. | + +-----+------------------------------------------------------------------------------+ + |``n``|using STLPort's deprecated “native iostreams†feature. [#native]_ | + +-----+------------------------------------------------------------------------------+ + + For example, if you build a debug version of your code for use + with debug versions of the static runtime library and the + STLPort standard library in “native iostreams†mode, + the tag would be: ``-sgdpn``. If none of the above apply, the + ABI tag is ommitted. + +``-1_34`` + *Version tag*: the full Boost release number, with periods + replaced by underscores. For example, version 1.31.1 would be + tagged as "-1_31_1". + +``.lib`` + *Extension*: determined according to the operating system's usual + convention. On most unix-style platforms the extensions are + ``.a`` and ``.so`` for static libraries (archives) and shared + libraries, respectively. On Windows, ``.dll`` indicates a shared + library and (except for static libraries built by the ``gcc`` + toolset_, whose names always end in ``.a``) ``.lib`` indicates a + static or import library. Where supported by toolsets on unix + variants, a full version extension is added (e.g. ".so.1.34") and + a symbolic link to the library file, named without the trailing + version number, will also be created. + +.. .. _Boost.Build toolset names: toolset-name_ + +__ ../../libs/python/doc/building.html#variants + diff --git a/more/getting_started/detail/link-head.rst b/more/getting_started/detail/link-head.rst new file mode 100644 index 0000000000..c4a59958be --- /dev/null +++ b/more/getting_started/detail/link-head.rst @@ -0,0 +1,39 @@ +.. Copyright David Abrahams 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) + +Link Your Program to a Boost Library +==================================== + +To demonstrate linking with a Boost binary library, we'll use the +following simple program that extracts the subject lines from +emails. It uses the Boost.Regex_ library, which has a +separately-compiled binary component. :: + + #include + #include + #include + + int main() + { + std::string line; + boost::regex pat( "^Subject: (Re: |Aw: )*(.*)" ); + + while (std::cin) + { + std::getline(std::cin, line); + boost::smatch matches; + if (boost::regex_match(line, matches, pat)) + std::cout << matches[2] << std::endl; + } + } + +There are two main challenges associated with linking: + +1. Tool configuration, e.g. choosing command-line options or IDE + build settings. + +2. Identifying the library binary, among all the build variants, + whose compile configuration is compatible with the rest of your + project. + diff --git a/more/getting_started/detail/links.rst b/more/getting_started/detail/links.rst new file mode 100644 index 0000000000..e1a181c231 --- /dev/null +++ b/more/getting_started/detail/links.rst @@ -0,0 +1,16 @@ +.. Copyright David Abrahams 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) + +.. _Boost.DateTime: ../../libs/date_time/index.html +.. _Boost.Filesystem: ../../libs/filesystem/index.html +.. _Boost.Graph: ../../libs/graph/index.html +.. _Boost.IOStreams: ../../libs/iostreams/index.html +.. _Boost.ProgramOptions: ../../libs/program_options/index.html +.. _Boost.Python: ../../libs/python/doc/building.html +.. _Boost.Regex: ../../libs/regex/index.html +.. _Boost.Serialization: ../../libs/serialization/index.html +.. _Boost.Signals: ../../libs/signals/index.html +.. _Boost.Test: ../../libs/test/index.html +.. _Boost.Thread: ../../doc/html/thread/build.html#thread.build +.. _Boost.Wave: ../../libs/wave/index.html diff --git a/more/getting_started/detail/release-variables.rst b/more/getting_started/detail/release-variables.rst new file mode 100644 index 0000000000..f0660524e7 --- /dev/null +++ b/more/getting_started/detail/release-variables.rst @@ -0,0 +1,12 @@ +.. Copyright David Abrahams 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) + +.. This file contains all the definitions that need to be updated +.. for each new release of Boost. + +.. |boost-version-number| replace:: 1.34.1 +.. |boost_ver| replace:: ``boost_1_34_1`` +.. |boost_ver-bold| replace:: **boost_1_34_1** + +.. _sf-download: http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=8041 \ No newline at end of file diff --git a/more/getting_started/detail/test-head.rst b/more/getting_started/detail/test-head.rst new file mode 100644 index 0000000000..90e1ce7557 --- /dev/null +++ b/more/getting_started/detail/test-head.rst @@ -0,0 +1,16 @@ +.. Copyright David Abrahams 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) + +Test Your Program +----------------- + +To test our subject extraction, we'll filter the following text +file. Copy it out of your browser and save it as ``jayne.txt``:: + + To: George Shmidlap + From: Rita Marlowe + Subject: Will Success Spoil Rock Hunter? + --- + See subject. + diff --git a/more/getting_started/index.html b/more/getting_started/index.html new file mode 100644 index 0000000000..2f60d00baa --- /dev/null +++ b/more/getting_started/index.html @@ -0,0 +1,58 @@ + + + + + + +Boost Getting Started + + + +
+

Getting Started

+ + + + +
+

Welcome

+

Welcome to the Boost libraries! By the time you've completed this +tutorial, you'll be at least somewhat comfortable with the contents +of a Boost distribution and how to go about using it.

+
+
+

What's Here

+

This document is designed to be an extremely gentle introduction, +so we included a fair amount of material that may already be very +familiar to you. To keep things simple, we also left out some +information intermediate and advanced users will probably want. At +the end of this document, we'll refer you on to resources that can +help you pursue these topics further.

+
+
+

Preliminaries

+

We use one typographic convention that might not be immediately +obvious: italic text in examples is meant as a descriptive +placeholder for something else, usually information that you'll +provide. For example:

+
+$ echo "My name is your name"
+
+

Here you're expected to imagine replacing the text “your name†with +your actual name.

+
+
+

Ready?

+

Let's go!

+
+
+
+
+
+
Next: Getting Started on Microsoft Windows
+
or: Getting Started on Unix variants (e.g. Linux, MacOS)
+
+ +
+ + diff --git a/more/getting_started/index.rst b/more/getting_started/index.rst new file mode 100644 index 0000000000..23bfa7bd0b --- /dev/null +++ b/more/getting_started/index.rst @@ -0,0 +1,60 @@ +.. Copyright David Abrahams 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) + +============================ + |(logo)|__ Getting Started +============================ + +.. |(logo)| image:: ../../boost.png + :alt: Boost + :class: boost-logo + +__ ../../index.htm + +Welcome +------- + +Welcome to the Boost libraries! By the time you've completed this +tutorial, you'll be at least somewhat comfortable with the contents +of a Boost distribution and how to go about using it. + +What's Here +----------- + +This document is designed to be an *extremely* gentle introduction, +so we included a fair amount of material that may already be very +familiar to you. To keep things simple, we also left out some +information intermediate and advanced users will probably want. At +the end of this document, we'll refer you on to resources that can +help you pursue these topics further. + +Preliminaries +------------- + +We use one typographic convention that might not be immediately +obvious: *italic* text in examples is meant as a descriptive +placeholder for something else, usually information that you'll +provide. For example: + +.. parsed-literal:: + + **$** echo "My name is *your name*\ " + +Here you're expected to imagine replacing the text “your name†with +your actual name. + +Ready? +------ + +Let's go! + +.. footer:: + .. class:: nextpage + + | **Next:** `Getting Started on Microsoft Windows`__ + | **or:** `Getting Started on Unix variants (e.g. Linux, MacOS)`__ + +__ windows.html +__ unix-variants.html + diff --git a/more/getting_started/unix-variants.html b/more/getting_started/unix-variants.html new file mode 100644 index 0000000000..67db82e790 --- /dev/null +++ b/more/getting_started/unix-variants.html @@ -0,0 +1,791 @@ + + + + + + +Boost Getting Started on Unix Variants + + + + +
+

Getting Started on Unix Variants

+ + + + + + +
+

1   Get Boost

+

The most reliable way to get a copy of Boost is to download a +distribution from SourceForge:

+
    +

  1. Download boost_1_34_1.tar.bz2.

    +
    2. +

  2. In the directory where you want to put the Boost installation, +execute

    +
    +tar --bzip2 -xf /path/to/boost_1_34_1.tar.bz2
+
    +
    3. +
+
+

Other Packages

+

RedHat, Debian, and other distribution packagers supply Boost +library packages, however you may need to adapt these +instructions if you use third-party packages, because their +creators usually choose to break Boost up into several packages, +reorganize the directory structure of the Boost distribution, +and/or rename the library binaries.1 If you have +any trouble, we suggest using an official Boost distribution +from SourceForge.

+
+ + + +
+
+

2   The Boost Distribution

+

This is a sketch of the resulting directory structure:

+
+boost_1_34_1/ .................The “boost root directoryâ€
+   index.htm .........A copy of www.boost.org starts here
+   boost/ .........................All Boost Header files
+    
+   libs/ ............Tests, .cpps, docs, etc., by library
+     index.html ........Library documentation starts here
+     algorithm/
+     any/
+     array/
+                     …more libraries…
+   status/ .........................Boost-wide test suite
+   tools/ ...........Utilities, e.g. bjam, quickbook, bcp
+   more/ ..........................Policy documents, etc.
+   doc/ ...............A subset of all Boost library docs
+
+
+

Header Organization

+

The organization of Boost library headers isn't entirely uniform, +but most libraries follow a few patterns:

+
    +

  • Some older libraries and most very small libraries place all +public headers directly into boost/.

    +
    • +

  • Most libraries' public headers live in a subdirectory of +boost/, named after the library. For example, you'll find +the Python library's def.hpp header in

    +
    +boost/python/def.hpp.
+
    +
    • +

  • Some libraries have an “aggregate header†in boost/ that +#includes all of the library's other headers. For +example, Boost.Python's aggregate header is

    +
    +boost/python.hpp.
+
    +
    • +

  • Most libraries place private headers in a subdirectory called +detail/, or aux_/. Don't expect to find +anything you can use in these directories.

    +
    • +
+
+

It's important to note the following:

+
    +

  1. The path to the boost root directory (often /usr/local/boost_1_34_1) is +sometimes referred to as $BOOST_ROOT in documentation and +mailing lists .

    +
    2. +

  2. To compile anything in Boost, you need a directory containing +the boost/ subdirectory in your #include path.

    +
    3. +

  3. Since all of Boost's header files have the .hpp extension, +and live in the boost/ subdirectory of the boost root, your +Boost #include directives will look like:

    +
    +#include <boost/whatever.hpp>
+
    +

    or

    +
    +#include "boost/whatever.hpp"
+
    +

    depending on your preference regarding the use of angle bracket +includes.

    +
    4. +

  4. Don't be distracted by the doc/ subdirectory; it only +contains a subset of the Boost documentation. Start with +libs/index.html if you're looking for the whole enchilada.

    +
    5. +
+ + + +
+
+

3   Header-Only Libraries

+

The first thing many people want to know is, “how do I build +Boost?†The good news is that often, there's nothing to build.

+
+

Nothing to Build?

+

Most Boost libraries are header-only: they consist entirely +of header files containing templates and inline functions, and +require no separately-compiled library binaries or special +treatment when linking.

+
+ +

The only Boost libraries that must be built separately are:

+ +

A few libraries have optional separately-compiled binaries:

+
    +
  • Boost.DateTime has a binary component that is only needed if +you're using its to_string/from_string or serialization +features, or if you're targeting Visual C++ 6.x or Borland.
    • +
  • Boost.Graph also has a binary component that is only needed if +you intend to parse GraphViz files.
    • +
  • Boost.Test can be used in “header-only†or “separately compiled†+mode, although separate compilation is recommended for serious +use.
    • +
+ + + +
+
+

4   Build a Simple Program Using Boost

+

To keep things simple, let's start by using a header-only library. +The following program reads a sequence of integers from standard +input, uses Boost.Lambda to multiply each number by three, and +writes them to standard output:

+
+#include <boost/lambda/lambda.hpp>
+#include <iostream>
+#include <iterator>
+#include <algorithm>
+
+int main()
+{
+    using namespace boost::lambda;
+    typedef std::istream_iterator<int> in;
+
+    std::for_each(
+        in(std::cin), in(), std::cout << (_1 * 3) << " " );
+}
+
+

Copy the text of this program into a file called example.cpp.

+

Now, in the directory where you saved example.cpp, issue the +following command:

+
+c++ -I path/to/boost_1_34_1 example.cpp -o example
+
+

To test the result, type:

+
+echo 1 2 3 | ./example
+
+ + + +
+

4.1   Errors and Warnings

+

Don't be alarmed if you see compiler warnings originating in Boost +headers. We try to eliminate them, but doing so isn't always +practical.3 Errors are another matter. If you're +seeing compilation errors at this point in the tutorial, check to +be sure you've copied the example program correctly and that you've +correctly identified the Boost root directory.

+ + + +
+
+
+

5   Prepare to Use a Boost Library Binary

+

If you want to use any of the separately-compiled Boost libraries, +you'll need to acquire library binaries.

+
+

5.1   Easy Build and Install

+

Issue the following commands in the shell (don't type $; that +represents the shell's prompt):

+
+$ cd path/to/boost_1_34_1
+$ ./configure --help
+
+

Select your configuration options and invoke ./configure again +without the --help option. Unless you have write permission in +your system's /usr/local/ directory, you'll probably want to at +least use

+
+$ ./configure --prefix=path/to/installation/prefix
+
+

to install somewhere else. Also, consider using the +--show-libraries and --with-libraries= options to limit the +long wait you'll experience if you build everything. Finally,

+
+$ make install
+
+

will leave Boost binaries in the lib/ subdirectory of your +installation prefix. You will also find a copy of the Boost +headers in the include/ subdirectory of the installation +prefix, so you can henceforth use that directory as an #include +path in place of the Boost root directory.

+

skip to the next step

+
+
+

5.2   Or, Build Custom Binaries

+

If you're using a compiler other than your system's default, you'll +need to use Boost.Build to create binaries. You'll also +use this method if you need a nonstandard build variant (see the +Boost.Build documentation for more details).

+ + + +

Boost.Build is a text-based system for developing, testing, and +installing software. To use it, you'll need an executable called +bjam.

+ +
+

5.2.1   Get bjam

+

bjam is the command-line tool that drives the Boost Build +system. To build Boost binaries, you'll invoke bjam from the +Boost root.

+

Boost provides pre-compiled bjam executables for a variety of platforms. +Alternatively, you can build bjam yourself using these +instructions.

+
+
+

5.2.2   Identify Your Toolset

+

First, find the toolset corresponding to your compiler in the +following table.

+
+

Note

+

If you previously chose a toolset for the purposes of +building bjam, you should assume it won't work and instead +choose newly from the table below.

+
+ +++++ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Toolset +NameVendorNotes
accHewlett PackardOnly very recent versions are +known to work well with Boost
borlandBorland 
comoComeau ComputingUsing this toolset may +require configuring another +toolset to act as its backend
cwMetrowerks/FreeScaleThe CodeWarrior compiler. We +have not tested versions of +this compiler produced since +it was sold to FreeScale.
dmcDigital MarsAs of this Boost release, no +version of dmc is known to +handle Boost well.
darwinApple ComputerApple's version of the GCC +toolchain with support for +Darwin and MacOS X features +such as frameworks.
gccThe Gnu ProjectIncludes support for Cygwin +and MinGW compilers.
hp_cxxHewlett PackardTargeted at the Tru64 +operating system.
intelIntel 
kylixBorland 
msvcMicrosoft 
qccQNX Software Systems 
sunSunOnly very recent versions are +known to work well with +Boost.
vacppIBMThe VisualAge C++ compiler.
+

If you have multiple versions of a particular compiler installed, +you can append the version number to the toolset name, preceded by +a hyphen, e.g. intel-9.0 or +borland-5.4.3.

+
+
+

5.2.3   Select a Build Directory

+

Boost.Build will place all intermediate files it generates while +building into the build directory. If your Boost root +directory is writable, this step isn't strictly necessary: by +default Boost.Build will create a bin.v2/ subdirectory for that +purpose in your current working directory.

+
+
+

5.2.4   Invoke bjam

+

Change your current directory to the Boost root directory and +invoke bjam as follows:

+
+bjam --build-dir=build-directory --toolset=toolset-name stage
+
+

For example, your session might look like this:

+
+$ cd ~/boost_1_34_1
+$ bjam --build-dir=/tmp/build-boost --toolset=gcc stage
+
+ + + +

Building the special stage target places Boost +library binaries in the stage/ subdirectory of your build +directory.

+
+

Note

+

bjam is case-sensitive; it is important that all the +parts shown in bold type above be entirely lower-case.

+
+

For a description of other options you can pass when invoking +bjam, type:

+
+bjam --help
+
+

In particular, to limit the amount of time spent building, you may +be interested in:

+
    +
  • reviewing the list of library names with --show-libraries
    • +
  • limiting which libraries get built with the --with-library-name or --without-library-name options
    • +
  • choosing a specific build variant by adding release or +debug to the command line.
    • +
+
+
+
+

5.3   Expected Build Output

+

During the process of building Boost libraries, you can expect to +see some messages printed on the console. These may include

+
    +

  • Notices about Boost library configuration—for example, the Regex +library outputs a message about ICU when built without Unicode +support, and the Python library may be skipped without error (but +with a notice) if you don't have Python installed.

    +
    • +

  • Messages from the build tool that report the number of targets +that were built or skipped. Don't be surprised if those numbers +don't make any sense to you; there are many targets per library.

    +
    • +

  • Build action messages describing what the tool is doing, which +look something like:

    +
    +toolset-name.c++ long/path/to/file/being/built
+
    +
    • +

  • Compiler warnings.

    +
    • +
+
+
+

5.4   In Case of Build Errors

+

The only error messages you see when building Boost—if any—should +be related to the IOStreams library's support of zip and bzip2 +formats as described here. Install the relevant development +packages for libz and libbz2 if you need those features. Other +errors when building Boost libraries are cause for concern.

+

If it seems like the build system can't find your compiler and/or +linker, consider setting up a user-config.jam file as described +in the Boost.Build documentation. If that isn't your problem or +the user-config.jam file doesn't work for you, please address +questions about configuring Boost for your compiler to the +Boost.Build mailing list.

+ + + +
+
+ +
+

7   Conclusion and Further Resources

+

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 +we may have a “Book 2 in the Getting Started series†that addresses +them. Until then, we suggest you pursue the following resources. +If you can't find what you need, or there's anything we can do to +make this document clearer, please post it to the Boost Users' +mailing list.

+ +
+

Onward

+
+

Good luck, and have fun!

+

—the Boost Developers

+
+
+
+ + + + + +
[1]

If developers of Boost packages would like to work +with us to make sure these instructions can be used with their +packages, we'd be glad to help. Please make your interest known +to the Boost developers' list.

+
+ + + + + +
[2]That option is a dash followed by a lowercase “L†+character, which looks very much like a numeral 1 in some fonts.
+ + + + + + + + +
[3]Remember that warnings are specific to each compiler +implementation. The developer of a given Boost library might +not have access to your compiler. Also, some warnings are +extremely difficult to eliminate in generic code, to the point +where it's not worth the trouble. Finally, some compilers don't +have any source code mechanism for suppressing warnings.
+ + + + + +
[4]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.
+ + + + + +
[5]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 +compiled code, you can't count on that with Boost libraries.
+ + + + + +
[6]This feature of STLPort is deprecated because it's +impossible to make it work transparently to the user; we don't +recommend it.
+ + + + + + + + + + + + + + +
+
+ + diff --git a/more/getting_started/unix-variants.rst b/more/getting_started/unix-variants.rst new file mode 100644 index 0000000000..4cf74c466e --- /dev/null +++ b/more/getting_started/unix-variants.rst @@ -0,0 +1,236 @@ +.. Copyright David Abrahams 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) + +============================================= + |(logo)|__ Getting Started on Unix Variants +============================================= + +.. meta:: + :description: Getting Started with Boost on Unix Variants (including Linux and MacOS) + +.. |(logo)| image:: ../../boost.png + :alt: Boost + :class: boost-logo + +__ ../../index.htm + +.. section-numbering:: + +.. maybe we don't need this + .. Admonition:: A note to Cygwin_ and MinGW_ users + + If you plan to build from the Cygwin_ bash shell, you're in the + right place. If you plan to use your tools from the Windows + command prompt, you should follow the instructions for `getting + started on Windows`_. Other command shells, such as MinGW_\ 's + MSYS, are not supported—they may or may not work. + + .. _`Getting Started on Windows`: windows.html + .. _Cygwin: http://www.cygwin.com + .. _MinGW: http://mingw.org + +.. Contents:: Index + +Get Boost +========= + +The most reliable way to get a copy of Boost is to download a +distribution from SourceForge_: + +.. _SourceForge: `sf-download`_ + +1. Download |boost.tar.bz2|_. + +2. In the directory where you want to put the Boost installation, + execute + + .. parsed-literal:: + + tar --bzip2 -xf */path/to/*\ |boost_ver|\ .tar.bz2 + +.. |boost.tar.bz2| replace:: |boost_ver|\ ``.tar.bz2`` + +.. _`boost.tar.bz2`: `sf-download`_ + +.. Admonition:: Other Packages + + RedHat, Debian, and other distribution packagers supply Boost + library packages, however you may need to adapt these + instructions if you use third-party packages, because their + creators usually choose to break Boost up into several packages, + reorganize the directory structure of the Boost distribution, + and/or rename the library binaries. [#packagers]_ If you have + any trouble, we suggest using an official Boost distribution + from SourceForge_. + +.. include:: detail/distro.rst + +.. include:: detail/header-only.rst + +.. include:: detail/build-simple-head.rst + +Now, in the directory where you saved ``example.cpp``, issue the +following command: + +.. parsed-literal:: + + c++ -I |root| example.cpp -o example + +To test the result, type: + +.. parsed-literal:: + + echo 1 2 3 | ./example + +.. include:: detail/errors-and-warnings.rst + +.. include:: detail/binary-head.rst + +Easy Build and Install +---------------------- + +Issue the following commands in the shell (don't type ``$``; that +represents the shell's prompt): + +.. parsed-literal:: + + **$** cd |root| + **$** ./configure --help + +Select your configuration options and invoke ``./configure`` again +without the ``--help`` option. Unless you have write permission in +your system's ``/usr/local/`` directory, you'll probably want to at +least use + +.. parsed-literal:: + + **$** ./configure **--prefix=**\ *path*\ /\ *to*\ /\ *installation*\ /\ *prefix* + +to install somewhere else. Also, consider using the +``--show-libraries`` and ``--with-libraries=`` options to limit the +long wait you'll experience if you build everything. Finally, + +.. parsed-literal:: + + **$** make install + +will leave Boost binaries in the ``lib/`` subdirectory of your +installation prefix. You will also find a copy of the Boost +headers in the ``include/`` subdirectory of the installation +prefix, so you can henceforth use that directory as an ``#include`` +path in place of the Boost root directory. + +|next|__ + +__ `Link Your Program to a Boost Library`_ + +Or, Build Custom Binaries +------------------------- + +If you're using a compiler other than your system's default, you'll +need to use Boost.Build_ to create binaries. You'll also +use this method if you need a nonstandard build variant (see the +`Boost.Build documentation`_ for more details). + +.. include:: detail/build-from-source-head.rst + +For example, your session might look like this: + +.. parsed-literal:: + + $ cd ~/|boost_ver| + $ bjam **--build-dir=**\ /tmp/build-boost **--toolset=**\ gcc stage + +.. include:: detail/build-from-source-tail.rst + +.. include:: detail/link-head.rst + +There are two main ways to link to libraries: + +A. You can specify the full path to each library: + + .. parsed-literal:: + + $ c++ -I |root| example.cpp -o example **\\** + **~/boost/lib/libboost_regex-gcc34-mt-d-1_34.a** + +B. You can separately specify a directory to search (with ``-L``\ + *directory*) and a library name to search for (with ``-l``\ + *library*, [#lowercase-l]_ dropping the filename's leading ``lib`` and trailing + suffix (``.a`` in this case): + + .. parsed-literal:: + + $ c++ -I |root| example.cpp -o example **\\** + **-L~/boost/lib/ -lboost_regex-gcc34-mt-d-1_34** + + As you can see, this method is just as terse as method A for one + library; it *really* pays off when you're using multiple + libraries from the same directory. Note, however, that if you + use this method with a library that has both static (``.a``) and + dynamic (``.so``) builds, the system may choose one + automatically for you unless you pass a special option such as + ``-static`` on the command line. + +In both cases above, the bold text is what you'd add to `the +command lines we explored earlier`__. + +__ `build a simple program using boost`_ + +Library Naming +-------------- + +.. include:: detail/library-naming.rst + +.. include:: detail/test-head.rst + +If you linked to a shared library, you may need to prepare some +platform-specific settings so that the system will be able to find +and load it when your program is run. Most platforms have an +environment variable to which you can add the directory containing +the library. On many platforms (Linux, FreeBSD) that variable is +``LD_LIBRARY_PATH``, but on MacOS it's ``DYLD_LIBRARY_PATH``, and +on Cygwin it's simply ``PATH``. In most shells other than ``csh`` +and ``tcsh``, you can adjust the variable as follows (again, don't +type the ``$``\ —that represents the shell prompt): + +.. parsed-literal:: + + **$** *VARIABLE_NAME*\ =\ *path/to/lib/directory*\ :${\ *VARIABLE_NAME*\ } + **$** export *VARIABLE_NAME* + +On ``csh`` and ``tcsh``, it's + +.. parsed-literal:: + + **$** setenv *VARIABLE_NAME* *path/to/lib/directory*\ :${\ *VARIABLE_NAME*\ } + +Once the necessary variable (if any) is set, you can run your +program as follows: + +.. parsed-literal:: + + **$** *path*\ /\ *to*\ /\ *compiled*\ /\ example < *path*\ /\ *to*\ /\ jayne.txt + +The program should respond with the email subject, “Will Success +Spoil Rock Hunter?†+ +.. include:: detail/conclusion.rst + +------------------------------ + +.. [#packagers] If developers of Boost packages would like to work + with us to make sure these instructions can be used with their + packages, we'd be glad to help. Please make your interest known + to the `Boost developers' list`_. + + .. _Boost developers' list: ../../more/mailing_lists.htm#main + +.. [#lowercase-l] That option is a dash followed by a lowercase “L†+ character, which looks very much like a numeral 1 in some fonts. + +.. include:: detail/common-footnotes.rst +.. include:: detail/release-variables.rst +.. include:: detail/common-unix.rst +.. include:: detail/links.rst diff --git a/more/getting_started/windows.html b/more/getting_started/windows.html new file mode 100644 index 0000000000..1bf314540f --- /dev/null +++ b/more/getting_started/windows.html @@ -0,0 +1,881 @@ + + + + + + +Boost Getting Started on Windows + + + +
+

Getting Started on Windows

+ + + + +
+

A note to Cygwin and MinGW users

+

If you plan to use your tools from the Windows command prompt, +you're in the right place. If you plan to build from the Cygwin +bash shell, you're actually running on a POSIX platform and +should follow the instructions for getting started on Unix +variants. Other command shells, such as MinGW's MSYS, are +not supported—they may or may not work.

+
+ +
+

1   Get Boost

+

The easiest way to get a copy of Boost is to use the installer +provided by Boost Consulting. We especially recommend this +method if you use Microsoft Visual Studio .NET 2003 or Microsoft +Visual Studio 2005, because the installer can download and install +precompiled library binaries, saving you the trouble of building +them yourself. To complete this tutorial, you'll need to at least +install the Boost.Regex binaries when given the option.

+

If you're using an earlier version of Visual Studio or some other +compiler, or if you prefer to build everything yourself, you can +download boost_1_34_1.exe and run it to install a complete Boost +distribution.1

+ + + +
+
+

2   The Boost Distribution

+

This is a sketch of the resulting directory structure:

+
+boost_1_34_1\ .................The “boost root directoryâ€
+   index.htm .........A copy of www.boost.org starts here
+   boost\ .........................All Boost Header files
+   lib\ .....................precompiled library binaries
+   libs\ ............Tests, .cpps, docs, etc., by library
+     index.html ........Library documentation starts here
+     algorithm\
+     any\
+     array\
+                     …more libraries…
+   status\ .........................Boost-wide test suite
+   tools\ ...........Utilities, e.g. bjam, quickbook, bcp
+   more\ ..........................Policy documents, etc.
+   doc\ ...............A subset of all Boost library docs
+
+
+

Header Organization

+

The organization of Boost library headers isn't entirely uniform, +but most libraries follow a few patterns:

+
    +

  • Some older libraries and most very small libraries place all +public headers directly into boost\.

    +
    • +

  • Most libraries' public headers live in a subdirectory of +boost\, named after the library. For example, you'll find +the Python library's def.hpp header in

    +
    +boost\python\def.hpp.
+
    +
    • +

  • Some libraries have an “aggregate header†in boost\ that +#includes all of the library's other headers. For +example, Boost.Python's aggregate header is

    +
    +boost\python.hpp.
+
    +
    • +

  • Most libraries place private headers in a subdirectory called +detail\, or aux_\. Don't expect to find +anything you can use in these directories.

    +
    • +
+
+

It's important to note the following:

+
    +

  1. The path to the boost root directory (often C:\Program Files\boost\boost_1_34_1) is +sometimes referred to as $BOOST_ROOT in documentation and +mailing lists .

    +
    2. +

  2. To compile anything in Boost, you need a directory containing +the boost\ subdirectory in your #include path. Specific steps for setting up #include +paths in Microsoft Visual Studio follow later in this document; +if you use another IDE, please consult your product's +documentation for instructions.

    +
    3. +

  3. Since all of Boost's header files have the .hpp extension, +and live in the boost\ subdirectory of the boost root, your +Boost #include directives will look like:

    +
    +#include <boost/whatever.hpp>
+
    +

    or

    +
    +#include "boost/whatever.hpp"
+
    +

    depending on your preference regarding the use of angle bracket +includes. Even Windows users can (and, for +portability reasons, probably should) use forward slashes in +#include directives; your compiler doesn't care.

    +
    4. +

  4. Don't be distracted by the doc\ subdirectory; it only +contains a subset of the Boost documentation. Start with +libs\index.html if you're looking for the whole enchilada.

    +
    5. +
+ + + +
+
+

3   Header-Only Libraries

+

The first thing many people want to know is, “how do I build +Boost?†The good news is that often, there's nothing to build.

+
+

Nothing to Build?

+

Most Boost libraries are header-only: they consist entirely +of header files containing templates and inline functions, and +require no separately-compiled library binaries or special +treatment when linking.

+
+ +

The only Boost libraries that must be built separately are:

+ +

A few libraries have optional separately-compiled binaries:

+
    +
  • Boost.DateTime has a binary component that is only needed if +you're using its to_string/from_string or serialization +features, or if you're targeting Visual C++ 6.x or Borland.
    • +
  • Boost.Graph also has a binary component that is only needed if +you intend to parse GraphViz files.
    • +
  • Boost.Test can be used in “header-only†or “separately compiled†+mode, although separate compilation is recommended for serious +use.
    • +
+ + + +
+
+

4   Build a Simple Program Using Boost

+

To keep things simple, let's start by using a header-only library. +The following program reads a sequence of integers from standard +input, uses Boost.Lambda to multiply each number by three, and +writes them to standard output:

+
+#include <boost/lambda/lambda.hpp>
+#include <iostream>
+#include <iterator>
+#include <algorithm>
+
+int main()
+{
+    using namespace boost::lambda;
+    typedef std::istream_iterator<int> in;
+
+    std::for_each(
+        in(std::cin), in(), std::cout << (_1 * 3) << " " );
+}
+
+

Copy the text of this program into a file called example.cpp.

+
+

Note

+

To build the examples in this guide, you can use an +Integrated Development Environment (IDE) like Visual Studio, or +you can issue commands from the command prompt. Since every +IDE and compiler has different options and Microsoft's are by +far the dominant compilers on Windows, we only give specific +directions here for Visual Studio 2005 and .NET 2003 IDEs and +their respective command prompt compilers (using the command +prompt is a bit simpler). If you are using another compiler or +IDE, it should be relatively easy to adapt these instructions to +your environment.

+
+
+

Command Prompt Basics

+

In Windows, a command-line tool is invoked by typing its name, +optionally followed by arguments, into a Command Prompt window +and pressing the Return (or Enter) key.

+

To open a generic Command Prompt, click the Start menu +button, click Run, type “cmdâ€, and then click OK.

+

All commands are executed within the context of a current +directory in the filesystem. To set the current directory, +type:

+
+cd path\to\some\directory
+
+

followed by Return. For example,

+
+cd C:\Program Files\boost\boost_1_34_1
+
+

Long commands can be continued across several lines by typing a +caret (^) at the end of all but the last line. Some examples +on this page use that technique to save horizontal space.

+
+
+

4.1   Build From the Visual Studio IDE

+
    +

  • From Visual Studio's File menu, select New > Project…

    +
    • +

  • In the left-hand pane of the resulting New Project dialog, +select Visual C++ > Win32.

    +
    • +

  • In the right-hand pane, select Win32 Console Application +(VS8.0) or Win32 Console Project (VS7.1).

    +
    • +

  • In the name field, enter “exampleâ€

    +
    • +

  • Right-click example in the Solution Explorer pane and +select Properties from the resulting pop-up menu

    +
    • +

  • In Configuration Properties > C/C++ > General > Additional Include +Directories, enter the path to the Boost root directory, for example

    +
    +

    C:\Program Files\boost\boost_1_34_1

    +
    +
    • +

  • In Configuration Properties > C/C++ > Precompiled Headers, change +Use Precompiled Header (/Yu) to Not Using Precompiled +Headers.3

    +
    • +

  • Replace the contents of the example.cpp generated by the IDE +with the example code above.

    +
    • +

  • From the Build menu, select Build Solution.

    +
    • +
+

To test your application, hit the F5 key and type the following +into the resulting window, followed by the Return key:

+
+1 2 3
+
+

Then hold down the control key and press "Z", followed by the +Return key.

+

skip to the next step

+
+
+

4.2   Or, Build From the Command Prompt

+

From your computer's Start menu, if you are a Visual +Studio 2005 user, select

+
+All Programs > Microsoft Visual Studio 2005 +> Visual Studio Tools > Visual Studio 2005 Command Prompt
+

or, if you're a Visual Studio .NET 2003 user, select

+
+All Programs > Microsoft Visual Studio .NET 2003 +> Visual Studio .NET Tools > Visual Studio .NET 2003 Command Prompt
+

to bring up a special command prompt window set up for the +Visual Studio compiler. In that window, set the current +directory to a suitable location for creating some temporary +files and type the following command followed by the Return key:

+
+cl /EHsc /I path\to\boost_1_34_1 path\to\example.cpp
+
+

To test the result, type:

+
+echo 1 2 3 | example
+
+ + + +
+
+

4.3   Errors and Warnings

+

Don't be alarmed if you see compiler warnings originating in Boost +headers. We try to eliminate them, but doing so isn't always +practical.5 Errors are another matter. If you're +seeing compilation errors at this point in the tutorial, check to +be sure you've copied the example program correctly and that you've +correctly identified the Boost root directory.

+ + + +
+
+
+

5   Prepare to Use a Boost Library Binary

+

If you want to use any of the separately-compiled Boost libraries, +you'll need to acquire library binaries.

+
+

5.1   Install Visual Studio (2005 or .NET 2003) Binaries

+

The installer supplied by Boost Consulting will download and +install pre-compiled binaries into the lib\ subdirectory of the +boost root, typically C:\Program Files\boost\boost_1_34_1\lib\. If you installed +all variants of the Boost.Regex binary, you're done with this +step. Otherwise, please run the installer again and install them +now.

+

skip to the next step

+
+
+

5.2   Or, Build Binaries From Source

+

If you're using an earlier version of Visual C++, or a compiler +from another vendor, you'll need to use Boost.Build to create your +own binaries.

+ + + +

Boost.Build is a text-based system for developing, testing, and +installing software. To use it, you'll need an executable called +bjam.

+ +
+

5.2.1   Get bjam

+

bjam is the command-line tool that drives the Boost Build +system. To build Boost binaries, you'll invoke bjam from the +Boost root.

+

Boost provides pre-compiled bjam executables for a variety of platforms. +Alternatively, you can build bjam yourself using these +instructions.

+
+
+

5.2.2   Identify Your Toolset

+

First, find the toolset corresponding to your compiler in the +following table.

+
+

Note

+

If you previously chose a toolset for the purposes of +building bjam, you should assume it won't work and instead +choose newly from the table below.

+
+ +++++ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Toolset +NameVendorNotes
accHewlett PackardOnly very recent versions are +known to work well with Boost
borlandBorland 
comoComeau ComputingUsing this toolset may +require configuring another +toolset to act as its backend
cwMetrowerks/FreeScaleThe CodeWarrior compiler. We +have not tested versions of +this compiler produced since +it was sold to FreeScale.
dmcDigital MarsAs of this Boost release, no +version of dmc is known to +handle Boost well.
darwinApple ComputerApple's version of the GCC +toolchain with support for +Darwin and MacOS X features +such as frameworks.
gccThe Gnu ProjectIncludes support for Cygwin +and MinGW compilers.
hp_cxxHewlett PackardTargeted at the Tru64 +operating system.
intelIntel 
kylixBorland 
msvcMicrosoft 
qccQNX Software Systems 
sunSunOnly very recent versions are +known to work well with +Boost.
vacppIBMThe VisualAge C++ compiler.
+

If you have multiple versions of a particular compiler installed, +you can append the version number to the toolset name, preceded by +a hyphen, e.g. intel-9.0 or +borland-5.4.3. On Windows, append a version +number even if you only have one version installed (unless you +are using the msvc or gcc toolsets, which have special version +detection code) or auto-linking will fail.

+
+
+

5.2.3   Select a Build Directory

+

Boost.Build will place all intermediate files it generates while +building into the build directory. If your Boost root +directory is writable, this step isn't strictly necessary: by +default Boost.Build will create a bin.v2/ subdirectory for that +purpose in your current working directory.

+
+
+

5.2.4   Invoke bjam

+

Change your current directory to the Boost root directory and +invoke bjam as follows:

+
+bjam --build-dir=build-directory --toolset=toolset-name stage
+
+

For example, your session might look like this:4

+
+C:\WINDOWS> cd C:\Program Files\boost\boost_1_34_1
+C:\Program Files\boost\boost_1_34_1> bjam ^
+More? --build-dir=C:\temp\build-boost ^
+More? --toolset=msvc stage
+
+ + + +

Building the special stage target places Boost +library binaries in the stage\ subdirectory of your build +directory.

+
+

Note

+

bjam is case-sensitive; it is important that all the +parts shown in bold type above be entirely lower-case.

+
+

For a description of other options you can pass when invoking +bjam, type:

+
+bjam --help
+
+

In particular, to limit the amount of time spent building, you may +be interested in:

+
    +
  • reviewing the list of library names with --show-libraries
    • +
  • limiting which libraries get built with the --with-library-name or --without-library-name options
    • +
  • choosing a specific build variant by adding release or +debug to the command line.
    • +
+
+
+
+

5.3   Expected Build Output

+

During the process of building Boost libraries, you can expect to +see some messages printed on the console. These may include

+
    +

  • Notices about Boost library configuration—for example, the Regex +library outputs a message about ICU when built without Unicode +support, and the Python library may be skipped without error (but +with a notice) if you don't have Python installed.

    +
    • +

  • Messages from the build tool that report the number of targets +that were built or skipped. Don't be surprised if those numbers +don't make any sense to you; there are many targets per library.

    +
    • +

  • Build action messages describing what the tool is doing, which +look something like:

    +
    +toolset-name.c++ long/path/to/file/being/built
+
    +
    • +

  • Compiler warnings.

    +
    • +
+
+
+

5.4   In Case of Build Errors

+

The only error messages you see when building Boost—if any—should +be related to the IOStreams library's support of zip and bzip2 +formats as described here. Install the relevant development +packages for libz and libbz2 if you need those features. Other +errors when building Boost libraries are cause for concern.

+

If it seems like the build system can't find your compiler and/or +linker, consider setting up a user-config.jam file as described +in the Boost.Build documentation. If that isn't your problem or +the user-config.jam file doesn't work for you, please address +questions about configuring Boost for your compiler to the +Boost.Build mailing list.

+ + + +
+
+ +
+

7   Conclusion and Further Resources

+

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 +we may have a “Book 2 in the Getting Started series†that addresses +them. Until then, we suggest you pursue the following resources. +If you can't find what you need, or there's anything we can do to +make this document clearer, please post it to the Boost Users' +mailing list.

+ +
+

Onward

+
+

Good luck, and have fun!

+

—the Boost Developers

+
+
+
+ + + + + +
[1]If you prefer not to download executable programs, +download boost_1_34_1.zip and use an external tool to decompress +it. We don't recommend using Windows' built-in decompression as +it can be painfully slow for large archives.
+ + + + + +
[2]If you used the installer from Boost +Consulting and deselected “Source and Documentation†(it's +selected by default), you won't see the libs/ subdirectory. +That won't affect your ability to use precompiled binaries, but +you won't be able to rebuild libraries from scratch.
+ + + + + +
[3]There's no problem using Boost with precompiled headers; +these instructions merely avoid precompiled headers because it +would require Visual Studio-specific changes to the source code +used in the examples.
+ + + + + +
[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.
+ + + + + + + + +
[5]Remember that warnings are specific to each compiler +implementation. The developer of a given Boost library might +not have access to your compiler. Also, some warnings are +extremely difficult to eliminate in generic code, to the point +where it's not worth the trouble. Finally, some compilers don't +have any source code mechanism for suppressing warnings.
+ + + + + +
[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 +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 +compiled code, you can't count on that with Boost libraries.
+ + + + + +
[8]This feature of STLPort is deprecated because it's +impossible to make it work transparently to the user; we don't +recommend it.
+ + + + + + + + + + + + + + +
+
+ + diff --git a/more/getting_started/windows.rst b/more/getting_started/windows.rst new file mode 100644 index 0000000000..1750a00ab9 --- /dev/null +++ b/more/getting_started/windows.rst @@ -0,0 +1,316 @@ +.. Copyright David Abrahams 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) + +======================================= + |(logo)|__ Getting Started on Windows +======================================= + +.. |(logo)| image:: ../../boost.png + :alt: Boost + :class: boost-logo + +__ ../../index.htm + +.. section-numbering:: + +.. Admonition:: A note to Cygwin_ and MinGW_ users + + If you plan to use your tools from the Windows command prompt, + you're in the right place. If you plan to build from the Cygwin_ + bash shell, you're actually running on a POSIX platform and + should follow the instructions for `getting started on Unix + variants`_. Other command shells, such as MinGW_\ 's MSYS, are + not supported—they may or may not work. + + .. _`Getting Started on Unix Variants`: unix-variants.html + .. _Cygwin: http://www.cygwin.com + .. _MinGW: http://mingw.org + +.. Contents:: Index + +Get Boost +========= + +The easiest way to get a copy of Boost is to use the `installer`_ +provided by `Boost Consulting`_. We especially recommend this +method if you use Microsoft Visual Studio .NET 2003 or Microsoft +Visual Studio 2005, because the installer can download and install +precompiled library binaries, saving you the trouble of building +them yourself. To complete this tutorial, you'll need to at least +install the Boost.Regex_ binaries when given the option. + +.. _installer: http://www.boost-consulting.com/download/windows +.. _Boost Consulting: http://www.boost-consulting.com + +If you're using an earlier version of Visual Studio or some other +compiler, or if you prefer to build everything yourself, you can +download |boost.exe|_ and run it to install a complete Boost +distribution. [#zip]_ + +.. |boost.exe| replace:: |boost_ver|\ ``.exe`` + +.. _`boost.exe`: `sf-download`_ + +.. include:: detail/distro.rst + +.. include:: detail/header-only.rst + +.. include:: detail/build-simple-head.rst + +.. _`command prompt`: +.. _`command-line tool`: + +.. Note:: To build the examples in this guide, you can use an + Integrated Development Environment (IDE) like Visual Studio, or + you can issue commands from the `command prompt`_. Since every + IDE and compiler has different options and Microsoft's are by + far the dominant compilers on Windows, we only give specific + directions here for Visual Studio 2005 and .NET 2003 IDEs and + their respective command prompt compilers (using the command + prompt is a bit simpler). If you are using another compiler or + IDE, it should be relatively easy to adapt these instructions to + your environment. + +.. sidebar:: Command Prompt Basics + :class: small + + In Windows, a command-line tool is invoked by typing its name, + optionally followed by arguments, into a *Command Prompt* window + and pressing the Return (or Enter) key. + + To open a generic *Command Prompt*, click the *Start* menu + button, click *Run*, type “cmdâ€, and then click *OK*. + + .. _current directory: + + All commands are executed within the context of a **current + directory** in the filesystem. To set the current directory, + type: + + .. parsed-literal:: + + cd *path*\ \\\ *to*\ \\\ *some*\ \\\ *directory* + + followed by Return. For example, + + .. parsed-literal:: + + cd |default-root| + + Long commands can be continued across several lines by typing a + caret (``^``) at the end of all but the last line. Some examples + on this page use that technique to save horizontal space. + +.. _vs-header-only: + +Build From the Visual Studio IDE +-------------------------------- + +* From Visual Studio's *File* menu, select *New* > *Project…* +* In the left-hand pane of the resulting *New Project* dialog, + select *Visual C++* > *Win32*. +* In the right-hand pane, select *Win32 Console Application* + (VS8.0) or *Win32 Console Project* (VS7.1). +* In the *name* field, enter “example†+* Right-click **example** in the *Solution Explorer* pane and + select *Properties* from the resulting pop-up menu +* In *Configuration Properties* > *C/C++* > *General* > *Additional Include + Directories*, enter the path to the Boost root directory, for example + + |default-root| + +* In *Configuration Properties* > *C/C++* > *Precompiled Headers*, change + *Use Precompiled Header (/Yu)* to *Not Using Precompiled + Headers*. [#pch]_ +* Replace the contents of the ``example.cpp`` generated by the IDE + with the example code above. +* From the *Build* menu, select *Build Solution*. + +To test your application, hit the F5 key and type the following +into the resulting window, followed by the Return key:: + + 1 2 3 + +Then hold down the control key and press "Z", followed by the +Return key. + +|next|__ + +__ `Errors and Warnings`_ + +Or, Build From the Command Prompt +--------------------------------- + +From your computer's *Start* menu, if you are a Visual +Studio 2005 user, select + + *All Programs* > *Microsoft Visual Studio 2005* + > *Visual Studio Tools* > *Visual Studio 2005 Command Prompt* + +or, if you're a Visual Studio .NET 2003 user, select + + *All Programs* > *Microsoft Visual Studio .NET 2003* + > *Visual Studio .NET Tools* > *Visual Studio .NET 2003 Command Prompt* + +to bring up a special `command prompt`_ window set up for the +Visual Studio compiler. In that window, set the `current +directory`_ to a suitable location for creating some temporary +files and type the following command followed by the Return key: + +.. parsed-literal:: + + cl /EHsc /I |root| *path*\ \\\ *to*\ \\example.cpp + +To test the result, type: + +.. parsed-literal:: + + echo 1 2 3 | example + +.. include:: detail/errors-and-warnings.rst + +.. include:: detail/binary-head.rst + +Install Visual Studio (2005 or .NET 2003) Binaries +-------------------------------------------------- + +The installer_ supplied by Boost Consulting will download and +install pre-compiled binaries into the ``lib\`` subdirectory of the +boost root, typically |default-root|\ ``\lib\``. If you installed +all variants of the Boost.Regex_ binary, you're done with this +step. Otherwise, please run the installer again and install them +now. + +|next|__ + +__ `Link Your Program to a Boost Library`_ + +Or, Build Binaries From Source +------------------------------ + +If you're using an earlier version of Visual C++, or a compiler +from another vendor, you'll need to use Boost.Build_ to create your +own binaries. + +.. include:: detail/build-from-source-head.rst + +For example, your session might look like this: [#continuation]_ + +.. parsed-literal:: + + C:\\WINDOWS> cd |default-root| + |default-root|> bjam **^** + More? **--build-dir=**\ C:\\temp\\build-boost **^** + More? **--toolset=**\ msvc stage + +.. include:: detail/build-from-source-tail.rst + +.. _auto-linking: + +.. include:: detail/link-head.rst + +.. Admonition:: Auto-Linking + + Most Windows compilers and linkers have so-called “auto-linking + support,†which eliminates the second challenge. Special code in + Boost header files detects your compiler options and uses that + information to encode the name of the correct library into your + object files; the linker selects the library with that name from + the directories you've told it to search. + + The GCC toolchains (Cygwin and MinGW) are notable exceptions; + GCC users should refer to the `linking instructions for Unix + variant OSes`__ for the appropriate command-line options to use. + +__ unix-variants.html#link-your-program-to-a-boost-library + + +Link From Within the Visual Studio IDE +-------------------------------------- + +Starting with the `header-only example project`__ we created +earlier: + +__ vs-header-only_ + +1. Right-click **example** in the *Solution Explorer* pane and + select *Properties* from the resulting pop-up menu +2. In *Configuration Properties* > *Linker* > *Additional Library + Directories*, enter the path to the Boost binaries, + e.g. |default-root|\ ``\lib\``. +3. From the *Build* menu, select *Build Solution*. + +|next|__ + +__ `Test Your Program`_ + +Or, Link From the Command Prompt +-------------------------------- + +For example, we can compile and link the above program from the +Visual C++ command-line by simply adding the **bold** text below to +the command line we used earlier, assuming your Boost binaries are +in |default-root|\ ``\lib``: + +.. parsed-literal:: + + cl /EHsc /I |root| example.cpp **^** + **/link /LIBPATH:** |default-root-bold|\ **\\lib** + +Library Naming +-------------- + +.. Note:: If, like Visual C++, your compiler supports auto-linking, + you can probably |next|__. + + __ `Test Your Program`_ + +.. include:: detail/library-naming.rst + +.. include:: detail/test-head.rst + +Now, in a `command prompt`_ window, type: + +.. parsed-literal:: + + *path*\ \\\ *to*\ \\\ *compiled*\ \\example < *path*\ \\\ *to*\ \\\ jayne.txt + +The program should respond with the email subject, “Will Success +Spoil Rock Hunter?†+ +.. include:: detail/conclusion.rst + +------------------------------ + +.. [#zip] If you prefer not to download executable programs, + download |boost.zip|_ and use an external tool to decompress + it. We don't recommend using Windows' built-in decompression as + it can be painfully slow for large archives. + +.. [#installer-src] If you used the installer_ from Boost + Consulting and deselected “Source and Documentation†(it's + selected by default), you won't see the ``libs/`` subdirectory. + That won't affect your ability to use precompiled binaries, but + you won't be able to rebuild libraries from scratch. + +.. [#pch] There's no problem using Boost with precompiled headers; + these instructions merely avoid precompiled headers because it + would require Visual Studio-specific changes to the source code + used in the examples. + +.. [#continuation] 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. + +.. |boost.zip| replace:: |boost_ver|\ ``.zip`` + +.. _`boost.zip`: `sf-download`_ + + +.. include:: detail/common-footnotes.rst +.. include:: detail/release-variables.rst +.. include:: detail/common-windows.rst +.. include:: detail/links.rst diff --git a/more/google_logo_25wht.gif b/more/google_logo_25wht.gif new file mode 100644 index 0000000000..151f527a95 Binary files /dev/null and b/more/google_logo_25wht.gif differ diff --git a/more/header.htm b/more/header.htm new file mode 100644 index 0000000000..3df5ceee7f --- /dev/null +++ b/more/header.htm @@ -0,0 +1,103 @@ + + + + + +Boost Header policy + + + + + + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+

Boost Header Policy

+

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. +

    +
  • Header filenames should have a .hpp (lowercase) extension. 
    • +
  • Unless multiple inclusion is intended, wrap the header in #ifndef guards. + Use a naming convention that minimizes the chance of clashes + with macro names from other's code.  The sample + header uses the Boost convention of all uppercase letters, with the + header name prefixed by the namespace name, and suffixed with HPP, separated + by underscores.
    • +
  • Wrap the header contents in a namespace to prevent global namespace + pollution. The namespace approach to pollution control is strongly preferred + to older approaches such as adding funny prefixes to global names.  + Libraries which are designed to work well with other Boost libraries should + be placed in namespace boost.
    • + +
  • Make sure that a translation unit consisting of just the + contents of the header file will compile successfully.
    • + +
  • Place the header file in a sub-directory to prevent conflict with + identically named header files in other libraries.  The parent + directory is added to the compiler's include search path.  Then both + your code and user code specifies the sub-directory in #include + directives.  Thus the header sample header  + would be included by #include <boost/furball.hpp>
    • +
  • The preferred ordering for class definitions is public members, protected + members, and finally private members.
    • +
  • Include the boost/config.hpp configuration + header if there is a need to deal with compiler or platform + configuration issues.
    • +
+

Sample Header

+
//  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
+

Coding Style

+

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/more/imp_vars.htm b/more/imp_vars.htm new file mode 100644 index 0000000000..0b6101273b --- /dev/null +++ b/more/imp_vars.htm @@ -0,0 +1,211 @@ + + + + + + + +Boost Implementation Variations + + + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+

Boost Implementation Variations

+

Separation of interface and implementation

+

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."

+ +

Implementation variations

+ +

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.  

+

Boost policy

+

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.

+ +

Techniques for providing implementation variations

+ +

Several techniques may be used to provide implementation variations. Each is +appropriate in some situations, and not appropriate in other situations.

+

Single general purpose implementation

+

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).

+

Macros

+

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.
    • +
+
+

Separate files

+

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.

+

Separate components

+

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.

+

Template-based approaches

+

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/more/index.htm b/more/index.htm new file mode 100644 index 0000000000..4d53dcb63d --- /dev/null +++ b/more/index.htm @@ -0,0 +1,123 @@ + + + + Boost More Information + + + + + + + + + + + + + + +
+ boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+

More Information

+

Boost Policies

+
+

Mailing List Discussion Policy.  + What's acceptable and what isn't.

+

Library Requirements and Guidelines.  + Basic standards for those preparing a submission.

+

Guidelines for Libraries with Separate + Source.  Basic tutorial for libraries that require the + building of a separate link library.

+

Writing Documentation for Boost + Basic guidelines for writing documentation and templates for quickly generating + documentation that follows the guidelines.

+

Test Policy and Protocols.  How + testing works at Boost.

+

Library Submission Process.  + How to submit a library to Boost.

+

Library Formal Review Process. + Including how to submit a review comment.

+

Header Policy.  Headers are where a + library contacts its users, so programming practices are particularly + important.

+

Implementation Variations.  Sometimes + one size fits all, sometimes it doesn't.  This page deals with the + trade-offs.

+

Library Reuse.  Should Boost + libraries use other boost libraries?  What about the C++ Standard + Library?  It's another trade-off.

+

Moderators.  Who they are and what + they do.

+
+

Boost Whatever

+
+

License Information  Information + about the Boost Software License.

+

Bibliography  Print and online + publications relating to Boost and Boost libraries.

+

Who's Using Boost?   + Products and organisations that are using Boost.

+

Compiler Status  Describes + what library works with which compiler.

+

Links  Links of special interest to Boost + users.

+

Formal Review Schedule  + Future, current, and recently past Formal Reviews.

+

Release Procedures  How + developers and the release manager prepare for a Boost release.

+

Updating the Website  How + developers can update the Boost website between releases.

+

Internal Regression Test Suite   + Describes the tool for generating the compiler status tables +

+

Proposal for a C++ Library Repository Web Site  + The original 1998 proposal that launched Boost.

+

How to report bugs  Ways to report Boost + bugs.

+

How to request features Ways + to request new library features.

+

C++ Committee Meetings FAQ for + Boost Members wishing to attend a standards committee meeting.

+

Version History Changes + and additions in past Boost releases.

+
+

Articles and Papers

+
+

Error and Exception Handling describes + approaches to errors and exceptions by David + Abrahams. +

+

Counted Body Techniques by + Kevlin Henney is must reading for those interested in reference + counting, a widely used object management idiom.  Originally published in + Overload magazine.

+

Generic Programming Techniques by + David Abrahams and Jeremy Siek describe + some of the techniques used in Boost libraries.

+

Feature Model Diagrams in text and HTML + describes how to represent feature model diagrams in text form.

+

Portability Hints: Borland C++ 5.5.1 describes + Borland C++ portability issues, with suggested workarounds.

+

Portability Hints: Microsoft VC++ 6.0 SP4 + describes Microsoft C++ portability issues, with suggested workarounds.

+

Coding Guidelines for Integral Constant + Expressions describes how to work through the maze of + compiler related bugs surrounding this tricky topic.

+
+
+

+ Revised + 10 May, 2005

+

+ © Copyright Beman Dawes 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) +

+ + + diff --git a/more/int_const_guidelines.htm b/more/int_const_guidelines.htm new file mode 100644 index 0000000000..6159086a9d --- /dev/null +++ b/more/int_const_guidelines.htm @@ -0,0 +1,328 @@ + + + + + + + + + + + + +

Coding Guidelines for Integral Constant +Expressions

+ +

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.

+ +

What is an Integral Constant Expression?

+ +

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:

+ +
    +
  1. A literal integral value, for example 0u or 3L.
    2. +
  2. An enumerator value.
    3. +
  3. Global integral constants, for example:
    +     const int my_INTEGRAL_CONSTANT = 3;
    4. +
  4. Static member constants, for example:
    + struct myclass
    + { static const int value = 0; };
    5. +
  5. Member enumerator values, for example:
    + struct myclass
    + { enum{ value = 0 }; };
    6. +
  6. Non-type template parameters of integral or enumerator + type.
    7. +
  7. The result of a sizeof expression, for + example:
    + sizeof(foo(a, b, c))
    8. +
  8. The result of a 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.
    9. +
  9. The result of applying a binary operator to two integral + constant expressions:
    + INTEGRAL_CONSTANT1 op INTEGRAL_CONSTANT2
    + p    rovided that the operator is not an assignment + operator, or comma operator.
    10. +
  10. The result of applying a unary operator to an integral + constant expression:
    + op INTEGRAL_CONSTANT1
    +     provided that the operator is not the increment or + decrement operator.
    11. +
+ +

 

+ +

Coding Guidelines

+ +

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;
+ +

 

+ +

Unresolved Issues

+ +

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:

+ +
    +
  1. The header <limits> may be absent - it is + recommended that you never include <limits> + directly but use <boost/pending/limits.hpp> instead. + This header includes the "real" <limits> + header if it is available, otherwise it supplies it's own + std::numeric_limits definition. Boost also defines the + macro BOOST_NO_LIMITS if <limits> is absent.
    2. +
  2. The implementation of std::numeric_limits may be defined + in such a way that its static-const members may not be + usable as integral constant expressions. This contradicts + the standard but seems to be a bug that affects at least + two standard library vendors; boost defines + BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS in <boost/config.hpp> + when this is the case.
    3. +
  3. There is a strange bug in VC6, where the members of std::numeric_limits + can be "prematurely evaluated" in template + code, for example:
    4. +
+ +
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:

+ +
    +
  1. The argument is the name of a member-variable, or a local + variable (code may not compile with VC6).
    2. +
  2. The argument is an expression which involves the creation + of a temporary (code will not compile with Borland C++).
    3. +
  3. The argument is an expression involving an overloaded + function call (code compiles but the result is a garbage + value with Metroworks C++).
    4. +
+ +

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/more/lib_guide.htm b/more/lib_guide.htm new file mode 100644 index 0000000000..f258260392 --- /dev/null +++ b/more/lib_guide.htm @@ -0,0 +1,931 @@ + + + + + Boost Library Requirements and Guidelines + + + + + + + + + + + + + + + + + +
+ boost.png (6897 bytes) + + Home + + + Libraries + + People + + + FAQ + + More +
+

+ + Boost Library Requirements and Guidelines +

+

+ 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 +

+ +

+ Introduction +

+

+ 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. +

+ +

+ Requirements +

+

+ To avoid the frustration and wasted time of a proposed library being + rejected, it must meets these requirements: +

+
    +
  • The license must meet the license requirements + + below. Restricted licenses like the GPL and LGPL are not acceptable. +
    • +
  • The copyright ownership must be clear. +
    • +
  • The library must be generally useful and not restricted to a narrow + problem domain. +
    • +
  • The library must meet the portability + requirements below.  + +
    • +
  • The library must come reasonably close to meeting the Guidelines below. + +
    • +
  • The author must be willing to participate in discussions on the mailing + list, and to refine the library accordingly. +
    • + +
+

+ 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. +

+

+ License requirements +

+

+ 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: +

+
    +
  • Must be simple to read and understand. +
    • +
  • Must grant permission without fee to copy, use and modify the software + for any use (commercial and non-commercial). +
    • +
  • Must require that the license appear on all copies of the software + source code. +
    • +
  • Must not require that the license appear with executables or other + binary uses of the library. +
    • + +
  • Must not require that the source code be available for execution or + other binary uses of the library. +
    • +
  • May restrict the use of the name and description of the library to the + standard version found on the Boost web site. +
    • +
+

+ Portability 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. +

+

+ Ownership +

+

+ 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. +

+ +

+ Guidelines +

+

+ 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. +

+

+ Design and + Programming + +

+
    +
  • Aim first for clarity and correctness; optimization should be only a + secondary concern in most Boost libraries. +
    • +
+
    +
  • Aim for ISO Standard C++. Than means making effective use of the + standard features of the language, and avoiding non-standard compiler + extensions. It also means using the C++ Standard Library where applicable. +
    • +
+ +
    +
  • Follow quality programming practices. See, for example, "Effective C++" + 2nd Edition, and "More Effective C++", both by Scott Meyers, published by + Addison Wesley. +
    • +
+
    + +
  • Use the C++ Standard Library or other Boost libraries, but only when + the benefits outweigh the costs.  Do not use libraries other than the + C++ Standard Library or Boost. See Library + reuse. +
    • +
+
    +
  • Read Implementation Variation to see how to + supply performance, platform, or other implementation variations. +
    • + +
+ +
    +
  • Use the naming conventions of the C++ Standard Library (See Naming conventions rationale):
    + +   +
      +
    • Names (except as noted below) should be all lowercase, with words + separated by underscores. +
      • +
    • Acronyms should be treated as ordinary names (e.g. + xml_parser instead of XML_parser). +
      • +
    • Template parameter names begin with an uppercase letter. +
      • + +
    • Macro (gasp!) names all uppercase and begin with BOOST_. +
      • +
    +
    • +
+
    +
  • Choose meaningful names - explicit is better than implicit, and + readability counts. There is a strong preference for clear and descriptive + names, even if lengthy. +
    • +
+
    + +
  • Use exceptions to report errors where appropriate, and write code that + is safe in the face of exceptions. +
    • +
+ +
    + +
  • Provide sample programs or confidence tests so potential users can see + how to use your library. +
    • +
+ +
    +
  • Although some boost members use proportional fonts, tabs, and + unrestricted line lengths in their own code, boost's widely distributed + source code should follow more conservative guidelines: + + +
    • +
+
    +
  • End all documentation files (HTML or otherwise) with a copyright + message and a licensing message. See license + information page for the preferred form. +
    • +
+
    +
  • Begin all source files (including programs, headers, scripts, etc.) + with:
    + +   +
      +
    • A comment line describing the contents of the file.
      +   +
      • +
    • Comments describing copyright and licensing: again, the preferred + form is indicated in the license + information page
      + +
      + Note that developers should not provide a copy of + LICENSE_1_0.txt with their libraries: Boost + distributions already include a copy in the Boost root directory.
      +   +
      • +
    • A comment line referencing your library on the Boost web site. For + example:
      +
      + + //  See http://www.boost.org/libs/foo/ for library home + page.
      +
      + where 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. +
      • +
    +
    • + +
+
    +
  • Make sure your code compiles in the presence of the 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:
    + +   +
      +
    • If you want to call std::min() or + std::max():
      +   +
        +
      • If you do not require argument-dependent look-up, use + (std::min)(a,b). +
        • + +
      • +
        +
        • +
      • If you do require argument-dependent look-up, you should: +
        • +
      • +
        +
          +
        • + + #include <boost/config.hpp> +
          • +
        • Use BOOST_USING_STD_MIN(); to bring + std::min() into the current scope. +
          • +
        • Use min BOOST_PREVENT_MACRO_SUBSTITUTION + (a,b); to make an argument-dependent call to + min(a,b). +
          • + +
        +
        • +
      +
      • +
    • +
      +
      • +
    • If you want to call + std::numeric_limits<int>::max(), use + (std::numeric_limits<int>::max)() instead. +
      • + +
    • +
      +
      • +
    • If you want to call a min() or max() + member function, instead to doing obj.min(), use + (obj.min)().
      + +
      • +
    • +
      +
      • +
    • If you want to declare or define a function or a member function + named 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; }
      + + This is true regardless if the function is a free (namespace scope) + function, a member function or a static member function, and it + applies for the function declaration as well as for the function + definition.
      +
      • +
    +
    • +
+

+ Directory + Structure and Filenames +

+ +
    +
  • File and directory names must contain only lowercase ASCII + letters , numbers, underscores, and a period.  Leading character must + be alphabetic. Maximum length 31. Only a single period is permitted.  + These requirements ensure file and directory names are relatively portable. +
    • +
  • Files intended to be processed by a C++ compiler as part of a + translation unit should have a three-letter filename extension ending in + "pp". Other files should not use extensions ending in "pp". This + convention makes it easy to identify all of the C++ source in Boost. +
    • + +
  • All libraries have at their highest level a primary directory named for + the particular library. See Naming + consistency. The primary directory may have sub-directories. +
    • +
  • For very simple libraries implemented entirely within the library + header, all files go in the primary directory (except headers, which go in + the boost header directory). +
    • +
+
+

+ 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. +
+
+

+ Redirection + +

+

+ 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>
+
+
+

+ Naming consistency +

+

+ 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". +

+
    +
  • The library's primary directory (in parent boost-root/libs) is + given that same name.  For example, + boost-root/libs/filesystem.
    +   + +
    • +
  • The library's primary header directory (in parent + boost-root/boost) is given that same name. For example, + boost-root/boost/filesystem.
    +   +
    • +
  • The library's primary namespace (in parent ::boost) is given + that same name, except when there's a component with that name (e.g., + boost::tuple), in which case the namespace name is pluralized. For + example, ::boost::filesystem. +
    • + +
+

+ When documenting Boost libraries, follow these conventions (see also the + following section of this document): +

+
    +
  • The library name is set in roman type. +
    • +
  • The library name is capitalized. +
    • +
  • A period between "Boost" and the library name (e.g., Boost.Bind) is + used if and only if the library name is not followed by the word "library". +
    • + +
  • The word "library" is not part of the library name and is therefore + lowercased. +
    • +
+

+ Here are a few examples of how to apply these conventions: +

+
    +
  • Boost.Bind was written by Peter Dimov. +
    • +
  • The Boost Bind library was written by Peter Dimov. +
    • + +
  • I regularly use Bind, a Boost library written by Peter Dimov. +
    • +
+

+ Documentation +

+

+ 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: +

+ +
    +
  • General introduction to the library. +
    • +
  • Description of each class. +
    • +
  • Relationship between classes. +
    • +
  • For each function, as applicable, description, requirements + (preconditions), effects, post-conditions, returns, and throws. +
    • +
  • Discussion of error detection and recovery strategy. +
    • + +
  • How to use including description of typical uses. +
    • +
  • How to compile and link. +
    • +
  • How to test. +
    • +
  • Version or revision history. +
    • +
  • Rationale for design decisions.  See Rationale rationale. +
    • + +
  • Acknowledgements.  See Acknowledgments + rationale. +
    • +
+

+ If you need more help with how to write documentation you can check out the + article on Writing Documentation for + Boost. +

+ +

+ Rationale +

+

+ Rationale for some of the requirements and guidelines follows. +

+
+

+ Exception-specification rationale +

+ +

+ 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. +

+
+

+ Naming conventions rationale +

+

+ 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: +

+ +
    +
  • Naming conventions are contentious, and although several are widely + used, no one style predominates. +
    • +
  • Given the intent to propose portions of boost for the next revision of + the C++ standard library, boost decided to follow the standard library's + conventions. +
    • +
  • Once a library settles on a particular convention, a vast majority of + stakeholders want that style to be consistently used. +
    • +
+
+

+ + Source code fonts rationale +

+

+ 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 rationale +

+ +

+ 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. +

+
+

+ ECMAScript/JavaScript rationale +

+ +

+ 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: +

+
    +
  • Incompatible with some older browsers and some text based browsers. +
    • +
  • Makes printing docs pages difficult. +
    • +
  • Often results in really bad user interface design. +
    • + +
  • "It's just annoying in general." +
    • +
  • Would require Boost to test web pages for ECMAScript/JavaScript + compliance. +
    • +
  • Makes docs maintenance by other than the original developer more + difficult. +
    • +
+
+

+ Rationale + rationale + +

+

+ 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. +

+ +
+

+ Acknowledgements + rationale +

+

+ 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/more/library_reuse.htm b/more/library_reuse.htm new file mode 100644 index 0000000000..2618afba63 --- /dev/null +++ b/more/library_reuse.htm @@ -0,0 +1,75 @@ + + + + + + + + +Boost Library Reuse + + + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+  +

Boost Library reuse: cost versus benefit trade-offs

+

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/more/license_info.html b/more/license_info.html new file mode 100644 index 0000000000..7715d9dff2 --- /dev/null +++ b/more/license_info.html @@ -0,0 +1,280 @@ + + + + + + + + +Boost Software License Background + + + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+ +

Information about the Boost Software License

+ +

License text
+Introduction
+History
+Rationale
+FAQ
+Transition
+Acknowledgements

+ +

Introduction

+ +

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.

+ +

History

+ +

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:

+ + +
    +
  • Must be simple to read and understand.
    • +
  • Must grant permission without fee to copy, use and modify the software for + any use (commercial and non-commercial).
    • +
  • Must require that the license appear with all copies [including + redistributions] of the software source code.
    • +
  • Must not require that the license appear with executables or other binary + uses of the library.
    • +
  • Must not require that the source code be available for execution or other + binary uses of the library.
    • +
+ +

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.

+ +

Rationale

+ +

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.

+ +

Benefit of Common Software License

+

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.

+

Short-Form License

+

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.

+ +

FAQ

+ +

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)
+
+
+Please leave an empty line before and after the above comment block. +It is fine if the copyright and license messages are not on different lines; in +no case there should be other intervening text. Do not include +"All rights reserved" anywhere.
+ +

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. + +

Transition

+ +

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.

+ +

Acknowledgements

+

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/more/links.htm b/more/links.htm new file mode 100644 index 0000000000..a4a0987fe9 --- /dev/null +++ b/more/links.htm @@ -0,0 +1,74 @@ + + + + + + + + +Links + + + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+ + +

Links

+

Here are a few links of special interest to Boost users. For general queries, +try your favorite search engine.

+

Commercial Support for Boost Libraries

+ +

C++ Organizations

+ +

Online Publications

+
    +
  • The C++ Source - + "The Premier Online Journal for the C++ Community".
    • +
+

Copies of the C++ Standard

+
    +
  • + + ANSI Store - The full C++ Standard including TC1 corrections (INCITS/ISO/IEC 14882) is available + as a PDF document for $18 US. The document is certainly not a + tutorial, but is interesting to those who care about the + precise specification of both the language and the standard + library.
    • +
  • + + Book - The full C++ Standard including TC1 corrections is also available + in book form, list price $65 US. Since the content of the book is the same as + the much cheaper ANSI PDF, the book form is only of interest to those who + prefer a physical book, say for a school or company library.
    • +
+
+

Revised +02 October, 2004

+

© 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) +

+ + + + \ No newline at end of file diff --git a/more/mailing_lists.htm b/more/mailing_lists.htm new file mode 100644 index 0000000000..7658db8076 --- /dev/null +++ b/more/mailing_lists.htm @@ -0,0 +1,403 @@ + + + + + Mailing Lists + + + + + + + + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

Boost Mailing Lists and other resources

+ +

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.

+ +
+ +
+
Boost Users list + +
Boost developers list
+ +
+
+
Archives for the Boost developers + list
+
+
+ +
Boost Announce list
+ +
Boost Interest list
+ +
Project-Specific lists
+ +
+
+
Boost.Build list
+ +
Python C++-Sig (for Boost.Python)
+ +
Language Binding (for generalized C++ + bindings)
+ +
Boost.Spirit lists
+ +
Boost.Documentation list
+ +
Testing list (about regression-testing the + boost libraries, not for the Boost.Test library specifically)
+ +
Boost.uBlas (numerics) list
+ +
Boost.Thread list
+
+
+ +
Boost Sandbox
+ +
#boost IRC channel
+
+ +

Boost Users mailing list (also available + via newsgroup)

+ +

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.

+ +

Boost developers mailing list (also + available via newsgroup)

+ +

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 for Boost developers + list

+ +

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. + +

Boost Announce mailing list

+ +

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.

+ +

Boost Interest Mailing List

+ +

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.

+ +

Project-Specific lists

Several + mailing lists have been established for specific Boost projects: + +
+
+

Boost.Build + list

The mailing list for the Boost Build System is located here. GMane provides + NNTP + access and Searchable + Archives as well. + +

Python C++-Sig (for + Boost.Python)

The Python C++-sig is not + strictly Boost-specific, but nearly all the traffic concerns Boost.Python. See also the Language Binding list below. GMane provides NNTP access and + Searchable + Archives as well. There are also searchable archives at + ASPN. + +

Language Binding

The + Language + Binding list is for discussion of a generalized framework for + binding C++ to other languages and systems based on the technology of + Boost.Python and Luabind. The plan is to provide a + single front-end for describing bindings with runtime-pluggable back + ends for binding to specific languages. It is highly recommended + that new subscribers read through the + message history from the beginning before posting; it will + save time as much design progress has already been made. GMane provides + NNTP + access and + Searchable Archives as well. + + +

Boost.Spirit lists

Spirit has + two additional mailing lists. Spirit-general + for Spirit users and Spirit-devel + for Spirit developers (open to anyone who wishes to hang out with + Spirit coders). Both have GMane NNTP + access (Spirit-general + and Spirit-devel) + with searchable archives ( + Spirit-general and + Spirit-devel). + + +

Boost.Documentation + list

The SourceForge mailing list for the Boost Documentation System is located here. + GMane provides NNTP + access and + Searchable Archives as well. + + +

uBLAS development (ublas-dev) + list

A seperate user and developer mailing list for Boost uBLAS specific topics is + located here. + +

Thread development (threads-devel) + list

A seperate developer mailing list for Boost Thread specific topics is + located + here. +

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. + + +

Testing list

+ +

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. + +

Boost Subversion Commit Messages

+

The boost-commit + mailing list receives messages whenever a change is committed to + the Boost Subversion repository.

+ +
+
+ +

Boost Sandbox

+ +

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.

+ +

#boost IRC channel

+ +

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/more/microsoft_vcpp.html b/more/microsoft_vcpp.html new file mode 100644 index 0000000000..7af0c4e7ce --- /dev/null +++ b/more/microsoft_vcpp.html @@ -0,0 +1,326 @@ + + + + + + + + Portability Hints: Microsoft Visual C++ 6.0 SP4 + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

Portability Hints: Microsoft Visual C++ 6.0 SP4

+ +

Similar to the portability hints for Borland + C++, this page provides hints on some language features of the + Microsoft Visual C++ version 6.0 service pack 4 compiler. A list of + acknowledged deficiencies can be found at the Microsoft + support site.

+ +

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.

+ +

Preprocessor symbol

+ +

The preprocessor symbol _MSC_VER is defined for all + Microsoft C++ compilers. Its value is the internal version number of the + compiler interpreted as a decimal number. Since a few other compilers also + define this symbol, boost provides the symbol BOOST_MSVC, + which is defined in boost/config.hpp to + the value of _MSC_VER if and only if the compiler is really Microsoft + Visual C++. The following table lists some known values.

+ + + + + + + + + + + + + + + + + + + +
CompilerBOOST_MSVC value
Microsoft Visual C++ 6.0 (up to SP6)1200
Microsoft embedded Visual C++ 4.01200-1202 (cross compilers)
+ +

Core Language

+ +

[chained using] Chaining using-declarations

+ +

Chaining using-declarations does not work.

+ 
+void f();
+
+namespace N {
+  using ::f;
+}
+
+void g()
+{
+  using N::f;  // C2873: 'f': the symbol cannot be used in a using-declaration
+}
+
+ +

[explicit-instantiation] Explicit function template instantiation

+ +

Trying to explicitly instantiate a function template leads to the wrong + function being called silently.

+ 
+#include <stdio.h>
+
+template<class T>
+void f()
+{
+  printf("%d\n", sizeof(T));
+}
+
+int main()
+{
+  f<double>();      // output: "1"
+  f<char>();        // output: "1"
+  return 0;
+}
+
+ +

[for-scoping] Scopes of definitions in for-loops

+ +

The scope of variable definitions in for loops should be + local to the loop's body, but it is instead local to the enclosing + block.

+ 
+int main()
+{
+  for(int i = 0; i < 5; ++i)
+   ;
+  for(int i = 0; i < 5; ++i)  // C2374: 'i': Redefinition; multiple initialization
+   ;
+  return 0;
+}
+
+ +

Workaround: Enclose the offending for + loops in another pair of curly braces.

+ +

Another possible workaround (brought to my attention by Vesa Karvonen) + is this:

+ 
+#ifndef for
+#define for if (0) {} else for
+#endif
+
+ +

Note that platform-specific inline functions in included headers might + depend on the old-style for scoping.

+ +

[inclass-member-init] In-class member initialization

+ +

In-class member initialization, required to implement a + Standard-conforming std::numeric_limits template, does not + work.

+ 
+struct A
+{
+  static const int i = 5;      // "invalid syntax for pure virtual method"
+};
+
+ +

Workaround: Either use an enum (which has incorrect + type, but can be used in compile-time constant expressions), or define the + value out-of-line (which allows for the correct type, but prohibits using + the constant in compile-time constant expressions). See Coding Guidelines for Integral Constant + Expressions for guidelines how to define member constants portably in + boost libraries.

+ +

[koenig-lookup] Argument-dependent lookup

+ +

Argument-dependent lookup, also called Koenig lookup, works for + overloaded operators, but not for ordinary functions. No additional + namespaces induced from the argument types seem to be considered.

+ 
+namespace N {
+  struct A {};
+  void f(A);
+}
+
+void g()
+{
+  N::A a;
+  f(a);     // 'f': undeclared identifier
+}
+
+ +

[template-friend] Templates as friends

+ +

A Template cannot be declared a friend of a class.

+ 
+template<class T>
+struct A {};
+
+struct B
+{
+  template<class T>
+  friend struct A;     // "syntax error"
+};
+
+ +

[member-template-outofline] Out-of-line definitions of member + templates

+ +

Defining member templates outside their enclosing class does not + work.

+ 
+template<class T>
+struct A
+{
+  template<class U>
+  void f();
+};
+
+template<class T>
+template<class U>   // "syntax error"
+void A<T>::f()      // "T: undeclared identifier"
+{
+}
+
+ +

Workaround: Define member templates in-line within + their enclosing class.

+ +

[partial-spec] Partial specialization

+ +

Partial specialization of class templates does not work.

+ 
+template<class T>
+struct A {};
+
+template<class T>
+struct B {};
+
+template<class T>
+struct A<B<T> > {};  // template class was already defined as a non-template
+
+ +

Workaround: In some situations where interface does not + matter, class member templates can simulate partial specialization.

+ +

[template-value] Dependent template value parameters

+ +

Template value parameters whose type depends on a previous template + parameter provoke an internal compiler error if the correct syntax (with + "typename") is used.

+ 
+template<class T, typename T::result_type> // C1001: INTERNAL COMPILER ERROR: msc1.cpp, line 1794
+struct B {};
+ // (omit "typename" and it compiles)
+
+
+ +

Workaround: Leave off the "typename" keyword. That + makes the program non-conforming, though.

+ +

[wchar_t] wchar_t is not built-in

+ +

The type wchar_t is not a built-in type.

+ 
+wchar_t x;  // "missing storage class or type identifier"
+
+ +

Workaround: When using Microsoft Visual C++, the header + boost/config.hpp includes + <cstddef>, which defines wchar_t as a + typedef for unsigned short. Note that this means that the + compiler does not regard wchar_t and unsigned + short as distinct types, as is required by the standard, and so + ambiguities may emanate when overloading on wchar_t. The macro + BOOST_NO_INTRINSIC_WCHAR_T is defined in this situation.

+ +

[delete-const-pointer] Deleting const X * does not + work

+ +

Trying to delete a pointer to a cv-qualified type gives an error:

+ 
+void f()
+{
+  const int *p = new int(5);
+  delete p;        // C2664: cannot convert from "const int *" to "void *"
+}
+
+ +

Workaround: Define the function

+ 
+inline void operator delete(const void *p) throw()
+{ operator delete(const_cast<void*>(p)); }
+
+ +

and similar functions for the other cv-qualifier combinations, for + operator delete[], and for the std::nothrow variants.

+ +

Standard Library

+ +

[clib-namespace] C library names in global namespace instead of + std

+ +

Library names from the <c...> headers are in the global namespace + instead of namespace std.

+ +

Workaround:  The header boost/config.hpp will define + BOOST_NO_STDC_NAMESPACE. It can be used as follows:

+ 
+# ifdef BOOST_NO_STDC_NAMESPACE
+    namespace std { using ::abs; using ::fabs; }
+# endif
+
+ +

Because std::size_t and std::ptrdiff_t are so commonly used, the + workaround for these is already provided in boost/config.hpp.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 December, 2006

+ +

Copyright © 2001-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/more/moderators.html b/more/moderators.html new file mode 100644 index 0000000000..249484de2c --- /dev/null +++ b/more/moderators.html @@ -0,0 +1,81 @@ + + + + + + + +Moderators + + + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+

Boost Moderators

+

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. +

+ +

Moderator Functions

+
    +
  • Monitor the mailing list to ensure dialog remains within the acceptable + boundaries set by the discussion policy. + When discussion strays, use private email to gently remind, strongly rebuke, + or outright ban, as the situation demands.
    • +
+
    +
  • Approve the initial postings of new (and thus still moderated) members, + and move members to the "Group Policy" posting status.
    • +
+
    +
  • Administer the internal operations of the Boost web site, the main Boost + mailing list, the CVS repository, and other Boost administrative machinery.
    • +
+
    +
  • Act as an executive committee overseeing important administrative and + policy decisions.  Boost is a zero-budget organization with no income + and no expenses, so that eliminates the need for most management. Technical + decisions are worked out on the mailing list. The moderators handle the few + remaining decisions that need a definite answer.
    • +
+
    +
  • Beyond the purely administrative duties, work to keep the Boost community + vibrant and alive. That may be as simple as saying "thank you" to + an individual member, or as complex as starting some major new + initiative.  Do whatever it takes!
    • +
+
+

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/more/proposal.pdf b/more/proposal.pdf new file mode 100644 index 0000000000..d85860bac1 Binary files /dev/null and b/more/proposal.pdf differ diff --git a/more/regression.html b/more/regression.html new file mode 100644 index 0000000000..58a2c18fa3 --- /dev/null +++ b/more/regression.html @@ -0,0 +1,9 @@ + + + + + +Automatically loading index page... if nothing happens, please go to +http://www.boost.org/tools/regression/index.htm. + + diff --git a/more/release_mgr_checklist.html b/more/release_mgr_checklist.html new file mode 100644 index 0000000000..7cfaa1fe0f --- /dev/null +++ b/more/release_mgr_checklist.html @@ -0,0 +1,276 @@ + + + + + + + + +Release Manager's Checklist + + + + + + + + + + + + + +
+ boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+ + +

Release Manager's Checklist

+ +

Introduction
+Pre-release activities
+CVS Branch for release
+CVS Release
+Distribution

+ +

Introduction

+

Historically, items on this checklist were accomplished by scripts written +in Perl, Python, Bash, C++, and as Windows command files, or by point-and-click +on a FrontPage or other GUI based program. Long term the plan is to move as much +as possible of these to C++, as +the one language all Boost developers are comfortable with.

+

Pre-release activities

+
    +
  • After discussion on the main list, post the release schedule.
    + 
    • +
  • Verify the root/index.htm, root/boost/version.hpp, root/Jamfile.v2 and + root/Jamrules + release numbers are correct and agree.
    + 
    • +
  • Verify via jamboost@yahoogroups.com + that bjam pre-built executables up-to-date.
    + 
    • +
  • Remove the oldest "Latest News" from root/index.htm.
    + 
    • +
  • For each new library added this release:
    • +
+
+
    +
  • Verify root/index.htm Latest News entry has been made and reads well.
    + 
    • +
  • Verify root/libs/libraries.htm entry has been made, both in the + alphabetic list and in the category lists.
    + 
    • +
  • Verify the root/libs/xxx directory contains an index.htm or index.html + file; either the main docs or a redirection to the main docs. To do: + automate this.
    + 
    • +
  • Skim read the primary docs pages to make sure they meet Boost + requirements and guidelines. Don't leave this until too late; it has + turned up lots of issues in the past.
    + 
    • +
  • Generate the header dependency table and update the CVS. To do: + coordinate with John Maddock's new dependency tools.
    • +
+
+
    +
  • Monitor + + http://boost.sourceforge.net/regression-logs/inspection_report.html to + verify problems are actively being reduced. Make sure none of the problems are + in files the release manager is responsible for.
    + 
    • +
  • Monitor regression tests (http://boost.sourceforge.net/regression-logs) + to verify that errors are actively being reduced or accounted for on key + platforms and compilers.
    + 
      +
    • Boost errors are being actively worked on by library maintainers.
      • +
    • Compiler or standard library errors are at least identified, and + preferably reported to the supplier.
      • +
    • No errors remain uninvestigated or unclassified.
      + 
      • +
    +
    • +
  • Monitor the developer and user mailing lists to verify that all posted + patches are being applied, rejected, or otherwise dealt with.
    + 
    • +
  • Monitor the developer and user mailing lists, and the SourceForge bug + tracker, to verify that all posted bug reports are being investigated, fixed, + rejected, or otherwise dealt with.
    + 
    • +
  • Monitor CVS commits to verify that all the expected and/or promised + content actually gets committed. Try to get developers to avoid last minute + commits of major changes.
    • +
+

CVS Branch for release

+
    +
  • Pre-release activities complete enough to justify branch-for-release?
    + 
    • +
  • Everybody happy?
    + 
    • +
  • Branch for release:
      +
    • Tag the main trunk  merged_to_RC_n_n_n.
      • +
    • Branch the main trunk with the tag RC_n_n_n.
      + 
      • +
    +
    • +
  • Post notice on main list. Remind developers that fixes which apply + to both Main Trunk and Branch have to be committed separately to both.
    • +
+

CVS Release

+
    +
  • Pre-release activities all complete?
    + 
    • +
  • Post notice to make sure all developers ready.
    + 
    • +
  • Tag: WinCVS: Select site, then tag (Modify|Create tag..., toolbar T on doc). New + tag name: Version_1_21_2 (or whatever). If prior release failed, select + "overwrite existing tags with the same name".
    • +
+

Distribution

+

These procedures are given for a particular release manager's machine. The +plan is to replace them with more generic procedures over time.

+
    +
  • Create folders for export:
    +
    +    c:\boost\boost_1_28_0
    +    c:\boost\temp\boost_1_28_0
    +
    + Note that several batch files assume these locations and naming schemes.
    + 
    • +
  • Export Win32 distribution: WinCVS | Remote | Checkout Module
    +
    + Checkout settings: module name and path on the server: boost, local folder to + checkout to: c:\boost\boost_1_28_0
    + [for 1.29.0 export, put everything in a boost_1_29_0/boost subdirectory.  + Experiments with 1.30.0 tried boost/boost as the path on server, but that just + resulted in getting the boost header subdirectory only.]
    +
    + Checkout options: (check) By revision/tab/branch: Version_1_28_0, (check) Do + not create CVS directories (export)
    +
    + This results in the follow command: cvs -z9 export -r Version_1_28_0 boost (in + directory C:\boost\boost_1_28_0)
    +
    + (takes about ten minutes)
    +
    + (rename boost-root if needed !!!!!!!!!!!!!!!!!!!)
    + 
    • +
  • Export Unix distribution: similar to above, except target is c:\boost\temp\boost_1_28_0 + and set global for UNIX nl.
    +  
    • +
  • !!!!!! VERY IMPORTANT: WinCVS | Set Preferences | Global back to non-UNIX nl. + !!!!!!!!!!!!!!!
    + 
    • +
  • Add regression results web pages into package (new in 1.33 so this is just a shot at the process - jeff)
    + download all the regression results from website (may need meta-comm help on this)
    + unpack the regression results into tools/regression/latest_release
    +
    + +
    • +
  • General ZIP and TAR.GZ files
    +
    + n_n_n is 1_28_0 or whatever
    +
    + cd \boost
    + boost_zip 1_21_2 (creates zip.log)
    + boost_tar_gz 1_21_2
    + bash
    +    + gunzip -c boost_1_21_2.tar.gz | bzip2 > boost_1_21_2.tar.bz2
    +    exit
    +  
    • +
  • Upload and unpack the .zip release candidate to a SourceForge web services + sub-directory. Post a message to the main list asking developers to check + contents. (Daniel Frey has volunteered to help check).
    + 
    • +
  • Upload files for SourceForge release incoming directory using WS_FTP Pro
      +
    • Start keep_isdn_awake
      • +
    • Connection: SourceForge Release Upload | connect
      • +
    • Select Local system: c:\boost
      • +
    • Select Remote system: /incoming
      • +
    • Drag-and-drop the three release files from Local system to Remote system
      • +
    • Disconnect
      • +
    • Stop keep_isdn_awake
      + 
      • +
    +
    • +
  • Complete the SourceForge + + release procedure.
      +
    • Admin | File Releases | Add Release for package name boost
      • +
    • New release name: 1.21.2 | create this release
      • +
    • Step 1: paste in release notes (in HTML). Be sure to note difference + between .zip and .gz/bz2 files. Submit/Refresh
      • +
    • Step 2: Check appropriate files. Add Files and/or Refresh View
      • +
    • Step 3: For each file, select Processor and File Type, Update/Refresh
      • +
    • Setp 4: Email Release Notice: I'm sure. Send Notice.
      • +
    • Wait up to 30 minutes.
      • +
    • Check SourceForge release page and release notes with web browser.
      + 
      • +
    +
    • +
  • Consider putting up a temporary "Update in progress" root/index.html + during site update
    + 
    • +
  • Update the web site:
    cd ...\boost_1_28_0
+tar -cf site.tar *
+bzip2 -k site.tar
+
+dir site.tar.bz2
+pscp site.tar.bz2 beman_dawes@shell1.sourceforge.net:/home/groups/b/bo/boost/htdocs/
+
+keep_idsn_awake in another window.
+
+c:\bgd\util\putty\plink.exe beman_dawes@shell.sourceforge.net
+cd /home/groups/b/bo/boost/htdocs
+pwd
+ls -l site.tar.bz2
+
+rm -fr boost
+rm -fr doc
+rm -fr libs
+rm -fr more
+rm -fr people
+rm -fr status
+rm -fr tools
+bunzip2 -kc site.tar.bz2 | tar -x 
+ls
+exit
+
+stop keep_isdn_awake
    +
    • +
  • Check actual www.boost.org site with + browser. Look at a bunch of files that should have been updated to make sure + the updates actually "took".
    + 
    • +
  • Post a message announcing the release and recapping "Latest News".  + Post as separate messages to: boost, boost-announce, boost-users, + comp.lang.c++.moderated, + c++std-news@research.att.com
    + 
    • +
  • Using the SourceForge shell services (sf_shell_svc.bat), cd /home/groups/b/bo/boost/htdocs, + and rename regression tests as necessary.
    + 
    • +
  • Burn "Key Directories" CD for off-site backup.
    + 
    • +
  • Make sure CVS working copy is updated to main branch!
    + 
    • +
  • Ready root/index.htm, root/boost/version.hpp, root/Jamfile.v2 and + root/Jamrules for the + next release and commit to CVS so developers have a place to add "Latest news" + blurbs.
    + 
    • +
  • Delete obsolete files from yahoogroups files section.
    • +
+
+

Revised: +21 November, 2005

+

© 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/more/release_procedures.htm b/more/release_procedures.htm new file mode 100644 index 0000000000..aefa80ac76 --- /dev/null +++ b/more/release_procedures.htm @@ -0,0 +1,213 @@ + + + + + + + + +Release Procedures + + + + + + + + + + + + + +
+ boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+ + +

Boost Release Procedures

+

Introduction
+Procedure Overview
+Procedures for Developers
+Procedures for the Release Manager
+FAQ
+Acknowledgements

+

Introduction

+

Each release of Boost software is overseen by a release manager, who +coordinates release activities via the Boost mailing list, as well as performing +the detailed procedures for the release.

+

Boost developers assist the release manager by reviewing regression test +logs, and committing fixes to CVS.

+

Release Procedure Overview

+
    +
  • Discussion on the main Boost mailing list to determine the target date for + release candidate branch and tag of the CVS main trunk.
    + 
    • +
  • Release manager performs release candidate branch, and also tags the + branch point in main trunk.
    + 
    • +
  • Regression tests run on release candidate branch.
    + 
    • +
  • Developers fix problems, test, and commit fixes. See below for details.
    + 
    • +
  • Repeat previous two steps until release manager is satisfied.
    + 
    • +
  • Release manager rolls out the actual release.
    • +
+

Release Procedures for Developers

+
    +
  • As the release candidate branch date approaches (as announced on the main + mailing list), bring the main trunk CVS files you are responsible for into a + stable state.
    + 
    • +
  • If you know of changes in either your code or its dependencies, start + checking regression test results to ensure your tests still pass.  Don't + necessarily wait for the initial release tagging.
    + 
    • +
  • After the release manager announces that the release candidate branch has + occurred, check the latest regression test results to be sure + your tests haven't broken.
    + 
    • +
  • Developers can continue working on main trunk code changes after + the release candidate branch has occurred. There is no need to wait until the release + itself.  + Modified files committed to CVS on the main trunk will not be included in the release unless the + developer explicitly commits the changes to the release candidate branch.
    + 
    • +
  • If specific to the release candidate only, the fixes should be committed + directly to the release candidate branch. In the more common case of fixes + which apply to both the main trunk and the release branch, the fixes are best + made to the main trunk, and then merged into the release candidate branch. See + FAQ for tag rationale.
    +
    + After a fix has been committed to the main trunk, here is a + typical procedure (assuming the release candidate branch is named RC_1_26_2) + to merge the fixed main trunk into the release candidate branch:
    • +
+
+
    +
  • Command Line CVS:
    • +
+
+
    +
  • Fixed code is committed to main branch
    + 
    • +
  • Switch to the release candidate branch +
    + cvs update -r RC_1_26_2
    +
    • +
  • Merge changes in a trunk since previous merge to branch +
    +
    cvs update -jmerged_to_RC_1_26_2 -jHEAD buggycode.hpp
+ --> RCS file: /cvsroot/boost/.../buggycode.hpp,v
+ -->    retrieving revision 1.4
+ -->    retrieving revision 1.6
+ -->    Merging differences between 1.4 and 1.6 into buggycode.hpp
    +
    +
    • +
  • Commit merged branch +
    +
    cvs commit -m "Merged fix for problem xyz from trunk to branch" buggycode.hpp
    +
    +
    • +
  • Go back to main trunk +
    +
    cvs update -A
    +
    +
    • +
  • Move tag to a new merged point +
    +
    cvs tag -F -c merged_to_RC_1_28_2 buggycode.hpp
    +
    +
    • +
  • Repeat as needed +
    • +
+
+
    +
  • WinCVS:
    • +
+
+
    +
  • After fixed code is committed to main branch, switch to the release + candidate branch:
    • +
+
+
+

Select file(s) if not already selected.

+

Modify | Update selection... | + Update settings | Sticky options | Retrieve rev/tag/branch: RC_1_26_2 | OK

+
+
+
    +
  • Merge changes from main trunk into the release candidate branch:
    • +
+
+
+

Modify | Update selection... | + Update settings | Merge options | Only this rev/tag: + merged_to_RC_1_26_2 + | Plus with this rev/tag: HEAD | OK

+
+
+
    +
  • Commit merge results:
    • +
+
+
+

Modify | Commit... | Enter log message: ... | OK

+
+
+
    +
  • Go back to main trunk:
    • +
+
+
+

Modify | Update selection... | Update settings | Reset any sticky + date/tag/-k options | OK

+
+
+
    +
  • Tag as new merge point:
    • +
+
+
+

Modify | Create tag on selection... | Create tag settings | Enter the tag + name to create: merged_to_RC_1_26_2, Overwrite existing tags + with same name | OK.

+
+
+
+
+

Release Procedures for the Release Manager

+

At time of branch-for-release:

+
    +
  • Tag the main trunk  merged_to_RC_n_n_n.
    • +
  • Branch the main trunk with the tag RC_n_n_n.
    • +
+

See Release Manager's Checklist for +full details.

+

FAQ

+

What is the purpose of the +merged_to_RC_n_n_n tag? This tag allows multiple merges from the +main trunk to the release candidate branch. Without it, merging an initial main +trunk fix  into the release candidate branch would work, but merging a +second fix from main trunk to release candidate branch would result in a merge +conflict. Although this procedure seems convoluted, it works much better in +practice than several prior procedures we tried.

+

Acknowledgements

+

This web page was written by Beman Dawes, with helpful suggestions from Dave +Abrahams and Steve Robbins. Jim Hyslop contributed the original CVS procedures. +Updated by Jeff Garland after 1.29 release based on list discussions.

+
+

Revised: +02 October, 2003

+ +

© 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)

+ + + + \ No newline at end of file diff --git a/more/report-apr-2006.html b/more/report-apr-2006.html new file mode 100644 index 0000000000..0512c0855a --- /dev/null +++ b/more/report-apr-2006.html @@ -0,0 +1,278 @@ + + + + + + +Review Wizard Status Report for April 2006 + + + +
+

Review Wizard Status Report for April 2006

+
+

News

+

April 1, 2006 -- The "Promotion Traits" Review Begins (Fast-Track) +Proposal to add promote, integral_promotion and +floating_point_promotion class templates to type_traits library.

+

April 6, 2006 -- The "Function Types" Review Begins (Fast-Track) +This library provides a metaprogramming facility +to classify, decompose and synthesize function-, function pointer-, +function reference- and member function pointer types.

+

March 22, 2006 -- Asio Accepted +Announcement: http://lists.boost.org/Archives/boost/2006/03/102287.php

+

February 17, 2006 - Shared Memory Library Accepted +Announcement: http://lists.boost.org/boost-announce/2006/02/0083.php

+

February 5, 2006 - Fixed String Library Rejected +Announcement: http://lists.boost.org/boost-announce/2006/02/0081.php

+

We need experienced review managers. Please take a look at +the list of libraries in need of managers and check out their +descriptions. If you can serve as review manager for any of +them, email Ron Garcia or Tom Brinkman "garcia at cs dot indiana dot edu" +and "reportbase at gmail dot com" 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 Tom.

+

If you're library author and plan on submitting a library for review +in the next 3-6 months, send Ron or Tom a +short description of your library and we'll add it to the +Libraries Under Construction below. We know that there are many +libaries that are near completion, but we have hard time keeping +track all of them. Please keep us informed about your progress.

+
+
+

Review Queue

+
+
    +
  • Promotion Traits - April 1, 2006 (fast-track)
    • +
  • Function Types - April 6, 2006 (fast-track)
    • +
  • Fusion
    • +
  • Pimpl Pointer
    • +
  • Property Tree
    • +
  • Physical Quantities System
    • +
  • Intrusive Containers
    • +
+
+
+
+

Function Types (mini-re-review)

+
+ +++ + + + + + + + + + +
Author:Tobias Schwinger
Review Manager:Tom Brinkman
Download:http://boost-sandbox.sourceforge.net/vault/
Description:

This library provides a metaprogramming facility to classify, +decompose and synthesize function-, function pointer-, function +reference- and member function pointer types. For the purpose of +this documentation, these types are collectively referred to as +function types (this differs from the standard definition and +redefines the term from a programmer's perspective to refer to +the most common types that involve functions).

+

The classes introduced by this library shall conform to the +concepts of the Boost Metaprogramming library (MPL).

+
+
The Function Types library enables the user to:
+
    +
  • test an arbitrary type for being a function type of specified kind,
    • +
  • inspect properties of function types,
    • +
  • view and modify sub types of an encapsulated function type with +MPL Sequence operations, and
    • +
  • synthesize function types.
    • +
+
+
+

This library supports variadic functions and can be configured +to support non-default calling conventions.

+
+
+
+
+

Promotion Traits

+
+ +++ + + + + + + + + + +
Author:Alexander Nasonov
Review Manager:Tobias Schwinger
Download:http://cpp-experiment.sourceforge.net/promote-20050917.tar.gz
Description:

Proposal to add promote, integral_promotion and +floating_point_promotion class templates to type_traits library.

+

Alexander tried it on different compilers with various success: +GNU/Linux (gentoo-hardened): gcc 3.3 and 3.4, Intel 7, 8 and 9 +Windows: VC7 free compiler +Sparc Solaris: Sun C++ 5.3 and 5.7

+

See comments at the beginning of +promote_enum_test.cpp for what is broken.

+
+
+
+
+

Intrusive Containers

+
+ +++ + + + + + + + + + +
Author:Olaf Krzikalla
Review Manager:Thorsten Ottosen
Download:http://people.freenet.de/turtle++/intrusive.zip
Description:While intrusive containers were and are widely used in C, they became +more and more forgotten in the C++-world due to the presence of the +standard containers, which don't support intrusive +techniques. Boost.Intrusive not only reintroduces this technique to +C++, but also encapsulates the implementation in STL-like +interfaces. Hence anyone familiar with standard containers can use +intrusive containers with ease.
+
+
+
+

Fusion

+
+ +++ + + + + + + + + + +
Author:Joel de Guzman
Review Manager:Ron Garcia
Download:http://spirit.sourceforge.net/dl_more/fusion_v2/ +http://spirit.sourceforge.net/dl_more/fusion_v2.zip
Description:

Fusion is a library of heterogenous containers and views and +algorithms. A set of heterogenous containers (vector, list, set and +map) is provided out of the box along with view classes that present +various composable views over the data. The containers and views +follow a common sequence concept with an underlying iterator concept +that binds it all together, suitably making the algorithms fully +generic over all sequence types.

+

The architecture is somewhat modeled after MPL which in turn is +modeled after STL. It is code-named "fusion" because the library is +the "fusion" of compile time metaprogramming with runtime programming.

+
+
+
+
+

Pimpl Pointer

+
+ +++ + + + + + + + + + +
Author:Asger Mangaard
Review Manager:Need Volunteer
Download:Boost Sandbox (http://boost-consulting.com/vault/) under pimpl_ptr.
Description:The pimpl idiom is widely used to reduce compile times and disable +code coupling. It does so by moving private parts of a class from the +.hpp file to the .cpp file. +However, it's implementation can be tricky, and with many pitfalls +(especially regarding memory management). +The pimpl_ptr library is a single header file, implementing a special +policy based smart pointer to greately ease the implementation of the +pimpl idiom.
+
+
+
+

Property Tree

+
+ +++ + + + + + + + + + +
Author:Marcin Kalicinski
Review Manager:Need Volunteer
Download:Boost Sandbox Vault - property_tree_rev4.zip +http://kaalus.atspace.com/ptree
Description:Property tree is a data structure - a tree of (key, value) +pairs. It differs from its cousin, "usual" property map, because +it is hierarchical, not linear. Thus, it is more like a +minimalistic Document Object Model, but not bound to any +specific file format. It can store contents of XML files, +windows registry, JSON files, INI files, even command line +parameters. The library contains parsers for all these formats, +and more.
+
+
+
+

Physical Quantities System

+
+ +++ + + + + + + + + + +
Author:Andy Little
Review Manager:Need Volunteer
Download:http://tinyurl.com/7m5l8
Description:PQS (Physical Quantities System) is used for modelling +physical-quantities in C++ programs. The advantages over using +built-in types in the role include: trapping errors in +dimensional analysis, detailed semantic specifications for +reliable and repeatable conversions between units and +self-documentation of source code. PQS is based around the +principles and guidelines of the International System of Units +(SI). The library predefines a large number of quantities, +physical and maths constants using a common syntax. The library +also includes (or will soon include) classes for manipulating +quantities algebraically, for example angles (radians, +steradians, degrees,minutes,seconds) and vectors, matrices and +quaternions for more advanced modelling of physical systems.
+
+
+
+
+

Libraries under development

+

Geometry Library - Author - Andy Little (?)

+

C2_functions Library - Author - Marcus Mendenhall

+

Please let us know of any libraries you are currently +developing that you intend to submit for review.

+
+
+
+
+Generated by Docutils from reStructuredText source. +
+ + diff --git a/more/report-jan-2006.html b/more/report-jan-2006.html new file mode 100644 index 0000000000..f1a557f0e3 --- /dev/null +++ b/more/report-jan-2006.html @@ -0,0 +1,325 @@ + + + + + + +Review Wizard Status Report for January 2006 + + + +
+

Review Wizard Status Report for January 2006

+
+

News

+

Happy New Year! Here are some statistics regarding Boost Library +reviews in 2005:

+
+
    +
  • 12 Libraries were reviewed
    • +
  • 8 Libraries were accepted
    • +
  • 1 Library (Function Types) was accepted pending a mini-review
    • +
  • 2 Libraries were rejected
    • +
  • 1 Library has yet to receive a final verdict (ASIO)
    • +
+
+

Policy Pointer has been removed from the review queue because the author has +stated that it is not quite ready.

+

We need review managers. Please take a look at the list of libraries +in need of managers and check out their descriptions. If you can +serve as review manager for any of them, send one of us an email.

+
+
Note:
+
If you have any suggestions about how we could improve +the Review Wizard's status report, +please email "reportbase at gmail dot com" +and "garcia at cs dot indiana dot edu".
+
+
+
+

Review Managers Needed

+

There are a few libraries in the review queue in need +of review managers. If you would like to volunteer to be a review +manager, please contact Ron or Tom.

+

The following libraries still require review managers:

+
+
    +
  • Fusion
    • +
  • Shmem
    • +
  • Pimpl Pointer
    • +
  • Type Traits (modification)
    • +
  • Function Types
    • +
+
+
+
+

Review Queue

+
+
    +
  • Fixed Strings - January 19 2006 - January 28 2006
    • +
  • Intrusive Containers
    • +
  • Function Types (mini-re-review)
    • +
  • Shmem
    • +
  • Fusion
    • +
  • Pimpl Pointer
    • +
  • Type Traits (modification)
    • +
+
+
+
+

Fixed Strings

+
+ +++ + + + + + + + + + +
Author:Reece Dunn
Review Manager:Harmut Kaiser
Download:Boost Sandbox (http://boost-sandbox.sourceforge.net/) under fixed_string
Description:The fixed string library provides buffer overrun protection for static +sized strings (char s[ n ]). It provides a C-style string +interface for compatibility with C code (for +example, porting a C program to C++). +There is also a std::string-style interface using a class based on +flex_string by Andre Alexandrescu with a few limitations due to the +non-resizable nature of the class.
+
+
+
+

Intrusive Containers

+
+ +++ + + + + + + + + + +
Author:Olaf Krzikalla
Review Manager:to be determined
Download:http://people.freenet.de/turtle++/intrusive.zip
Description:While intrusive containers were and are widely used in C, they became +more and more forgotten in the C++-world due to the presence of the +standard containers, which don't support intrusive +techniques. Boost.Intrusive not only reintroduces this technique to +C++, but also encapsulates the implementation in STL-like +interfaces. Hence anyone familiar with standard containers can use +intrusive containers with ease.
+
+
+
+

Function Types (mini-re-review)

+
+ +++ + + + + + + + + + +
Author:

Tobias Schwinger

+
Review Manager:

to be determined

+
Download:

http://boost-sandbox.sourceforge.net/vault/

+
Description:
+
This library provides a metaprogramming facility
+

to classify, decompose and synthesize function-, +function pointer-, function reference- and +member function pointer types. For the purpose +of this documentation, these types are +collectively referred to as function +types (this differs from the standard +definition and redefines the term from +a programmer's perspective to refer to +the most common types that involve functions).

+
+
The classes introduced by this library
+

shall conform to the concepts of the +Boost Metaprogramming library (MPL).

+
+
The Function Types library enables the user to:
+
    +
  • test an arbitrary type for +being a function type of specified kind,
    • +
  • inspect properties of function types,
    • +
  • view and modify sub types of an +encapsulated function type with +MPL Sequence operations, and
    • +
  • synthesize function types.
    • +
+
+
This library supports variadic functions and
+

can be configured to support +non-default calling conventions.

+
+
+
+
+
+
+

Shmem

+
+ +++ + + + + + + + + + +
Author:

Ion Gaztanaga

+
Review Manager:

to be determined

+
Download:

Boost Sandbox Vault -> Memory (http://boost-sandbox.sourceforge.net/vault/index.php?direction=0&order=&directory=Memory)

+

http://ice.prohosting.com/newfunk/boost/libs/shmem/doc/html/index.html

+
Description:

Shmem offers tools to simplify shared memory usage in +applications. These include shared memory creation/destruction and +synchronization objects. It also implements dynamic allocation of +portions of a shared memory segment and an easy way to construct C++ +objects in shared memory.

+

Apart from this, Shmem implements a wide range of STL-like containers +and allocators that can be safely placed in shared memory, helpful to +implement complex shared memory data-bases and other efficient +inter-process communications.

+
+
+
+
+

Fusion

+
+ +++ + + + + + + + + + +
Author:

Joel de Guzman

+
Review Manager:

to be determined

+
Download:

http://spirit.sourceforge.net/dl_more/fusion_v2/ +http://spirit.sourceforge.net/dl_more/fusion_v2.zip

+
Description:

Fusion is a library of heterogenous containers and views and +algorithms. A set of heterogenous containers (vector, list, set and +map) is provided out of the box along with view classes that present +various composable views over the data. The containers and views +follow a common sequence concept with an underlying iterator concept +that binds it all together, suitably making the algorithms fully +generic over all sequence types.

+

The architecture is somewhat modeled after MPL which in turn is +modeled after STL. It is code-named "fusion" because the library is +the "fusion" of compile time metaprogramming with runtime programming.

+
+
+
+
+

Pimpl Pointer

+
+ +++ + + + + + + + + + +
Author:Asger Mangaard
Review Manager:to be determined
Download:Boost Sandbox (http://boost-consulting.com/vault/) under pimpl_ptr.
Description:The pimpl idiom is widely used to reduce compile times and disable +code coupling. It does so by moving private parts of a class from the +.hpp file to the .cpp file. +However, it's implementation can be tricky, and with many pitfalls +(especially regarding memory management). +The pimpl_ptr library is a single header file, implementing a special +policy based smart pointer to greately ease the implementation of the +pimpl idiom.
+
+
+
+

Type_Traits (modification)

+
+ +++ + + + + + + + + + +
Author:

Alexander Nasonov

+
Review Manager:

to be determined

+
Download:

http://cpp-experiment.sourceforge.net/promote-20050917.tar.gz +or http://cpp-experiment.sourceforge.net/promote-20050917/

+
Description:

Proposal to add promote, integral_promotion and +floating_point_promotion class templates to type_traits library.

+

Alexander tried it on different compilers with various success: +GNU/Linux (gentoo-hardened): gcc 3.3 and 3.4, Intel 7, 8 and 9 +Windows: VC7 free compiler +Sparc Solaris: Sun C++ 5.3 and 5.7

+

See comments at the beginning of promote_enum_test.cpp for what is broken. +http://cpp-experiment.sourceforge.net/promote-20050917/libs/type_traits/test/promote_enum_test.cpp

+

Alexander requests a fast-track review.

+
+
+
+
+
+

Libraries under development

+
+

Property Tree

+
+ +++ + + + + + +
Author:Marcin Kalicinski
Download:Boost Sandbox Vault (http://boost-consulting.com/vault/) +property_tree_rev3.zip
+
+

Please let us know of any libraries you are currently +developing that you intend to submit for review.

+
+
+
+
+
+Generated on: 2006-01-20 17:42 UTC. + +
+ + diff --git a/more/requesting_new_features.htm b/more/requesting_new_features.htm new file mode 100644 index 0000000000..5787ca49f3 --- /dev/null +++ b/more/requesting_new_features.htm @@ -0,0 +1,56 @@ + + + + + + + +Requesting New Features + + + + + + + + + + + + + +
+ boost.png (6897 bytes)Home + Libraries + PeopleFAQMore
+

Requesting new features for Boost libraries

+

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/more/separate_compilation.html b/more/separate_compilation.html new file mode 100644 index 0000000000..3121aa4c6a --- /dev/null +++ b/more/separate_compilation.html @@ -0,0 +1,385 @@ + + + + Guidelines for Authors of Boost Libraries Containing Separate Source + + + + + + + + +
+

C++ Boost

+ 		+

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.

+

Contents

+
+
Changes Affecting Source Code +
+
+
Preventing Compiler ABI Clashes
Static + or Dymanic Libraries 
Supporting Windows Dll's
+ Automatic Library Selection and Linking with auto_link.hpp +
+
+
Changes Affecting the Build System +
+
+
Creating the Library Jamfile
Testing + Auto-linking
+
+
Copyright
+
+

Changes Affecting Source Code

+

Preventing Compiler ABI Clashes

+

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:  

+
    +
  • + If you don't + use these in the library source files (but do in your library's headers) and + the user attempts to compile the library source with a non-default ABI setting, + then they will get compiler errors if there are any conflicts. +
  • + If you do include them in both the library's headers and the library + source files, then the code should always compile no matter what the compiler + settings used, although the result might not match what the user was expecting: + since we've forced the ABI back into default mode.
+

Rationale:

+

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.

+
Counter Argument #1:
+

Trust the user, if they want 13-byte alignment (!) let them have it.

+
Counter Argument #2:
+

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.

+

Static or Dynamic Libraries

+

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:

+
    +
  • + On Unix platforms it typically makes no difference to the code: the user just + selects in their makesfile which library they prefer to link to. +
  • + On Windows platforms, the code has to be specially annotated to support DLL's, + so we need to pick one option as the default and one as an alternative. +
  • + On Windows platforms, we can inject special code to automatically select which + library variant to link against: so again we need to decide which is to be the + default (see the section on auto-linking below).
+

The recomendation is to pick static linking by default.

+

Rationale:

+

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.

+

Supporting Windows Dll's

+

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();
+}
+
+

Importing/exporting dependencies

+

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.

+

Rationale:

+

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).

+

Automatic Library Selection and Linking with + auto_link.hpp

+

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.

+

Changes Affecting the Build System

+

Creating the library Jamfile

+

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 Auto-linking

+

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.

+
+

Revised + + 26 November, 2003

+

© 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/more/space.gif b/more/space.gif new file mode 100644 index 0000000000..f37c0249d5 Binary files /dev/null and b/more/space.gif differ diff --git a/more/submission_process.htm b/more/submission_process.htm new file mode 100644 index 0000000000..9a8108aeb3 --- /dev/null +++ b/more/submission_process.htm @@ -0,0 +1,133 @@ + + + + + + + +Boost Library Submission Process + + + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+

Boost Library Submission Process

+

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.

+

Steps for getting a library accepted by Boost:

+ +

Learn about Boost

+

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.

+

Determine interest

+

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. 

+

Preliminary submission

+

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.

+

Refinement

+

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.

+

Submission for review 

+

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. +

Formal Review

+

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. 

+ +

Boost web site posting

+

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.

+

People page

+

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.

+

Lifecycle

+

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/more/test_policy.htm b/more/test_policy.htm new file mode 100644 index 0000000000..30388004a0 --- /dev/null +++ b/more/test_policy.htm @@ -0,0 +1,100 @@ + + + + + + + +Boost Test Policies and Protocols + + + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+

Boost Test Policies and Protocols

+

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."

+

Regression test

+

Boost uses an automatic regression test suite which generates HTML +compiler +status tables.

+

Test Policy

+

Required

+
    +
  • Every Boost library should supply one or more suitable test programs to be + exercised by the Boost regression test suite.  In addition to + the usual compile-link-run tests expecting successful completion, + compile-only or compile-and-link-only tests may be performed, and success + for the test may be defined as failure of the steps.
    • +
  • Test program execution must report errors by returning a non-zero value.  They + may also write to stdout or stderr, but that output should be relatively + brief.  Regardless of other output, a non-zero return value is the only + way the regression test framework will recognize an error has + occurred. Note that test programs to be included in the status tables must + compile, link, and run quickly since the tests are executed many, many, + times.
    • +
  • Libraries with time consuming tests should be divided into a + fast-execution basic test program for the status tables, and a separate + full-coverage test program for exhaustive test cases.  The basic test + should concentrate on compilation issues so that the status tables + accurately reflect the library's likelihood of correct compilation on a + platform.
    • +
  • If for any reason the usual test policies do not apply to a particular + library, an alternate test strategy must be implemented.
    • +
  • A Jamfile to drive the + regression tests for the library.   
    • +
+

Optional (but highly recommended)

+

The Boost Test Library provides many +useful components which ease the construction of test programs.

+
    +
  • Use the library's + Test Tools for the construction of simple test + programs that do not need much structure.
    • +
  • Use the library's + Unit Test + Framework for the construction of more complex test programs that need to + be structured into individual tests + and test suites.
    • +
+

Suggested Protocol for Fixing Bugs or Adding Features.

+
    +
  • First, add regression test cases that detects the bug or tests the + feature. Sometimes adding one case suggests similar untested cases, and they + are added too.
    • +
  • Second, for bugs, run the regression test and verify that the bug is now + detected.
    • +
  • Third, then, and only then, fix the bug or add the feature.
    • +
  • Finally, rerun the full regression tests - sometimes the change breaks + something else.
    • +
+

History

+

See Regression Test History.

+

Acknowledgements

+

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/more/updating_the_website.html b/more/updating_the_website.html new file mode 100755 index 0000000000..1ee97f5929 --- /dev/null +++ b/more/updating_the_website.html @@ -0,0 +1,111 @@ + + + + + Updating The Boost Website + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

Making Updates to the Boost Website Content

+ +

Any boost developer can update the Boost website content between + releases.

+ +
    +
  • We strongly recommend the use of HTML Tidy when editing HTML and XHTML + files intented for the website. Using 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. +
    • + +
  • If the change you are making is intended to be part of a release, you + should first make the change in our CVS repository, so it doesn't get + lost or overwritten by the next person that updates the page between + releases. Of course if you don't check in (say because the change is not + supposed to be in the next release), and someone else changes the page + after you, the change may be lost. This procedure does not account for + that case; you'll have to use your head and figure out what to do.
    • + +
  • You will upload the file(s) by 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/
+
    +
    • + +
  • It is crucial to ensure that you set group write permission on + every file you upload. If you don't do that, nobody else will be able to + change it, which is particularly deadly at release time. If you are on + Unix or Cygwin, you may be able to do that with a chmod command + before uploading the file. The absolutely failsafe thing to do is to + ssh into shell.sf.net and do the chmod there. + The files also need to have general read permission, and any + directories should have general execute permission and the "set user or + group ID on execution" (s) bit should also be set. If you're not + touching any directories, you can do it all with one command, e.g. + 
    +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/more/version_history.html b/more/version_history.html new file mode 100644 index 0000000000..9fe8759f60 --- /dev/null +++ b/more/version_history.html @@ -0,0 +1,3231 @@ + + + + + Boost Version History + + + + + + +
+
+
+
+
+

+ +

“...one of the + most highly regarded and expertly designed C++ library projects + in the world.” — + Herb Sutter and Andrei + Alexandrescu, C++ Coding + Standards

+ + + +
+
+
+ +
+

Version History

+ +
+
+
+
+
+ +

1.34.1 (24 July 2007)

+ +

This is a bug fix release addressing many problems with the 1.34.0 release. + It is a recommended upgrade for all users of Boost 1.34.0. For a complete list of fixes see + Boost Trac.

+ +

Supported Compilers

+ +

New in this release is improved support for + the IBM XL C/C++ compiler.

+ +

Boost is tested on a wide range of compilers and + platforms. Since Boost libraries rely on modern C++ + features not available in all compilers, not all + Boost libraries will work with every compiler. + New in this release The + following compilers and platforms have been + extensively tested with Boost, although many other + compilers and platforms will work as well. For more + information, see the regression + test results.

+ + + +

Acknowledgements

+ +

Thomas Witt + managed this release.

+ +

A great number of people contributed their time + and expertise to make this release possible. Special + thanks go to Kim Barrett consolidating Boost.Iostreams changes + from various branches and Rene Rivera for general build and installation + support.

+
+
+ +

1.34.0 (12 May 2007)

+

New Libraries

+ +
    +
  • Foreach Library: + BOOST_FOREACH macro for easily iterating + over the elements of a sequence, from Eric + Niebler.
    • + +
  • Statechart + Library: Arbitrarily complex finite state + machines can be implemented in easily readable and + maintainable C++ code, from Andreas Huber.
    • + +
  • TR1 Library: An + implementation of the C++ Technical Report on + Standard Library Extensions, from John Maddock. + This library does not itself implement the TR1 + components, rather it's a thin wrapper that will + include your standard library's TR1 implementation + (if it has one), otherwise it will include the + Boost Library equivalents, and import them into + namespace std::tr1. Highlights + include: Reference Wrappers, Smart Pointers, + result_of, Function Object Binders, Polymorphic + function wrappers, Type Traits, Random Number + Generators and Distributions, Tuples, Fixed Size + Array, Hash Function Objects, Regular Expressions, + and Complex Number Additional Algorithms.
    • + +
  • Typeof + Library: Typeof operator emulation, + from Arkadiy Vertleyb and Peder Holt.
    • + +
  • Xpressive + Library: Regular expressions that can be + written as strings or as expression templates, and + that can refer to each other and themselves + recursively with the power of context-free + grammars, from Eric Niebler.
    • +
+ +

Updated Libraries

+ +
    + +
  • + Assign + Library: + +
      +
    • Support for + ptr_map<key,T> via the new + function ptr_map_insert()
      • + +
    • Support for initialization of Pointer + Containers when the containers hold + pointers to an abstract base class.
      • +
    +
    • + +
  • + Date_time library: +
      +
    • Support for new US/Canada timezone rules and + other bug fixes. See + Change History + for details. +
      • +
    +
    • + +
  • + Filesystem + Library: Major upgrade in preparation + for submission to the C++ Standards Committee for + TR2. Changes include: + +
      +
    • + Internationalization, provided by class + templates basic_path, + basic_filesystem_error, + basic_directory_iterator, and + basic_directory_entry.
      • + +
    • Simplification + of the path interface by eliminating special + constructors to identify native formats.
      • + +
    • + Rationalization of predicate function + design, including the addition of several new + functions.
      • + +
    • Clearer specification by reference to + POSIX, + the ISO/IEEE Single Unix Standard, with + provisions for Windows and other operating + systems.
      • + +
    • Preservation + of existing user code whenever possible.
      • + +
    • More + efficient directory iteration.
      • + +
    • Addition of a + recursive directory iterator.
      • +
    +
    • + +
  • Function + Library: Boost.Function now implements a + small buffer optimization, which can drastically + improve the performance when copying or + constructing Boost.Function objects storing small + function objects. For instance, + bind(&X:foo, &x, _1, _2) + requires no heap allocation when placed into a + Boost.Function object.
    • + +
  • + Functional/Hash + Library + +
      +
    • Use declarations for standard classes, so + that the library doesn't need to include all of + their headers
      • + +
    • Deprecated the + <boost/functional/hash/*.hpp> + headers.
      • + +
    • Add support for the + BOOST_HASH_NO_EXTENSIONS macro, which + disables the extensions to TR1
      • + +
    • Minor improvements to the hash functions + for floating point numbers.
      • +
    +
    • + +
  • + Graph + Library: + + +
    • + +
  • MultiArray + Library: Boost.MultiArray now by default + provides range-checking for + operator[]. Range checking can be + disabled by defining the macro + BOOST_DISABLE_ASSERTS before including + multi_array.hpp. A bug in + multi_array::resize() related + to storage orders was fixed.
    • + +
  • + Multi-index + Containers Library: + + +
    • + +
  • + Optional Library: + +
      +
    • boost::none_t and boost::none now added to Optional's documentation
      • +
    • Relational operators now directly support arguments of type 'T' and 'none_t'
      • +
    • operator->() now also works with reference types.
      • +
    • Helper functions make_optional(val), make_optional(cond,val) and + get_optional_value_or(opt,alternative_value) added.
      • +
    • Constructor taking a boolean condition (as well as a value) added.
      • +
    • Member function get_value_or(alternative_value) added.
      • +
    • Incompatbility bug with mpl::apply<> fixed.
      • +
    • Converting assignment bug with uninitialized lvalues fixed.
      • +
    +
    • + +
  • + Parameter + Library: + +
      +
    • Every ArgumentPack is now a valid MPL + Forward Sequence.
      • + +
    • Support for unnamed arguments (those whose + keyword is deduced from their types) is + added.
      • + +
    • Support for named and unnamed template + arguments is added.
      • + +
    • New overload generation macros solve the + + forwarding problem directly.
      • + +
    • See also the Python library changes, + below.
      • +
    +
    • + +
  • + Pointer Container + Library: + +
      +
    • Support for serialization via Boost.Serialization.
      • + +
    • Exceptions can be disabled by defining the + macro BOOST_PTR_CONTAINER_NO_EXCEPTIONS before + including any header. This macro is defined by + default if BOOST_NO_EXCEPTIONS is defined.
      • + +
    • Additional + std::auto_ptr<T> overloads + added s.t. one can also pass + std::auto_ptr<T> instead of + only T* arguments to member + functions.
      • + +
    • transfer() now has weaker + requirements s.t. one can transfer objects from + ptr_container<Derived> to + ptr_container<Base>,
      • +
    +
    • + +
  • + Python + Library: + +
      +
    • Boost.Python now automatically appends C++ + signatures to docstrings. The new + docstring_options.hpp header is + available to control the content of + docstrings.
      • + +
    • + stl_input_iterator, for + turning a Python iterable object into an STL + input iterator, from Eric Niebler.
      • + +
    • Support for void* conversions + is added.
      • + +
    • Integrated support for wrapping C++ + functions built with the parameter library; + keyword names are automatically known to + docsstrings.
      • + +
    • Enhancements to the API for better embedding support + (boost::python::import(), + boost::python::exec(), + and boost::python::exec_file()).
      • + +
    +
    • + +
  • Signals Library: + More improvements to signal invocation performance from + Robert Zeh.
    • + +
  • + Smart + Pointers Library: + + +
    • + +
  • + + String Algorithm Library: + +
      +
    • lexicographical_compare
      • +
    • join
      • +
    • + New comparison predicates is_less, is_not_greater. +
      • +
    • + Negative indexes support (like Perl) in various algorihtms + (*_head/tail, *_nth). +
      • +
    +
    • +
  • + Wave + Library: + +
      +
    • Wave now correctly recognizes pp-number + tokens as mandated by the C++ Standard, which + are converted to C++ tokens right before they + are returned from the library.
      • + +
    • Several new preprocessing hooks have been + added. For a complete description please refer + to the related documentation page: The + Context Policy.
      • + +
    • Shared library (dll) support has been added + for the generated Wave libraries.
      • + +
    • The overall error handling has been + improved. It is now possible to recover and + continue after an error or a warning was + issued.
      • + +
    • Support for optional comment and/or full + whitespace preservation in the generated output + stream has been added.
      • + +
    • The Wave library now performs automatic + include guard detection to avoid accessing header + files more than once, if appropriate.
      • + +
    • Full interactive mode has been added to the Wave + tool. Now the Wave tool can be used just like Python + or Perl for instance to interactively try out your + BOOST_PP macros. Additionally it is now possible to + load and save the current state of an interactive session + (macro tables et.al.).
      • + +
    • The overall performance has been improved by upto + 40-60%, depending on the concrete files to process.
      • + +
    • Support for new pragmas has been added allowing to + control certain library features from inside the + preprocessed sources (partial output redirection, + control of generated whitespace and #line directives).
      • + +
    • Optional support for #pragma message "..." + has been added.
      • + +
    • This version also includes a number of bug + fixes and usage improvements. For a complete + list of changes, see the libraries change log.
      • +
    +
    • +
+ +

Supported Compilers

+ +

Boost is tested on a wide range of compilers and + platforms. Since Boost libraries rely on modern C++ + features not available in all compilers, not all + Boost libraries will work with every compiler. The + following compilers and platforms have been + extensively tested with Boost, although many other + compilers and platforms will work as well. For more + information, see the regression + test results.

+ +
    +
  • Apple + GCC 4.0.1 on Mac OS X.
    • + +
  • Borland + C++ 5.8.2 on Windows.
    • + +
  • GNU C++ +
      +
    • + 3.2.x., 3.3.x, 3.4.x, 4.0.x, 4.1.x on Linux +
      • +
    • + 4.1.x on Solaris +
      • +
    • + 3.4.x on Windows +
      • +
    +
    • + +
  • HP + aC++ A.06.14.
    • + +
  • + Intel C++ 9.1 on Windows, 9.0 on Linux.
    • + +
  • Metrowerks + CodeWarrior 9.4 on Windows.
    • + +
  • Microsoft + Visual C++ 6.0 (sp5, with and without STLport), + 7.0, 7.1, 8.0. Note: Boost does not support the + non-standard "Safe" C++ Library shipping with + Visual C++ 8.0, which may result in many spurious + warnings from Boost headers and other + standards-conforming C++ code. To suppress these + warnings, define the macro + _SCL_SECURE_NO_DEPRECATE.
    • + +
  • + Sun Studio 11 + on Solaris.
    • + +
+ +

Acknowledgements

+ +

Thomas Witt + managed this release.

+ +

A great number of people contributed their time + and expertise to make this release possible. Special + thanks go to Vladimir Prus for making Boost.Build version 2 + a reality, David Abrahams for authoring a new getting + started guide and Greg D. for answering + countless questions.

+ +
+
+ +

1.33.1 (5 Dec 2005)

+

Updated Libraries

+ +
    +
  • Any Library: Cast to + reference types introduced in 1.33.0 is now + documented on any_cast documentation + page.
    • + +
  • + Bind Library: + + Bind expressions now support + + comparisons and negation. Example: + bind(&X::name, _1) < bind(&X::name, + _2). +
    • + +
  • Config Library: + Don't undef BOOST_LIB_TOOLSET after use.
    • + +
  • + Boost.Python: + +
      +
    • The build now assumes Python 2.4 by + default, rather than 2.2
      • + +
    • Support Python that's built without Unicode + support
      • + +
    • Support for wrapping classes with + overloaded address-of (&) + operators
      • +
    +
    • + +
  • Smart Pointer + Library: Fixed problems under Metrowerks + CodeWarrior on PowerPC (Mac OS X) with inlining on, + GNU GCC on PowerPC 64.
    • + +
  • Regex + Library: Fixed the supplied makefiles, + and other small compiler specific changes. Refer to + the regex + history page for more information on these and + other small changes.
    • + +
  • Iostreams + Library: Improved the interface for + accessing a chain's components, added + is_open members to the file and file + descriptor devices, fixed memory-mapped files on + Windows, and made minor changes to the + documentation.
    • + +
  • + Boost.Python: + +
      +
    • Added support for docstrings on nonstatic + properties.
      • + +
    • We now export the client-provided + docstrings for init<optional<> + > and + XXX_FUNCTION_OVERLOADS() + for only the last overload.
      • + +
    • Support for Embedded VC++ 4 and GCC-3.3 on + MacOS added
      • + +
    • Introduced better support for rvalue + from-python conversions of shared_ptr.
      • + +
    • Support for exposing + vector<T*> with the indexing + suite.
      • + +
    • updated visual studio project build + file.
      • + +
    • Added search feature to the index + page.
      • +
    +
    • + +
  • Functional/Hash + Library: Fixed the points example.
    • + +
  • Multi-index + Containers Library: Fixed a problem with + multithreaded code, and other minor changes. Refer + to the library + release notes for further details.
    • + +
  • + Graph + Library: + +
      +
    • Fixed a problem with the relaxed heap on + x86 Linux (fixes bug in + dijkstra_shortest_paths).
      • + +
    • Fixed problems with + cuthill_mckee_ordering and king_ordering + producing no results.
      • + +
    • Added color_map parameter to + dijkstra_shortest_paths.
      • +
    +
    • + +
  • Signals + Library: Fixed problems with the use of + Signals across shared library boundaries.
    • + +
  • Thread + library: read_write_mutex + has been removed due to problems with + deadlocks.
    • + +
  • Wave library + (V1.2.1) Fixed a couple of problems, refer + to the change log + for further details.
    • +
+ +

Supported Compilers

+ +

Boost is tested on a wide range of compilers and + platforms. Since Boost libraries rely on modern C++ + features not available in all compilers, not all + Boost libraries will work with every compiler. The + following compilers and platforms have been + extensively tested with Boost, although many other + compilers and platforms will work as well. For more + information, see the regression + test results.

+ +

New for this release: Support for building + with the newest STLport-5.0 was added. The support + includes building with MinGW Runtime 3.8 plus + STLport-5.0 improved to support wide character + operations. Apple GCC 4.0, HP Tru64 C++, and + Microsoft Visual C++ 8.0 are supported platforms. We + have added an experimental autoconf-like + configure script for Unix-like systems: + run configure --help for more + information.

+ +
    +
  • Apple + GCC 3.3, 4.0 on Mac OS X.
    • + +
  • Borland + C++ 5.6.4 on Windows.
    • + +
  • GNU C++ 2.95.3 + (with and without STLport), 3.2.x., 3.3.x, 3.4.x, + 4.0.x on Windows, Linux and Solaris.
    • + +
  • HP + C++ for Tru64 UNIX 7.1.
    • + +
  • + Intel C++ 8.1, 9.0 on Windows, Linux.
    • + +
  • Metrowerks + CodeWarrior 8.3, 9.4, 9.5 on Mac OS X and + Windows.
    • + +
  • Microsoft + Visual C++ 6.0 (sp5, with and without STLport), + 7.0, 7.1, 8.0. Note: Boost does not support the + non-standard "Safe" C++ Library shipping with + Visual C++ 8.0, which may result in many spurious + warnings from Boost headers and other + standards-conforming C++ code. To suppress these + warnings, define the macro + _SCL_SECURE_NO_DEPRECATE.
    • +
+ +

Acknowledgements

+ +

Medieval Mr. Gregor Douglas Gregor managed + this release.

+ +

A great number of people contributed their time + and expertise to make this release possible. Special + thanks go to Aleksey Gurtovoy and Misha Bergal, who + managed to keep the regression testing system working + throughout the release process; David Abrahams, Beman + Dawes, Aleksey Gurtovoy, Bronek Kozicki, Rene Rivera + and Jonathan Turkanis for greatly improving the + quality of this release; Rene Rivera for the new + Boost web page design; and Zoltan "cad" Juhasz for + the new Boost logo.

+
+
+

1.33.0 (11 Aug 2005)

+ +

New Libraries

+ +
    +
  • Iostreams + Library: Framework for defining streams, + stream buffers and i/o filters, from Jonathan + Turkanis.
    • + +
  • Functional/Hash + Library: A TR1 hash function object that can + be extended to hash user defined types, from Daniel + James.
    • + +
  • Parameter + Library: Write functions that accept + arguments by name: especially useful when a function + has more than one argument with a useful default value, + since named arguments can be passed in any order.
    • + +
  • Pointer Container + Library: Containers for storing + heap-allocated polymorphic objects to ease + OO-programming, from Thorsten Ottosen.
    • + +
  • Wave: Standards + conformant implementation of the mandated C99/C++ + preprocessor functionality packed behind an easy to use + iterator interface, from Hartmut Kaiser.
    • +
+ +

Updated Libraries

+ +
    +
  • Any Library: + any_cast has been enhanced to allow direct + access to any's held value.
    • + +
  • Assignment + Library: Support for Pointer Container + Library and new efficient functions + ref_list_of() and + cref_list_of() for generating anonymous + ranges.
    • + +
  • Bind Library: Bind + expressions now support comparisons and + negation. Example: bind(&X::name, _1) + < bind(&X::name, _2).
    • + +
  • + Date-Time + Library: + + +
    • + +
  • + Graph + Library: Introduced several new algorithms + and improved existing algorithms: + + +
    • + +
  • + Multi-index + Containers Library: + + +
    • + +
  • + Program + Options Library: + +
      +
    • Option descriptions are now printed with word + wrapping.
      • + +
    • Command line parser can bypass unregistered + options, instread of throwing.
      • + +
    • Removed support for "implicit" (optional) + values.
      • + +
    • New customization method + 'command_line_parser::extra_style_parser'. Unlike + 'additional_parser', allows the user to parse + several tokens and return a vector of options, not + just a single option.
      • + +
    • Work with disabled exceptions.
      • +
    +
    • + +
  • Property Map + Library: Introduced the + dynamic properties class, which provides + dynamically-typed access to a set of property + maps.
    • + +
  • + Boost.Python: + +
      +
    • Added support for docstrings on nonstatic + properties.
      • + +
    • We now export the client-provided docstrings + for init<optional<> > and + XXX_FUNCTION_OVERLOADS() for + only the last overload.
      • + +
    • Support for Embedded VC++ 4 and GCC-3.3 on + MacOS added
      • + +
    • Introduced better support for rvalue + from-python conversions of shared_ptr.
      • + +
    • Support for exposing + vector<T*> with the indexing + suite.
      • + +
    • updated visual studio project build file.
      • + +
    • Added search feature to the index page.
      • +
    +
    • + +
  • Random Number + Library: improved initialization for + mersenne_twister, algorithm by Makoto + Matsumoto and Takuji Nishimura, implemented for Boost + by Jens Maurer.
    + Note: All test vectors for + mersenne_twisters constructed or seeded + without parameters or with a single unsigned + int parameter become invalid.
    • + +
  • Range Library: + Minor addition of convenience functions to + iterator range like front(), + back() and operator[]().
    • + +
  • + Regex Library: + +
      +
    • Rewritten front end parser now supports + (?imsx-imsx) constructs, plus lookbehind assertions + and conditional expressions.
      • + +
    • Thin wrapper classes improve integration with + MFC/ATL code.
      • + +
    • Full (optional) Unicode support via the ICU + library.
      • +
    Refer to the regex history + page for more information on these and other + small changes. +
    • + +
  • + Serialization + Library: + +
      +
    • DLL version.
      • + +
    • Auto-linking.
      • + +
    • Serialization of variants.
      • + +
    • Improved serialization of shared pointers.
      • +
    +
    • + +
  • Signals Library: + added slot blocking/unblocking, from Frantz Maerten. + Huge improvements to signal invocation performance from + Robert Zeh.
    • +
+ +

Supported Compilers

+ +

Boost is tested on a wide range of compilers and + platforms. Since Boost libraries rely on modern C++ + features not available in all compilers, not all Boost + libraries will work with every compiler. The following + compilers and platforms have been extensively tested with + Boost, although many other compilers and platforms will + work as well. For more information, see the regression + test results.

+ +
    +
  • Apple GCC + 3.x on Mac OS X.
    • + +
  • Borland + C++ 5.6.4 on Windows.
    • + +
  • GNU C++ 2.95.3 + (with and without STLport), 3.2.x., 3.3.x, 3.4.x, 4.0.x + on Windows, Linux and Solaris.
    • + +
  • + Intel C++ 8.1, 9.0 on Windows, Linux.
    • + +
  • Metrowerks + CodeWarrior 8.3, 9.4, 9.5 on Mac OS X and + Windows.
    • + +
  • Microsoft Visual + C++ 6.0 (sp5, with and without STLport), 7.0, 7.1, + 8.0 beta. Note: due to intermittent problems with + Visual C++ 8.0 beta, and the presence of a variety of + pre-release compiler builds, we are unable to guarantee + compatibility until the final compiler is + released.
    • +
+ +

Acknowledgements

+ +

Medieval Mr. GregorDouglas Gregor managed + this release.

+ +

A great number of people contributed their time and + expertise to make this release possible. Special thanks + go to Aleksey Gurtovoy and Misha Bergal, who managed to + keep the regression testing system working throughout the + release process; David Abrahams, Beman Dawes, Aleksey + Gurtovoy, Rene Rivera and Jonathan Turkanis for greatly + improving the quality of this release; Rene Rivera for + the new Boost web page design; and Zoltan "cad" Juhasz + for the new Boost logo.

+
+ +
+

1.32.0 (19 Nov 2004)

+ +

Important - New Toolset Names

+ +

The names of some the Boost.Build toolsets have been + changed to remove the "." (dot) character + and to fix some other naming inconsistencies. For + example, vc7.1 toolset was renamed to become + vc-7_1. Please refer to the Supported Toolsets + section of the installation guide for the complete list + of the current toolset names. This change was made as a + part of the effort to make the Boost distribution + compatible with ISO 9660 level 2 requirements.

+ +

New Libraries

+ +
    +
  • Assignment + Library: Filling containers with constant or + generated data has never been easier, from Thorsten + Ottosen.
    • + +
  • Minmax + Library: Standard library extensions for + simultaneous min/max and min/max element computations, + from Hervé Brönnimann.
    • + +
  • Multi-index + Containers Library: Containers with multiple + STL-compatible access interfaces, from Joaquín M + López Muñoz.
    • + +
  • Numeric + Conversion Library: Optimized policy-based + numeric conversions, from Fernando Cacciola.
    • + +
  • Program Options + Library: Access to configuration data given + on command line, in config files and other sources, + from Vladimir Prus.
    • + +
  • Range Library: a + new infrastructure for generic algorithms that builds + on top of the new iterator concepts, from Thorsten + Ottosen.
    • + +
  • Serialization + Library: Serialization/de-serialization of + arbitrary C++ data structures to various formats + including text, binary, and xml, from Robert + Ramey.
    • + +
  • String Algorithms + Library: Collection of string related + algorithms for case conversion, trimming, find/replace + operations and more, from Pavol Droba.
    • + +
  • Tribool: 3-state + boolean type library, from Doug Gregor.
    • +
+ +

Updated Libraries

+ +
    +
  • Compose: This deprecated library has been + removed.
    • + +
  • + Graph: + + +
    • + +
  • + MPL Library: + +
      +
    • Updated to use the Boost Software License.
      • + +
    • New documentation, + including a complete reference + manual.
      • + +
    • Major interface changes and improvements, many + of which are not backward compatible. + Please refer to the + 1.32 changelog for the detailed information + about upgrading to the new version.
      • +
    +
    • + +
  • + Python + Library: + +
      +
    • Updated to use the Boost Software License.
      • + +
    • a new, + better method of wrapping classes with virtual + functions has been implemented.
      • + +
    • Support for the new Python Bool type, thanks to + Daniel Holth.
      • + +
    • Support for upcoming GCC symbol export control + features have been folded in, thanks to Niall + Douglas.
      • + +
    • Improved support for + std::auto_ptr-like types.
      • + +
    • Components used by other libraries have been + moved out of python/detail and into + boost/detail to improve dependency + relationships.
      • + +
    • Miscellaneous bug fixes and compiler + workarounds.
      • +
    +
    • + +
  • Signals Library: + Introduced deterministic slot ordering, permitting + slots to be connected at the beginning or end of slot + groups or the slot list itself. Combiners may safely + have state and are accessible from the signal.
    • + +
  • Utility: class + template result_of + added.
    • + +
  • + Test Library: + +
      +
    • namespace names gets shorten; old one still + supported till next release
      • + +
    • added proper encoding of XML PCDATA
      • + +
    • support for wide string comparison + implemented
      • +
    For complete list of changes see Test Library + release + notes. +
    • +
+ +

Regression tests

+ +

This release has been extensively tested on a variety + of different compilers and platforms. It is known to + contain no regressions against the previous reference + release on the compilers and configurations tested. + Please refer to the corresponding + regression reports to see how well your compiler + performs on the new Boost codebase.

+ +

Acknowledgements

+ +

+Aleksey Gurtovoy + managed this release. Managing a release at all is + an enormous job, and Aleksey always goes beyond merely + meeting requirements by insisting on the highest possible + quality. The Boost membership owes him a debt of + gratitude.

+ +

This release wouldn't have been possible without the + dedicated effort of many, many members of the Boost + community who generously contributed their outstanding + expertise, time and energy to making it happen. For + patches, bug fixes, troubleshooting, expert advice, and + prompt responses to the release manager's requests we + thank:

+ +

David Abrahams, Misha Bergal, Jonathan Brandmeyer, + Fernando Cacciola, Marshall Clow, Christopher Currie, + Pavol Droba, Caleb Epstein, Eric Friedman, Jeff Garland, + Michael Glassford, Doug Gregor, Joel de Guzman, Hubert + Holin, Jaakko Järvi, Hartmut Kaiser, Bronek Kozicki, + Tarjei Knapstad, Toon Knapen, Aaron W. LaFramboise, + Joaquín M López Muñoz, Christoph + Ludwig, John Maddock, Paul Mensonides, Guillaume + Melquiond, Thorsten Ottosen, Vladimir Prus, Robert Ramey, + Rene Rivera, Gennadiy Rozental, Stefan Slapeta, Jonathan + Turkanis, Pavel Vozenilek, Jonathan Wakely, Daryle + Walker, Victor A. Wagner Jr. and Martin Wille.

+ +

Also, our special thanks go to: John Maddock for the + managing the effort of converting the majority of the + Boost libraries to the Boost + Software License, Eric Niebler and Joel de Guzman for + taking on the important job of improving the Boost + documentation's look and feel, and last, but not least, + to our regression test runners, without whom we simply + would never have released: Toon Knapen, Bronek Kozicki, + Rene Rivera, Markus Schöpflin, Stefan Slapeta, + Victor A. Wagner Jr. and Martin Wille.

+ +

Thank you everybody!

+
+ +
+

1.31.0 (26 Jan 2004)

+ +

New License

+ +

A unified Boost Software + License has been developed and will gradually replace + the individual licenses for most Boost libraries. The new + license offers better legal protection for both users and + developers, and should speed user's legal reviews of + Boost libraries. 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 issues and drafts of + various legal documents.

+ +

Note: Many of the Boost libraries are + still using earlier licenses, though all conform to the + Boost License + Requirements. After this release we will begin an + effort to move toward uniform use of the new license.

+ +

Build and Installation

+ +
    +
  • New Getting + Started procedures ease download and installation, + from Rene Rivera and others.
    • + +
  • Improved support for libraries requiring separate compilation, + from John Maddock and others.
    • +
+ +

New Libraries

+ +
    +
  • enable_if: + Selective inclusion of function template overloads, + from Jaakko Järvi, Jeremiah Willcock, and Andrew + Lumsdaine. This is an important new technique which + exploits the SFINAE + (substitution-failure-is-not-an-error) principle.
    • + +
  • Variant + Library: Safe, generic, stack-based + discriminated union container, from Eric Friedman and + Itay Maman.
    • +
+ +

Updated Libraries

+ +
    +
  • Compose: This + library has been deprecated and will be removed in a + future release. Use Bind or Lambda + instead.
    • + +
  • Date Time + Library: A whole host of bug fixes, new + features, and documentation improvements. See the Date + Time Change History for details.
    • + +
  • Filesystem + Library: Several added functions, including + improved checking for directory and file name + portability.
    • + +
  • Iterator Library: Major + version upgrade, with interface as proposed for the C++ + library TR, including an improved + iterator_adaptor design plus several new + components, from David Abrahams, Jeremy Siek, and + Thomas Witt.
    • + +
  • MultiArray: + The multi_array class template now + provides an element-preserving resize operation as well + as default construction (see the reference + manual for more information).
    • + +
  • + Python + Library: + +
      +
    • Support for Python 2.3 and Intel C++ on + Linux
      • + +
    • Container Indexing + Suite added.
      • + +
    • injected constructors and wrapped function + objects.
      • + +
    • wrapping static data members.
      • + +
    • std::wstring conversions.
      • + +
    • Improved keyword + arguments.
      • + +
    • Better error messages, including name + demangling for GCC.
      • + +
    • Simpler build + procedure.
      • + +
    • ...and more....
      • +
    +
    • + +
  • Random Number + Library: Interface changed to match the C++ + TR + proposal, from Jens Maurer.
    • + +
  • Regex: + Completely new matching algorithm is now much faster + than before, plus a selection of new features and + enhancements.
    • + +
  • + Boost.Spirit + 1.8.0: + +
      +
    • Multiple grammar start rules
      • + +
    • Multiple Scanner rules (no more scanner + business woes)
      • + +
    • More dynamic parsers
      • + +
    • Predefined actors
      • + +
    • Numerous bug fixes and QOI stuff
      • + +
    • ...and more...
      • +
    + +

    Starting from Spirit v1.8.0, ill conforming + compilers will no longer be supported. If you are + still using one of these older compilers, please use + Spirit v1.6.x. See Spirit's Site for more + details.

    +
    • + +
  • + Test Library: + +
      +
    • Free function template based test case
      • + +
    • Custom exception translators support in + execution monitor and register_exception_translator + added for unit test framework
      • + +
    • Added support for multi-module unit tests in + automatic registration facility
      • + +
    • Floating point comparison algorithm reworked + (Is not backward compatible!!!)
      • + +
    • Added support for custom users predicate + returning both boolean result code and possibly + error message
      • + +
    • Documentation structure rework and update
      • +
    + +

    For a complete list of changes see the Test + Library release + notes.

    +
    • +
+ +

Miscellaneous

+ +
    +
  • Expanded testing and fixes for non-conforming + compilers.
    • + +
  • Web site hosting now provided by SourceForge.
    • +
+
+ +
+

1.30.2 (19 Aug 2003)

+ +
    +
  • Boost + Consulting is now hosting Boost CVS mirrors - see + our download + page.
    • + +
  • Backported changes to the config system, to + better handle new compiler releases.
    • + +
  • Bugs in regression reporting in subproject tests + were fixed.
    • + +
  • Tests are now run in the context of the user's PATH + environment settings
    • + +
  • msvc-stlport and intel-win32-stlport + toolsets now build static libraries with multithreading + enabled, to be compatible with the STLPort builds.
    • + +
  • intel-win32 + toolset now handles wchar_t correctly when + intel is installed over msvc6.
    • + +
  • Backported fixes from the main trunk which prevent + errors building the Boost.Test library in + its default configuration.
    • + +
  • Backported portability improvements for checked_delete.
    • + +
  • Locale support for metrowerks (requiring a + statically-linked runtime) is more uniformly + handled.
    • + +
  • Backported conversion/lexical_cast's + wchar_t fixes from the main trunk.
    • + +
  • intel-linux-tools: + added rt to FINDLIBS in order to make the + clock_gettime() function available + (backport of a patch in CVS HEAD).
    • + +
  • regression/compiler_status.cpp: + backported fixes in error log links generation.
    • +
+
+ +
+

1.30.1 (4 Aug 2003; withdrawn 12 Aug 2003)

+ +

Fixes were made to the following libraries:

+ +
    +
  • The Boost.Lambda + ..library is now usable with gcc-2.95.2
    • + +
  • + Boost.Spirit: + +
      +
    • Fixed. Using MSVC++6 (SP5), calling the assign + action with a string value on parsers using the + file_iterator will not work.
      • + +
    • Fixed: using assign semantic action in a + grammar with a multi_pass iterator adaptor applied + to an std::istream_iterator resulted in a failure + to compile under msvc 7.0.
      • + +
    • Fixed: There is a bug in the + range_run<CharT>::set(range<CharT> + const& r) function in + "../boost/spirit/utility/impl/chset/range_run.ipp".
      • + +
    • Fixed: handling of trailing whitespace bug + (ast_parse/pt_parse related)
      • + +
    • Fixed: comment_p and end of data bug
      • + +
    • Fixed: Most trailing space bug
      • + +
    • Fixed: chset<>::operator + ~(range<>) bug, operator + &(chset<>, range<>) bug, + operator &(range<>, + chset<>) bug
      • + +
    • Fixed: impl::detach_clear bug
      • + +
    • Fixed: mismatch closure return type bug
      • + +
    • Fixed: access_node_d[] and + access_match_d[] iterator bugs
      • + +
    • Fixed a bug regarding thread safety of + Phoenix/Spirit closures.
      • +
    +
    • + +
  • The Boost Template Metaprogramming Library + (MPL)'s ..typeof implementation is now + compatible with Metrowerks CodeWarrior Pro8.
    • + +
  • Boost.Function: + workaround for the new Borland patch (version 0x564) + and MSVC++ .NET 2003.
    • + +
  • Boost.Config, Boost.Format, and + Boost.Regex + ..have been adjusted to avoid warnings with GCC-3.3, + and Boost.Format also now works with string types other + than std::string.
    • + +
  • + Smart + Pointers: + +
      +
    • checked_delete now works on more + platforms
      • + +
    • Compatibility with the SunPro compiler
      • + +
    • Added missing #includes.
      • +
    +
    • + +
  • + Boost.Python: + +
      +
    • warning suppression for finicky compilers
      • + +
    • fixed a crashing bug in the + raw_function facility when no keyword + arguments were passed.
      • + +
    • Improved conversion of NULL + shared_ptrs to Python.
      • +
    +
    • +
+
+ +
+

1.30.0 (19 Mar 2003)

+ + +
+ +
+

1.29.0 (10 Oct 2002)

+ +
    +
  • Date-Time + Library added - Dates, times, leap seconds, + infinity, and more, from Jeff Garland.
    • + +
  • Dynamic + Bitset added - A runtime sized version of the + std::bitset class from Jeremy Siek and + Chuck Allison.
    • + +
  • Format + Library added - Type-safe 'printf-like' format + operations, from Samuel Krempp.
    • + +
  • Function + Library: Major syntactic changes have been made. + Some old syntax and little-used features have been + deprecated (and will be removed shortly), and the + syntax for the boost::function class + template has been greatly improved on conforming + compilers. Please see the compatibility note for more + information.
    • + +
  • Multi-array + Library added - Multidimensional containers and + adaptors for arrays of contiguous data, from Ron + Garcia.
    • + +
  • Preprocessor + Library: Major upgrade, from Paul Mensonides.
    • + +
  • Python + Library - Version 2 is released, from Dave Abrahams + and others. This is a major rewrite which works on many + more compilers and platforms, with a completely new + interface and lots of new features. Boost.Python v2 + requires Python 2.2 or later.
    • + +
  • Signals + Library added - Managed signals & slots + callback implementation, from Doug Gregor.
    • + +
  • Test + Library: Major new version, including full unit + test capabilities, from Gennadiy Rozental.
    • + +
  • uBLAS + Library added - Basic linear algebra for dense, + packed and sparse matrices, from Joerg Walter and + Mathias Koch.
    • +
+
+ +
+

1.28.0 (15 May 2002)

+ + +
+ +
+

1.27.0 (5 Feb 2002)

+ + +
+ +
+

1.26.0 (30 Nov 2001)

+ + +
+ +
+

1.25.1 (5 Nov 2001)

+ +
    +
  • Boost Build + System: Continued improvements.
    • + +
  • Config + Library: Continued refinements.
    • + +
  • Graph + Library: Final cleanup for upcoming the Boost Graph + Library book.
    • + +
  • Thread + Library: Minor fixes - tests now pass on most Win32 + and POSIX systems including Linux and Solaris. + Semaphore removed as too error prone.
    • + +
  • Function + Library: direct support for member function + pointers and documentation updates.
    • + +
  • Boost-Users + mailing list has been created to address topics of + interest to users of Boost libraries.
    • + +
  • + Boost Wiki web added. Provides a place for Boost + users to openly discuss and document the use of Boost + libraries. It is not officially maintained by Boost + developers.
    • +
+
+ +
+

1.25.0 (1 Oct 2001)

+ +
    +
  • Thread + Library added. Portable C++ multi-programming at + last, from William Kempf.
    • + +
  • Base From + Member added to Utility Library. + Support for the base from member idiom, from Daryle + Walker.
    • + +
  • Bind and + mem_fn added - + Generalized binders for function/object/pointers and + member functions, from Peter Dimov.
    • + +
  • Array + Library: Minor updates, from Nico Josuttis.
    • + +
  • Config + Library: major redesign with much improved and + automated configuration of Boost libraries for specific + compilers, from John Maddock.
    • + +
  • Random Number + Library: Fixed bug when copying normal_distribution + and improved the documentation, from Michael Stevens + and Jens Maurer.
    • + +
  • Special + functions, octonions, + quaternions + updated, now useable with many more compilers, plus + three new special functions, from Hubert Holin, Eric + Ford, and others.
    • + +
  • Tokenizer + Library: fixes/enhancements to + escaped_list_separator based on empty fields and tokens + comments from Johan Nillson and Jens Maurer.
    • + +
  • Coming Soon - A mailing list for Boost users!
    • +
+
+ +
+

1.24.0 (19 Aug 2001)

+ +
    +
  • Tuple + Library added. Tuples ease definition of functions + returning multiple values, and more, from Jaakko + Järvi.
    • + +
  • Minor fixes to some other libraries.
    • + +
  • Boost Build + System added. Preliminary release of an innovative + build system for Boost libraries, from Dave Abrahams + and others.
    • + +
  • Formal Review + Schedule added. Shows current, future, and recent + past review dates.
    • +
+
+ +
+

1.23.0 (6 Jul 2001)

+ +
    +
  • Any Library + added. Safe, generic container for single values of + different value types, from Kevlin Henney.
    • + +
  • Function + Library added. Function object wrappers for + deferred calls or callbacks, from Doug Gregor.
    • + +
  • Tokenizer + Library added. Break a string into a series of + tokens, from John Bandela.
    • + +
  • Special + functions, octonions, + quaternions + added, from Hubert Holin.
    • + +
  • Smart + Pointer Library: shared_ptr polymorphic pointers + now work on more broken compilers.
    • + +
  • IBM/Aix Compiler status table contributed by Toon + Knapen.
    • + +
  • Minor fixes to a number of other libraries.
    • +
+
+ +
+

1.22.0 (25 May 2001)

+ + +
+ +
+

1.21.2 (24 Apr 2001)

+ +
    +
  • Compatibility + Library added: Help for non-conforming standard + libraries missing CXX headers from Ralf + Grosse-Kunstleve, and help for missing standard library + <limits> header from Jens Maurer. (These are + unreviewed implementation libraries, treated as + maintenance steps only.)
    • + +
  • Random Number + Library: Split into separate headers, updated + documentation, added lagged_fibonacci generator.
    • + +
  • Integer + Library: Minor portability update.
    • + +
  • Graph + Library: Changed algorithm interfaces to use named + parameters technique. Added graph isomorphism + algorithm.
    • + +
  • Download refinements - files now available from + either FTP or web server.
    • + +
  • Tracker + Added: View and submit bug, support, and feature + requests.
    • + +
  • Minor portability fixes in several other + libraries.
    • +
+
+ +
+

1.21.1 (14 Mar 2001)

+ + +
+ +
+

1.21.0 (9 Mar 2001)

+ + +
+ +
+

1.20.2 (10 Feb 2001)

+ + +
+ +
+

1.20.1 (10 Jan 2001)

+ + +
+ +
+

1.20.0 (6 Jan 2001)

+ + +
+ +
+

1.19.0 (10 Dec 2000)

+ + +
+ +
+

1.18.3 (18 Nov 2000)

+ + +
+ +
+

1.18.2 (3 Nov 2000)

+ +
    +
  • Cast + Library Fix numeric_cast<> bugs with floating + types.
    • + +
  • Graph + Library minor fixes.
    • + +
  • Regular + Expression Library minor fixes.
    • + +
  • Configuration + Header more fixes for broken compilers.
    • + +
  • Boost Header Dependencies page added.
    • + +
  • Terminology change: Several headers previously + lumped together as a "utility" library are now + considered separate libraries. For historical reasons, + their non-header files still live in the "utility" + sub-directory.
    • +
+
+ +
+

1.18.1 (15 Oct 2000)

+ + +
+ +
+

1.18.0 (28 Sep 2000)

+ +
    +
  • Preliminary release of two important new libraries: + +
      +
    • Graph + Library - Generic graph components and + algorithms from Jeremy Siek and a University of + Notre Dame team.
      • + +
    • Regular + Expression Library - Text pattern matching in + all its glory from John Maddock.
      • +
    +
    • + +
  • Other changes: + +
      +
    • Array + Library improvements reflecting formal review + comments.
      • + +
    • functional.hpp + compiler workarounds added.
      • + +
    • tie() function template added to + utility.hpp for easier handling of + std::pair<> return values.
      • + +
    • Integer + Library improved handling of 64-bit + integers.
      • + +
    • Minor web site page updates.
      • +
    +
    • +
+
+ +
+

1.17.0 (3 Aug 2000)

+ +
    +
  • Array + Library added - An STL compliant container wrapper + for arrays of constant size from Nicolai Josuttis.
    • + +
  • array traits header renamed array_traits.hpp (was + array.hpp).
    • + +
  • Random Number + Library: more minor changes to support more + compilers.
    • + +
  • Smart + Pointer Library: performance reducing + exception-specifications removed.
    • + +
  • Compiler and test program fixes for call_traits, + compressed_pair, and type_traits.
    • + +
  • Updated cast.hpp to + clear compiler warning messages.
    • + +
  • Linux Compiler Status + added.
    • + +
  • Boost source code now lives in a publicly + accessible Concurrent Versions System (CVS) + repository.
    • +
+
+ +
+

1.16.1 (5 Jul 2000)

+ + +
+ +
+

1.16.0 (28 Jun 2000)

+ + +
+ +
+

1.15.1 (21 Jun 2000)

+ +

Fixes to cast.hpp and + operators + fix. Minor additions to config.hpp for Microsoft + compilers. The 1.15.0 operators changes seem to have + introduced incompatibilities. We are working on fixing + them, and have started to build a regression test to + prevent similar future problems.

+
+ +
+

1.15.0 (17 Jun 2000)

+ +

Random Number + Library from Jens Maurer added. Updated utility + library operators eliminates + code bloat. Minor additions to config.hpp and cast.hpp for Microsoft + compilers.

+
+ +
+

1.14.3 (29 May 2000)

+ +

Minor additions to config.hpp for Borland + compilers. Minor fix to type_traits example. + Minor web site fixes. Library Formal Review + Process page added.

+
+ +
+

1.14.2 (9 May 2000)

+ +

No libraries updated. Library + Requirements and Guidelines expanded, Library Submission Process + added.

+
+ +
+

1.14.1 (17 Mar 2000)

+ +

Minor fix to rational.hpp. Minor + documentation changes to the Smart Pointer Library + and call_traits, + compressed_pair, + and type_traits. Updated Library + Guidelines and People page.

+
+ +
+

1.14.0 (5 Mar 2000)

+ +

Integer + Library status upgraded after removing bin_bun.hpp. + The "Experimental" library category has been removed; the + boost files/vault now serves the purpose. Minor fix to + smart_ptr.hpp line + endings.

+
+ +
+

1.13.0 (29 Feb 2000)

+ +

Adds Utility + Library type_traits, + call_traits, + and compressed_pair + headers from John Maddock, Steve Cleary and Howard + Hinnant.

+
+ +
+

1.12.0 (23 Feb 2000)

+ +

Adds a integer_traits + header from Jens Maurer to the Integer Library.

+
+ +
+

1.11.2 (21 Feb 2000)

+ +

Smart + pointer timings added (thanks to Gavin Collings). + Minor fix to the min_rand sample + program. Minor fixes to config.hpp.

+
+ +
+

1.11.1 (2 Feb 2000)

+ +

Minor fix to cast.hpp + (thanks to Doncho Angelov).

+
+ +
+

1.11.0 (1 Feb 2000)

+ +

Added Rational + Number Library. Minor fixes to cast.hpp, config.hpp, smart_ptr.hpp, utility.hpp, and to the + min_rand sample programs. Minor site + cleanup (thanks to Paul Baxter).

+
+ +
+

1.10.4 (31 Dec 1999)

+ +

Minor fixes to smart_ptr.hpp and cast documentation.

+
+ +
+

1.10.3 (30 Dec 1999)

+ +

Minor fixes to the compose library + examples, operators + documentation, operators.hpp, cast documentation, + cast.hpp, config.hpp, and smart_ptr.hpp. This is the + first release with a version number. The version + numbering scheme is + xxx.yyy.zzz.

+ +
+

xxx = Major version
+ yyy = New library or feature added
+ zzz = Bug fixes only

+
+
+ +
+

14 Dec 1999

+ +

Operators.hpp + documentation + improved.

+
+ +
+

13 Dec 1999

+ +

Added iterator operators and helpers to header operators.hpp, + together with an iterator test program. This header is + maturing into something really useful for building + arithmetic or iterator user-defined types, so look it + over even if you browsed one of the earlier versions.

+
+ +
+

11 Dec 1999

+ +

Added next() and prior() to header utility.hpp.

+
+ +
+

8 Dec 1999

+ +

Minor improvements to the smart pointer library: + operator ==, operator !=, and + specializations for std::swap and + std::less now provided.

+
+ +
+

18 Nov 1999

+ +

Minor improvements made to the Operator + templates.

+
+ +
+

15 Nov 1999

+ +

Operator + templates have been added to the utility library.

+
+ +
+

11 Oct 1999

+ +

Minor smart + pointer library and config.hpp changes to improve + portability.

+
+ +
+

26 Sep 1999

+ +

Minor updates to several libraries:

+ +
    +
  • polymorphic_downcast<> in the + utility + library cast.hpp header + now works for multiple inheritance cases.
    • + +
  • shared_ptr<> and + shared_array<> swap() + functions added in the smart pointer + library.
    • + +
  • timer.hpp + elapsed_max() and + elapsed_min() functions added to the + timer + library.
    • + +
  • + integer + library bin_ubin.hpp changes to eliminate + compiler warning messages. +
    • + +
  • config.hpp minor + changes to aid library developers. No impact on library + users.
    • +
+
+ +
+

3 Sep 1999

+ +

The cast functions in the utility library were + considerably simplified.

+
+ +
+

1 Sep 1999

+ +

The cast functions initially in utility.hpp have been moved to + cast.hpp, still in the + utility + library.

+
+ +
+

1 Sep 1999

+ +

The category "Experimental" has been added to the + library page. The + integer library + is the first entry.

+
+ + +

...And the remainder are lost to the mists of time (for + now, anyway)....

+
+
+
+
+
+ + +
+
+
+ + diff --git a/more/w3c_valid_css.png b/more/w3c_valid_css.png new file mode 100644 index 0000000000..9b2f596e01 Binary files /dev/null and b/more/w3c_valid_css.png differ diff --git a/more/w3c_valid_xhtml10.png b/more/w3c_valid_xhtml10.png new file mode 100644 index 0000000000..2275ee6ea1 Binary files /dev/null and b/more/w3c_valid_xhtml10.png differ diff --git a/more/whos_using/Jamfile.v2 b/more/whos_using/Jamfile.v2 new file mode 100644 index 0000000000..737c8b9d19 --- /dev/null +++ b/more/whos_using/Jamfile.v2 @@ -0,0 +1,20 @@ + +# 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) + +using quickbook ; + +xml using : using.qbk ; +boostbook standalone + : + using + : + nav.layout=none + #navig.graphics=0 + ; + +install html : ../../doc/html/boostbook.css ; +install ../ : ../../boost.png ; + + diff --git a/more/whos_using/using.qbk b/more/whos_using/using.qbk new file mode 100644 index 0000000000..37c2086314 --- /dev/null +++ b/more/whos_using/using.qbk @@ -0,0 +1,966 @@ +[article Who's Using Boost? + [copyright 2005 Various Authors] + [license + 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 + ) + ] + [last-revision $Date$] +] + +[section:intro] + +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 +the thought and experience that has gone into the Boost software libraries. Put simply, +for any given problem for which Boost provides a solution, Boost will strive to provide +the best solution possible. It's up to you to decide whether we've achieved that, but +as these pages will testify, many other developers have found our solutions to be the +best for them. + +['Disclaimer:] Boost's developers try to ensure that the +information on these pages is correct, but from time to time inadvertent +mistakes are bound to occur: +if you would like an entry in these pages to be removed or corrected please contact +the [@mailto:boost-owner@lists.boost.org Boost Moderators]. + +[endsect] + +[section:shrink Shrink Wrapped Boost] + +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 +[@http://www.adobe.com/products/photoshop/main.html Adobe Photoshop CS2] +uses the +[@http://opensource.adobe.com/ Adobe Software Libraries], which in +turn depend upon large parts of Boost. The [@http://opensource.adobe.com/ +Adobe Software Libraries] are being rolled +out across the Adobe product line to provide cross platform user interface logic. +] + +[blurb [*Adobe Indesign]\n\n +[@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. +] + +[blurb [*SAP NetWeaver]\n\n +[@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] +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 +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 +flexible input string parsing facilities, and the +human readable ISO output.\n +[@../../libs/iterator/index.html Iterators]: 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 generation. The codebase benefited +greatly from the clarity boost.preprocessor +brought."] +] + +[blurb [*McAfee, Managed VirusScan 3]\n\n +[@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 +[@http://betavscan.mcafeeasap.com/beta/docs/readme/Readme.html here].] + + +[blurb [*DataSolid GmbH Germany, CADdy++ Mechanical Design (c)]\n\n +[@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 +['"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. +['"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]."] +] + +[blurb [*Synergy, mailIntercept]\n\n +[@http://www.mintercept.com mailIntercept] from [@http://www.synergy.com.br Synergy] +is a mail interceptor service for Exchange Server 2000/2003.\n +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 +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] +] + +[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. +['"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]."] +] + +[blurb [*Kinook Software, Visual Build Professional]\n\n +[@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 +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] +] + +[blurb [*Kinook Software, Ultra Recall]\n\n +[@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 +Used the following Boost libraries: +[@../../libs/format/index.html Format], +[@../../libs/smart_ptr/index.html Shared Pointer], +[@../../libs/static_assert/index.html Static Assert] +] + +[blurb [*Applied Dynamics International, ADvantageDE]\n\n +[@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 +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 +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 +DasCom provides access to real-time simulation data from most Windows +applications, such as Micrsoft Excel, National Instruments Labview, etc.\n\n +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] +] + +[blurb [*PeerGuardian]\n\n +[@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].] + +[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 +['"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 +(together with Serialize) once +they are officially released."] +] + +[blurb [*Wise Riddles Software, Audiomatic]\n\n +[@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 +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]."] +] + +[blurb [*Megahard Software Technologies Inc., Rule in Hell]\n\n +[@http://www.ruleinhell.com Rule in Hell] is a +Massively Multiplayer Online Role Playing Game (still in beta).\n\n +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 +most heavily".] +] + +[blurb [*Dr. Detlef Meyer-Eltz, TextTransformer]\n\n +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 +can be executed or debugged immediately on single source files or on +groups of files. Generated parsers can be exported as c++ code +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 +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 +command line version of the texttransformer."] +] + + +[blurb [*Redshift Software, The Thot Tool]\n\n +[@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]. +] + +[blurb [*Paragent, Paragent Manage 2.1]\n\n +[@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 +['"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 +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 +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 +[@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 +Libraries used: +Smart Pointer, Serialization, Asio, String Algorithms, Bind, Thread, +Conversion/Cast, Iostreams. +] + +[endsect] + +[section:open Open Source Boost] + +Boost is used in a variety of Open Source Projects, both applications and libraries. +Indeed many Open Source libraries developed around Boost have in the past been judged +of high enough quality to be absorbed +into the main Boost source tree, a process that will no doubt continue into the future. +Others are in highly specialized niche markets, ranging from probability theory to +astronomy, via mass spectroscopy: whatever your field of interest you'll find +something of value in Boost. + +[blurb [*Adobe Software Libraries]\n\n +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 +Currently Boost and the Adobe Software Libraries are in use in around 30 Adobe products. +] + +[blurb [*LyX Document Editor]\n\n +[@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].] + +[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++. +Provided with an XML instance specification (XML Schema), it generates +C++ classes that represent the given vocabulary as well as parsing and +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 +to perform transformations on file, type and member names. +[@../../libs/filesystem/index.html Filesystem] 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. +] + +[blurb [*CGAL]\n\n +[@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]."] +] + + +[blurb [*ALPS]\n\n +[@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] +] + +[blurb [*SmartWin++]\n\n +[@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 +[@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 +[@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] +for matrix and numeric computations. +] + +[blurb [*The C++/Tk Library]\n\n +[@http://cpptk.sourceforge.net The C++/Tk Library] is an open source +C++ interface to the Tk GUI Library. +] + +[blurb [*GluCat]\n\n +[@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 +[@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 +[@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 +[@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 +[@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 +using extended attributes. It also allows you to perform fast searches +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 +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 +[@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 +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 +[@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 +[@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 +[@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 +[@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].] + +[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 +[@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].] + +[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 +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 +[@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 +['"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]."] +] + +[blurb [*Monotone]\n\n +[@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 + operation and an efficient peer-to-peer synchronization protocol. It + understands history-sensitive merging, lightweight branches, integrated + 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 +['"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]."] +] + +[blurb [*Hydranode Engine]\n\n +[@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 +['"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 +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 +and kept code clean. Format is being used for all text formatting. +Having Threads and FileSystem libraries available made cross-platform +development lot easier in those areas."] +] + +[blurb [*Hugin]\n\n +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 +[@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 +[@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]] + +[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 +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 +[@http://cpptcl.sourceforge.net/ C++/Tcl] is a library that allows the easy +integration of C++ and Tcl.] + +[blurb [*QuantLib]\n\n +The [@http://quantlib.org/ QuantLib] project provides a comprehensive software +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]. +] + +[blurb [*CBCanaylzer]\n\n +[@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 +['"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] + - creates really nice output, and is both easy to extend and simple to handle. + [@../../libs/iterator/index.html Iterator], + [@../../libs/spirit/index.html 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].] +] + +[blurb [*Profdist]\n\n +[@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 +['"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]."] +] + +[blurb [*The Yake Engine]\n\n +[@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 +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 +[@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 +] + +[endsect] + +[section:inhouse In House Boost] + +Whether you're a government department, an internet startup, or a specialist consultancy, in-house +developement using the Boost Libraries can significantly shorten your +development cycles. + +[blurb [*Google]\n\n +[@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 +unit test framework. +] + +[blurb [*LiquidNet]\n\n +[@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]] +] + +[blurb [*MetOcean Engineers]\n\n +[@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 +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] +] + +[blurb [*TeraView Ltd]\n\n +[@http://www.teraview.com TeraView Ltd] develop terahertz based systems +for a variety of applications +including spectroscopy and imaging.\n\n +['"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]"] +] + +[blurb [*NPC International]\n\n +With about 800 restaurants, [@http://www.npcinternational.com NPC International] +is the world's largest Pizza Hut franchisee.\n\n +['"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]."] +] + +[blurb [*Rational Discovery LLC]\n\n +[@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 +['"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]."] +] + +[blurb [*Archelon LLC]\n\n +[@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 +['"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]."] +] + +[blurb [*Automated Trading Deck] \n\n +[@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 +customers. We offer automated execution solutions in all domestic cash +equity markets, including the listed, over-the-counter, exchange traded +fund and bulletin board marketplaces. Our proprietary "Pricing Engine" +and automated limit-order trading algorithms apply advanced expert +systems to limit-order trading and customer executions. +] + +[endsect] + +[section:submit Submissions] + +If you have an application or library that's using Boost and would like to be +listed here, please post the following information to the +[@http://www.boost.org/more/mailing_lists.htm#main main Boost developer +mailing list]: + +* The name of the Application/Product/Service. +* The name of the company (where appropriate). +* A paragraph describing the Application/Product/Service. +* Any information you can provide about which parts of Boost you used, + along with any comments you may have on how Boost helped your product + development. +* URLs to your companies home page, and the home page of the + Application/Product/Service if there is one. + +Finally, if the subheadings used in the structure of these pages +don't fit your Product/Application/Service please say so: we're +always interested to hear how these pages can be improved or better +structured. + +[endsect] + + + diff --git a/more/writingdoc/design.html b/more/writingdoc/design.html new file mode 100644 index 0000000000..7e95a63ff0 --- /dev/null +++ b/more/writingdoc/design.html @@ -0,0 +1,576 @@ + + + + + + + + + Writing Documentation for Boost - HTML Design + + + + + + + + + +
+

C++ Boost

+ 		+

Writing Documentation for Boost

+ +

HTML Design

+
+
+ +
+
Introduction
+ +
Common Pages Included in HTML + Documentation
+ +
+
+
Index
+ +
Overview
+ +
Definitions
+ +
Rationale
+ +
Configuration Information
+ +
Frequently Asked Questions
+ +
Bibliography
+ +
Acknowledgment
+ +
Header Reference
+
+
+ +
Layout
+ +
+
+
Page Banner
+ +
Page Index
+ +
Documentation Content
+ +
+
+
Footnotes
+
+
+ +
Revision Information
+ +
Copyright Information
+
+
+ +
Format
+ +
+
+
Cascading Style Sheets
+ +
+
+
Boost Style Sheet
+
+
+
+
+ +
Templates
+ +
+
+
Index Page Template
+ +
Overview Page Template
+ +
Definitions Page + Template
+ +
Rationale Page Template
+ +
Configuration Page + Template
+ +
FAQ (Frequently Asked Questions) Page + Template
+ +
Bibliography Page + Template
+ +
Acknowledgments Page + Template
+ +
Header Page Template
+
+
+
+ +

Introduction

+ +

Boost places no requirements on the design of HTML documentation for + library submitters. If you are submitting a library for which documentation + already exists in either HTML or in a form easily converted to HTML then + there is no need for you to read this document. However, if you have not + yet written the documentation, or if you expect to have to translate + documentation written in a format not easily convertible to HTML then this + document can give you a lot of information on how to go about writing + documentation in HTML.

+ +

In several places this document assumes you're writing the documentation + to conform to the structure described in the Documentation Structure document. There is no + requirement that your documentation content follow these guidelines, but + they provide an effective way to communicate technical specifications for a + library in a terse yet precise manner that's familiar to many Boost + users.

+ +

This document also contains links to HTML template + files that can be used to rapidly develop documentation for a library + submission. These templates follow the guidelines presented here and in the + Documentation Structure document.

+ +

Common Pages Included in + HTML Documentation

+ +

Most HTML documentation projects will contain some common pages. General + guidelines for these common pages are provided below.

+ +

Index

+ +

The index page is the first page presented to a user when he browses the + documentation. Generally this page should not contain any actual content, + but instead contains a list of links to specific content. At a minimum this + list should contain a link to every HTML page contained in the + documentation. Optionally, sub-lists may be provided for individual pages + linking to specific subjects within the page. These sub-lists should form a + "tree" hierarchy based on the level of heading tag used for the specific + subject. Inclusion of such sub-lists for every page can make the index + rather lengthy, and since each page should include its own Page Index, it may make the navigation of the + documentation easier if such sub-lists are avoided. However, there is one + exception to this guideline: reference documentation should contain a link + to every header file in the library and a sub-list with a link to every + macro, value, type, class, function and object (see Documentation Structure) found in the header. Users + aren't always sure what header file any of these may be contained in, so + this structure in the index allows for easy navigation of the reference + documentation.

+ +

The index list should generally be constructed using an HTML "definition + list" (<dl> and <dt> tags). A definition list has no bullets or + ordered specifications and produces a cleaner layout then an unordered list + (<ul> and <li> tags) or an ordered list (<ol> and + <li> tags). If you choose to use the common Boost Style Sheet you should add a + class="index" attribute/value pair to the <dl> tag.

+ +

An Index page template is provided for + use.

+ +

Overview

+ +

The Overview page is used to introduce the reader to the library. It + should give a high-level overview of the purpose of the library and + introduce the reader to any concepts they may be unfamiliar with. This may + also be an appropriate place for some "light" rationale, though more + thorough presentation of any rationale would be better placed in the + Rational Page.

+ +

Like most content pages, the Overview page should include a Page Index.

+ +

An Overview page template is provided + for use.

+ +

Definitions

+ +

The Definitions page is used to provide a list of definitions for terms + that a user may be unfamiliar with.

+ +

The definition list should generally be constructed using an HTML + "definition list" (<dl> and <DT> tags). A definition list has + no bullets or ordered specifications and produces a cleaner layout then an + unordered list (<UL> and <li> tags) or an ordered list + (<ol> and <li> tags). If you choose to use the common Boost Style Sheet you should add a + class="definition" attribute/value pair to the <dl> + tag.

+ +

Because this page's content should only contain a list of definitions, + it should not have a Page Index.

+ +

A Definitions page template is + provided for use.

+ +

Rationale

+ +

The Rationale page is used to provide lengthy descriptions of the + rationale behind the library's design. This information helps users to + understand why a library was designed the way it was and may reduce the + frequency of a number of frequently asked questions. For a better + description of why rationale is important see the Rationale rationale + in the general submission guidelines.

+ +

Like most content pages, the Rationale page should include a Page Index.

+ +

A Rationale page template is provided + for use.

+ +

Configuration + Information

+ +

The Configuration Information page is used to document configuration + macros used by the library. Such macros belong in one of three groups: + macros used by library implenters defined in + <boost/config.hpp>, macros used by library users to + detect platform configuration information and macros defined by library + users to configure library behavior.

+ +

Like most content pages, the Overview page should include a Page Index.

+ +

A Configuration page template is + provided for use.

+ +

Frequently Asked Questions

+ +

As a library matures the users will have questions about the usage of + the library. Often users will ask the same questions over and over again. + Rather than having to deal with answering the question every time it's + asked, a Frequently Asked Questions (commonly known as FAQs) page can be + used to document the questions and answers. This is such a valuable piece + of documentation not only for the users but for the maintainers as well, + that a FAQ page should be provided from the outset. If there are no + questions that will obviously become a FAQ, the initial page may just + indicate that there are no FAQs yet. This empty place holder helps to + indicate to the users that you plan to address any FAQs as they occur.

+ +

The Page Index for the FAQ page should contain + a list of all the questions contained in the document. The actual question + entries should be formatted with the question in a heading tag and the + answers in standard paragraph format. This provides a clean presentation + that's easy to read.

+ +

A Frequently Asked Questions page template + is provided for use.

+ +

Bibliography

+ +

The Bibliography page is used to document any bibliographical + information associated with references made within the documentation to + external resources. Parenthetical references are used within the + documentation which link to entries in the Bibliography page. + Bibliographical entries provide detailed information about the external + resource and may contain hyper links to the resource if it's available + online. There are several formal styles used for writing bibliographies. + You may use what ever style you want, but one of the better styles to + consider using can be referenced here.

+ +

Since the Bibliography page should contain only bibliographical + information there is no need for a Page + Index.

+ +

A Bibliography page template is + provided for use.

+ +

Acknowledgment

+ +

The Acknowledgment page is used to give credit where credit is due. When + individuals provide input on the design or implementation, or when you make + use of someone else's work, you should acknowledge them. This is a courtesy + that you'd expect others to extend to you, so you should strive to + acknowledge the efforts of everyone else in your own documentation.

+ +

Since the Acknowledgment page should contain only a list of + acknowledgment there is no need for a Page + Index.

+ +

An Acknowledgments page template is provided for use.

+ +

Header Reference

+ +

The Header Reference pages are the most important pages in your + documentation. They document all library headers, including all the macros, + values, types, classes, functions and objects defined in them. In general + it may prove useful to follow the guidelines in Documentation Structure when writing the content for + these pages.

+ +

Like most content pages, the Header Reference pages should include a + Page Index.

+ +

A Header Reference page template is + provided for use.

+ +

Layout

+ +

There are certain page layout concepts that will be used frequently in + many of your pages. This section outlines some general guidelines that you + can follow when designing each of these layout concepts for your + documentation.

+ +

Page Banner

+ +

The Page Banner is located at the very top of a page and provides quick + information about the page contents. This includes the Boost logo, which + indicates to the reader that this page is part of the Boost web site, a + title for the documentation (generally the library name) and the page + title. The Boost logo should hyper link to the Boost home page on the index + page and to the index page on all other pages. This allows the user to + easily navigate through the Boost web site and through the documentation. + The <title> tag for the HTML page should consist of the documentation + title and the page title separated by a hyphen.

+ +

The Page Banner should be separated from the rest of the page by the use + of an <hr> tag. This helps to clearly separate the actual content + from the title information and produces cleaner text.

+ +

Page Index

+ +

The page index is used to quickly navigate to the various sections of + the documentation on the page, and when present should be located just + below the Page Banner.

+ +

The index list should generally be constructed using an HTML "definition + list" (<dl> and <DT> tags). A definition list has no bullets or + ordered specifications and produces a cleaner layout then an unordered list + (<UL> and <li> tags) or an ordered list (<ol> and + <li> tags). If you choose to use the Boost Style Sheet you should add + a class="page-index" attribute/value pair to the <dl> + tag.

+ +

Most pages should include a Page Index.

+ +

Documentation Content

+ +

The page's actual documentation content will be formatted according to + the specific needs of individual pages, and should be placed right after + the Page Index if present, or after the Page Banner if not. In general the + documentation content will take the form of paragraph text contained + underneath section headings.

+ +

Footnotes

+ +

Footnotes may be used within a page's documentation. Within the + documentation content a footnote reference should take the form of a + footnote number in parentheses (the parentheses make it easier for the + reader to click on the hyper link) hyper linking to the actual footnote at + the bottom of the page's documentation content. You may either use the + <sup> tag to format such footnote numbers, or, preferably, you can + use a CSS style class in order to distinguish the number as a footnote + instead of as part of the actual text. If you choose to use the common + Boost Style Sheet, a footnote + class is defined for this purpose.

+ +

Revision + Information

+ +

At the bottom of every page should be some revision information + indicating when the page was last revised. This information should be + separated from the rest of the page above by an <hr> tag. The + following HTML code snippet can be used to track this revision information + (this code uses some server components that exist on the Boost web site to + automatically track revision dates with out the need for hand editing the + date text):

+ 
+<hr>
+<p>Revised
+  <!--webbot bot="Timestamp" S-Type="EDITED" S-Format="%d %B, %Y" startspan -->
+  01 January, 2001
+  <!--webbot bot="Timestamp" endspan i-checksum="39359" -->
+</p>
+
+ +

Copyright Information

+ +

The very bottom of the page should contain any copyright information + that applies to the document.

+ +

Format

+ +

This section provides general guidelines for formatting documentation + using HTML. The description of the various "common pages" gave specific + details for formatting specific sections of the documentation, which should + override these guidelines.

+ +

Code

+ +

Code within the documentation should be placed within either + <code></code> or <pre></pre> tags. For code that's + placed inline with other text you use <code></code> tags, while + <pre></pre> tags are used for code "blocks". If a cascading + style sheet is used to specify formatting for these tags, a fixed width + sans serif font should be used. This insures that the code is easily + distinguishable from the rest of the text. It may also be beneficial to set + the style for <pre></pre> tags to indent the text, to help + separate code blocks from other structural HTML blocks. The Boost Style Sheet specifies formatting for these + tags.

+ +

Note: "Code" includes variable names, function names, etc.

+ +

Lists

+ +

Lists should be constructed as unordered (<UL> and <li> + tags), ordered (<ol> and <li> tags) or definition (<dl> + and <DT> tags) lists in HTML. You use an unordered list when you need + a collection of items that don't have any kind of logical ordering, such as + a list of data types that are defined by the library and can be used for a + template argument. You use an ordered list when the collection of items + must be grouped in a logical ordering, such as when enumerating the steps + that an action logically performs. You use a definition list when the list + consists of not only items that have no logical ordering, but also contains + definitions/descriptions/etc. of the items. A good example of this is the + function specifications as described in Documentation Structure.

+ +

Graphics

+ +

Graphics should be used very sparingly, if at all. Graphic images + greatly effect the download time for many people, which can discourage + users from reading the documentation. If you need graphic images to help + illustrate something in your documentation consider supplying only a link + to the image within the documentation, instead of embedding it directly in + the text. If an image is going to be included in the text of the document + you should specify the image's size in the <img> tag, in order to + allow the user's browser to optimize the formatting of the text before the + image is loaded.

+ +

Non-breaking + Spaces

+ +

Non-breaking spaces (&nbsp;) should be avoided in HTML text. + Generally there are more appropriate ways to format the document, such as + using list constructs or specifying indentation as a style attribute or in + cascading style sheets.

+ +

Cascading Style + Sheets

+ +

Cascading style sheets allow you to apply some advanced formatting + styles to an HTML document. More importantly, they allow you to change the + formatting in a single file and effect all pages using the style sheet. + Instead of struggling to produce a specific format in HTML it's often + easier and more flexible to specify the formatting in a style sheet.

+ +

Boost Style + Sheet

+ +

The concept of using cascading style sheets to format HTML is such a + good idea that it can be beneficial to apply this across the entire Boost + site. Of course we can't require this (if Boost were to require such trivia + for submissions it's likely that many programmers would be discouraged from + contributing). However, a "standard" Boost style sheet + (http://www.boost.org/boost.css) is supplied anyway, so that a contributer + can quickly and easily produce clear and consistent documentation that + reflects a Boost "brand" if they so choose. If, at a later date, it's + decided to update the Boost "brand", it may be done in this single file and + all documents using the style sheet will automatically be updated.

+ +

The Boost supplied style sheet not only specifies styles for many + standard tags, it also specifies several style "classes". A class is + specified for a given tag instead of being applied to all instances of a + given tag type. Below is a list of the classes specified in the Boost style + sheet and a description of when to use them:

+ +
+
index Used for <dl> tags when writing index lists.
+ +
page-index Used for <dl> tags when writing page index + lists.
+ +
Footnote Used when writing Footnote numbers.
+ +
function-semantics Used for <dl> tags when writing + function semantic lists.
+
+ +

Templates

+ +

Instead of hand coding every HTML page, HTML "templates" can be used + instead. The list below provides links to templates that may be used when + writing documentation for a contribution to Boost. Links provided in these + templates assume the files will reside in the "traditional" directory + hierarchy of boost/libs/library/doc. They may need correcting if the + file will reside in some other location.

+ +

Note: Since these "templates" are just HTML pages simply clicking + on the links below will load the template in your browser. You will need to + use a browser specific method to download the files instead of loading them + into the browser (for instance, on most Windows browsers you can right + click on the link and select the appropriate command from the context + sensitive menu).

+ + +
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2001 William E. Kempf

+ +

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/more/writingdoc/index.html b/more/writingdoc/index.html new file mode 100644 index 0000000000..869c590411 --- /dev/null +++ b/more/writingdoc/index.html @@ -0,0 +1,57 @@ + + + + + + + + + Writing Documentation for Boost + + + + + + + + + +
+

+

+ 		+

Writing Documentation for Boost

+ +

Index

+
+
+ +

Contents

+ +
+
Introduction
+ +
Documentation Structure
+ +
HTML Design
+
+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2001 William E. Kempf

+ +

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/more/writingdoc/introduction.html b/more/writingdoc/introduction.html new file mode 100644 index 0000000000..29f737bcb6 --- /dev/null +++ b/more/writingdoc/introduction.html @@ -0,0 +1,68 @@ + + + + + + + + + Writing Documentation for Boost - Introduction + + + + + + + + + +
+

C++ Boost

+ 		+

Writing Documentation for Boost

+ +

Introduction

+
+
+ +

Boost does not have any requirements on how you write your + documentation. If you are submitting a library that already has written + documentation in HTML format, there is no reason to change it to follow any + of the guidelines presented here. However, if you have documentation that's + not in HTML format and can't be easily converted to HTML, or if you're + starting on a library from scratch or have a library with no documentation + then these guidelines can make writing the documentation much easier.

+ +

The section on Documentation Structure + describes how to go about structuring the documentation's content. This + section may be helpful even for libraries that already have documentation. + If there's a desire to present the library for possible inclusion by the + C++ Standards Committee then there may be a need to restructure the + documentation's content in order to insure the content meets explicit + requirements for library components (Section 17.3).

+ +

The section on HTML Design gives general rules + to follow when writing HTML documentation in order to give a professional + and consistent look. This section also contains some template files that + can be used to rapidly create documentation pages.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2001 William E. Kempf

+ +

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/more/writingdoc/structure.html b/more/writingdoc/structure.html new file mode 100644 index 0000000000..d3783fcc9d --- /dev/null +++ b/more/writingdoc/structure.html @@ -0,0 +1,433 @@ + + + + + + + + + Writing Documentation for Boost - Documentation Structure + + + + + + + + + +
+

C++ Boost

+ 		+

Writing Documentation for Boost

+ +

Documentation Structure

+
+
+ +
+
Introduction
+ +
Standards Conforming + Documentation
+ +
+
+
Document elements
+ +
+
+
Summary
+ +
Requirements
+ +
Detailed specifications
+ +
References to the Standard C++ + library
+ +
References to the Standard C + library
+
+
+ +
Other conventions
+ +
+
+
Type descriptions
+
+
+
+
+ +
More Information
+ +
+
+
Function semantic + element explanations
+ +
+
+
Requires
+ +
Effects
+ +
Postconditions
+ +
Returns
+ +
Throws
+ +
Complexity
+ +
Rationale
+
+
+
+
+ +
Footnotes
+
+ +

Introduction

+ +

Boost itself does not require any specific documentation structure. The + C++ Standard, however, has very explicit requirements for the description + of library components (Section 17.3). So for Boost libraries likely to be + proposed for inclusion in the standard, it is highly desirable to structure + documentation in a way that meets the requirements of the the standard. + Doing so eliminates the need to rewrite the documentation for + standardization.

+ +

Library developers should remember that for a library to be accepted as + part of the C++ Standard Library, the proposal must include full wording. + The committee will not do that work for you.

+ +

Beyond that, the documentation structure required for the standard is an + effective way to communicate the technical specifications for a library. + Although terse, it is already familiar to many Boost users, and is far more + precise than most ad hoc documentation structures.

+ +

The following description is for the structure of documentation required + by the standard. Boost libraries should also provided additional + documentation, such as introductory, tutorial, example, and rationale + material.

+ +

Standards + Conforming Documentation

+ +

Document elements

+ +

Each document contains the following elements, as applicable(1):

+ + + +

Summary

+ +

The Summary provides a synopsis of the category, and introduces the + first-level subclauses. Each subclause also provides a summary, listing the + headers specified in the subclause and the library entities provided in + each header.

+ +

Paragraphs labeled "Note(s):" or "Example(s):" are informative, other + paragraphs are normative.

+ +

The summary and the detailed specifications are presented in the + order:

+ +
    +
  • Macros
    • + +
  • Values
    • + +
  • Types
    • + +
  • Classes
    • + +
  • Functions
    • + +
  • Objects
    • +
+ +

Requirements

+ +

The library can be extended by a C++ program. Each clause, as + applicable, describes the requirements that such extensions must meet. Such + extensions are generally one of the following:

+ +
    +
  • Template arguments
    • + +
  • Derived classes
    • + +
  • Containers, iterators, and/or algorithms that meet an interface + convention
    • +
+ +

Interface convention requirements are stated as generally as possible. + Instead of stating "class X has to define a member function + operator++()," the interface requires "for any object + x of class X, ++x is defined." That + is, whether the operator is a member is unspecified.

+ +

Requirements are stated in terms of well-defined expressions, which + define valid terms of the types that satisfy the requirements. For every + set of requirements there is a table that specifies an initial set of the + valid expressions and their semantics. Any generic algorithm that uses the + requirements is described in terms of the valid expressions for its formal + type parameters.

+ +

Template argument requirements are sometimes referenced by name.

+ +

In some cases the semantic requirements are presented as C++ code. Such + code is intended as a specification of equivalance of a construct to + another construct, not necessarily as the way the construct must be + implemented.(2)

+ +

Detailed + specification

+ +

The detailed specifications each contain the following elements:

+ +
    +
  • Name and brief description
    • + +
  • Synopsis (class definition or function prototype, as + appropriate)
    • + +
  • Restrictions on template arguments, if any
    • + +
  • Description of class invariants
    • + +
  • Description of function semantics
    • +
+ +

Descriptions of class member functions follow the order (as + appropriate)(3):

+ +
    +
  • Constructor(s) and destructor
    • + +
  • Copying and assignment functions
    • + +
  • Comparison functions
    • + +
  • Modifier functions
    • + +
  • Observer functions
    • + +
  • Operators and other non-member functions
    • +
+ +

Descriptions of function semantics contain the following elements (as + appropriate)(4):

+ +
+
Requires: the preconditions for + calling the function
+ +
Effects: the actions performed by the + function
+ +
Postconditions: the observable + results established by the function
+ +
Returns: a description of the value(s) + returned by the function
+ +
Throws: any exceptions thrown by the + function, and the conditions that would cause the exception
+ +
Complexity: the time and/or space + complexity of the function
+ +
Rationale: the rationale for the + function's design or existence
+
+ +

Complexity requirements specified in the library clauses are upper + bounds, and implementations that provide better complexity guarantees + satisfy the requirements.

+ +

References to the C++ Standard + library

+ +

References to the C Standard + library

+ +

Other conventions

+ +

These conventions are for describing implementation-defined types, and + member functions.

+ +

Type descriptions

+ +

The Requirements subclauses may describe names that are used to specify + constraints on template arguments.

+ +

More Information

+ +

Function semantic element + explanations

+ +

The function semantic element description above is taken directly from the C++ standard, and + is quite terse. Here is a more detailed explanation of each of the + elements.

+ +

Note the use of the <code> ... </code> font tag + to distinguish actual C++ usage from English prose.

+ +

Requires

+ +

Preconditions for calling the function, typically expressed as + predicates. The most common preconditions are requirements on the value of + arguments, often in the form of C++ expressions. For example,

+ 
+ 
+void limit( int * p, int min, int max );
+
+ +
+
Requires: p != 0 && min <= max
+
+ +

Requirements already enforced by the C++ language rules (such as the + type of arguments) are not repeated in Requires paragraphs.

+ +

Effects

+ +

The actions performed by the function, described either in prose or in + C++. A description in prose is often less limiting on implementors, but is + often less precise than C++ code.

+ +

If an effect is specified in one of the other elements, particularly + postconditions, returns, or throws, it is not also + described in the effects paragraph. Having only a single description + ensures that there is one and only one specification, and thus eliminates + the risk of divergence.

+ +

Postconditions

+ +

The observable results of the function, such as the value of variables. + Postconditions are often expressed as predicates that are true after the + function completes, in the form of C++ expressions. For example:

+ 
+ 
+void make_zero_if_negative( int & x );
+
+ +
+
Postcondition: x >= 0
+
+ +

Returns

+ +

The value returned by the function, usually in the form of a C++ + expression. For example:

+ 
+int sum( int x, int y );
+
+ +
+
Returns: x + y
+
+ +

Only specify the return value; the type is already dictated by C++ + language rules.

+ +

Throws

+ +

Specify both the type of exception thrown, and the condition that causes + the exception to be thrown. For example, the std::basic_string + class specifies:

+ 
+ 
+void resize(size_type n, charT c);
+
+ +
+
Throws: length_error if n > + max_size().
+
+ +

Complexity

+ +

Specifying the time and/or space complexity of a function is often not + desirable because it over-constrains implementors and is hard to specify + correctly. Complexity is thus often best left as a quality of + implementation issue.

+ +

A library component, however, can become effectively non-portable if + there is wide variation in performance between conforming implementations. + Containers are a prime example. In these cases it becomes worthwhile to + specify complexity.

+ +

Complexity is often specified in generalized "Big-O" + notation.

+ +

Rationale

+ +

Specifying the rationale for a function's design or existence can often + give users a lot of insight into why a library is designed the way it is. + More importantly, it can help prevent "fixing" something that wasn't really + broken as the library matures.

+ +

Footnotes

+ +
+
(1) To save + space, items that do not apply to a clause are omitted. For example, if a + clause does not specify any requirements, there will be no "Requirements" + subclause.
+ +
(2) Although + in some cases the code is unambiguously the optimum implementation.
+ +
(3) To save + space, items that do not apply to a class are omitted. For example, if a + class does not specify any comparison functions, there will be no + "Comparison functions" subclause.
+ +
(4) To save + space, items that do not apply to a function are omitted. For example, if + a function does not specify any precondition, there will be no "Requires" + paragraph.
+
+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2001 William E. Kempf

+ +

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/more/writingdoc/template/acknowledgments.html b/more/writingdoc/template/acknowledgments.html new file mode 100644 index 0000000000..bfb9e5d28d --- /dev/null +++ b/more/writingdoc/template/acknowledgments.html @@ -0,0 +1,48 @@ + + + + + + + + + {{Library}} - Acknowledgments + + + + + + + + + +
+

+

+ 		+

{{Library}}

+ +

Acknowledgments

+
+
+ {{text}} +
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2006 {{author}}

+ +

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/more/writingdoc/template/bibliography.html b/more/writingdoc/template/bibliography.html new file mode 100644 index 0000000000..c824b07bbf --- /dev/null +++ b/more/writingdoc/template/bibliography.html @@ -0,0 +1,48 @@ + + + + + + + + + {{Library}} - Bibliography + + + + + + + + + +
+

+

+ 		+

{{Library}}

+ +

Bibliography

+
+
+ {{bibliographical information}} +
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2006 {{author}}

+ +

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/more/writingdoc/template/configuration.html b/more/writingdoc/template/configuration.html new file mode 100644 index 0000000000..6eaebf015e --- /dev/null +++ b/more/writingdoc/template/configuration.html @@ -0,0 +1,145 @@ + + + + + + + + + {{Library}} - Configuration + + + + + + + + + +
+

+

+ 		+

{{Library}}

+ +

Configuration

+
+
+ +
+
Introduction
+ +
Application Defined Macros
+ +
Public Library Defined Macros
+ +
Library Defined Implementation + Macros
+
+ +

Introduction

+ +

{{library}} uses several configuration macros in <boost/config.hpp>, + as well as configuration macros meant to be supplied by the application. + These macros are documented here.

+ +

Application Defined + Macros

+ +

These are the macros that may be defined by an application using + {{library}}.

+ + + + + + + + + + + + + + + + + + + +
MacroMeaning
{{macro}}{{meaning}}
{{macro}}{{meaning}}
+ +

Public Library + Defined Macros

+ +

These macros are defined by {{library}} but are expected to be used by + application code.

+ + + + + + + + + + + + + + + + + + + +
MacroMeaning
{{macro}}{{meaning}}
{{macro}}{{meaning}}
+ +

Library Defined + Implementation Macros

+ +

These macros are defined by {{library}} and are implementation details + of interest only to implementers.

+ + + + + + + + + + + + + + + + + + + +
MacroMeaning
{{macro}}{{meaning}}
{{macro}}{{meaning}}
+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2006 {{author}}

+ +

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/more/writingdoc/template/definitions.html b/more/writingdoc/template/definitions.html new file mode 100644 index 0000000000..25b22d580f --- /dev/null +++ b/more/writingdoc/template/definitions.html @@ -0,0 +1,78 @@ + + + + + + + + + {{Library}} - Definitions + + + + + + + + + +
+

+

+ 		+

{{Library}}

+ +

Definitions

+
+
+ +

Contents

+ +
+
Introduction
+ +
Definitions
+ +
+
+
Term 1
+ +
Term 2
+
+
+
+
+ +

Introduction

+ +

{{Introductory text}}

+ +

Definitions

+ +
+
{{term}}: + {{definition}}
+ +
{{term}}: + {{definition}}
+
+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2006 {{author}}

+ +

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/more/writingdoc/template/faq.html b/more/writingdoc/template/faq.html new file mode 100644 index 0000000000..3133faea01 --- /dev/null +++ b/more/writingdoc/template/faq.html @@ -0,0 +1,61 @@ + + + + + + + + + {{Library}} - FAQ + + + + + + + + + +
+

+

+ 		+

{{Library}}

+ +

Frequently Asked Questions (FAQs)

+
+
+ +
+
{{question}}
+ +
{{question}}
+
+ +

{{question}}

+ +

{{answer}}

+ +

{{question}}

+ +

{{answer}}

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2006 {{author}}

+ +

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/more/writingdoc/template/header.html b/more/writingdoc/template/header.html new file mode 100644 index 0000000000..e16500de65 --- /dev/null +++ b/more/writingdoc/template/header.html @@ -0,0 +1,346 @@ + + + + + + + + + {{library}} - Header <{{header}}> + + + + + + + + + +
+

+

+ 		+

{{library}}

+ +

Header <{{header}}>

+
+
+ +

Contents

+ +
+
Introduction
+ +
Macros
+ +
+
+
{{macro name}}
+
+
+ +
Values
+ +
+
+
{{value name}}
+
+
+ +
Types
+ +
+
+
{{type name}}
+
+
+ +
Classes
+ +
+
+
Class {{class name}}
+ +
+
+
Class {{class + name}} synopsis
+ +
Class {{class name}} + constructors and destructor
+ +
Class {{class + name}} comparison functions
+ +
Class {{class + name}} modifier functions
+ +
Class {{class + name}} observer functions
+ +
Class {{class + name}} static functions
+
+
+
+
+ +
Functions
+ +
+
+
{{function name}}
+
+
+ +
Objects
+ +
+
+
{{object name}}
+
+
+ +
Example(s)
+
+
+ +

Introduction

+ +

{{Introductory text}}

+ +

Macros

+ +

{{Macro specifications}}

+ +

Values

+ +

{{Value specifications}}

+ +

Types

+ +

{{Type specifications}}

+ +

Classes

+ +

Class {{class + name}}

+ +

{{class overview text}}

+ +

Class + {{class name}} synopsis

+ 
+namespace boost
+{
+    class {{class name}}
+        {
+        };
+};
+
+ +

Class + {{class name}} constructors and destructor

+ 
+{{constructor}}
+
+ +
+
Requires: {{text}}
+ +
Effects: {{text}}
+ +
Postconditions: {{text}}
+ +
Returns: {{text}}
+ +
Throws: {{text}}
+ +
Complexity: {{text}}
+ +
Note: {{text}}
+ +
Danger: {{text}}
+ +
Rationale: {{text}}
+
+ 
+{{destructor}}
+
+ +
+
Requires: {{text}}
+ +
Effects: {{text}}
+ +
Postconditions: {{text}}
+ +
Returns: {{text}}
+ +
Throws: {{text}}
+ +
Complexity: {{text}}
+ +
Note: {{text}}
+ +
Danger: {{text}}
+ +
Rationale: {{text}}
+
+ +

Class + {{class name}} comparison functions

+ 
+{{function}}
+
+ +
+
Requires: {{text}}
+ +
Effects: {{text}}
+ +
Postconditions: {{text}}
+ +
Returns: {{text}}
+ +
Throws: {{text}}
+ +
Complexity: {{text}}
+ +
Note: {{text}}
+ +
Danger: {{text}}
+ +
Rationale: {{text}}
+
+ +

Class + {{class name}} modifier functions

+ 
+{{function}}
+
+ +
+
Requires: {{text}}
+ +
Effects: {{text}}
+ +
Postconditions: {{text}}
+ +
Returns: {{text}}
+ +
Throws: {{text}}
+ +
Complexity: {{text}}
+ +
Note: {{text}}
+ +
Danger: {{text}}
+ +
Rationale: {{text}}
+
+ +

Class + {{class name}} observer functions

+ 
+{{function}}
+
+ +
+
Requires: {{text}}
+ +
Effects: {{text}}
+ +
Postconditions: {{text}}
+ +
Returns: {{text}}
+ +
Throws: {{text}}
+ +
Complexity: {{text}}
+ +
Note: {{text}}
+ +
Danger: {{text}}
+ +
Rationale: {{text}}
+
+ +

Class + {{class name}} static functions

+ 
+{{function}}
+
+ +
+
Requires: {{text}}
+ +
Effects: {{text}}
+ +
Postconditions: {{text}}
+ +
Returns: {{text}}
+ +
Throws: {{text}}
+ +
Complexity: {{text}}
+ +
Note: {{text}}
+ +
Danger: {{text}}
+ +
Rationale: {{text}}
+
+ +

Functions

+ 
+{{function}}
+
+ +
+
Requires: {{text}}
+ +
Effects: {{text}}
+ +
Postconditions: {{text}}
+ +
Returns: {{text}}
+ +
Throws: {{text}}
+ +
Complexity: {{text}}
+ +
Note: {{text}}
+ +
Danger: {{text}}
+ +
Rationale: {{text}}
+
+ +

Objects

+ +

{{Object specifications}}

+ +

Example(s)

+ +

{{Example(s)}}

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2006 {{author}}

+ +

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/more/writingdoc/template/index.html b/more/writingdoc/template/index.html new file mode 100644 index 0000000000..e360ab3195 --- /dev/null +++ b/more/writingdoc/template/index.html @@ -0,0 +1,126 @@ + + + + + + + + + {{Library}} + + + + + + + + + +
+

+

+ 		+

{{Library}}

+ +

Index

+
+
+ +

Contents

+ +
+
Overview
+ +
Reference
+ +
+
+
{{header}}
+ +
+
+
Macros
+ +
+
+
{{macro name}}
+
+
+ +
Values
+ +
+
+
{{value name}}
+
+
+ +
Types
+ +
+
+
{{type name}}
+
+
+ +
Classes
+ +
+
+
{{class name}}
+
+
+ +
Functions
+ +
+
+
{{function + name}}
+
+
+ +
Objects
+ +
+
+
{{object name}}
+
+
+
+
+
+
+ +
Configuration Information
+ +
Rationale
+ +
Definitions
+ +
Frequently Asked Questions (FAQs)
+ +
Bibliography
+ +
Acknowledgments
+
+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2006 {{author}}

+ +

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/more/writingdoc/template/overview.html b/more/writingdoc/template/overview.html new file mode 100644 index 0000000000..c931bc5838 --- /dev/null +++ b/more/writingdoc/template/overview.html @@ -0,0 +1,79 @@ + + + + + + + + + {{Library}} - Overview + + + + + + + + + +
+

+

+ 		+

{{Library}}

+ +

Overview

+
+
+ +
+
Introduction
+ +
First topic
+ +
Second topic
+ +
Footnotes
+
+ +

Introduction

+ +

{{text}}

+ +

First Topic

+ +

{{text}}

+ +

Second Topic

+ +

{{text}}

+ +

Footnotes

+ +
+
(1) + {{text}}
+ +
(2) + {{text}}
+
+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2006 {{author}}

+ +

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/more/writingdoc/template/rationale.html b/more/writingdoc/template/rationale.html new file mode 100644 index 0000000000..bb450a092d --- /dev/null +++ b/more/writingdoc/template/rationale.html @@ -0,0 +1,79 @@ + + + + + + + + + {{Library}} - Rationale + + + + + + + + + +
+

+

+ 		+

{{Library}}

+ +

Rationale

+
+
+ +
+
Introduction
+ +
First topic
+ +
Second topic
+ +
Footnotes
+
+ +

Introduction

+ +

{{text}}

+ +

First Topic

+ +

{{text}}

+ +

Second Topic

+ +

{{text}}

+ +

Footnotes

+ +
+
(1) + {{text}}
+ +
(2) + {{text}}
+
+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 04 + December, 2006

+ +

Copyright © 2006 {{author}}

+ +

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/people/aleksey_gurtovoy.htm b/people/aleksey_gurtovoy.htm new file mode 100644 index 0000000000..9767b3c909 --- /dev/null +++ b/people/aleksey_gurtovoy.htm @@ -0,0 +1,87 @@ + + + + + + + + + + Aleksey Gurtovoy + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+

+ +

Aleksey Gurtovoy is a Russian guy from Siberia, who now lives and works + in the United States. He is a technical lead at MetaCommunications, a job and people which + have taught him so much.

+ +

He was born in early 1977, has been in love with computers since 1989, + and still has a lot of exciting ideas for his "spare time" in the next few + years. He graduated with honors from Krasnoyarsk Technical State University + in 1998 with a Master Degree in Computer Science.

+ +

While being acknowledged as a talented programmer, Aleksey tries to be a + better engineer than he is now and hopes that reading good books will help + him with that task. He reads a lot. One of his favorite books about his + profession is 'The Mythical Man-Month' by Frederic P. Brooks, Jr.

+ +

Aleksey has been working with C++ since 1993, he loves the language, and + is involved in its progress. Sometimes you can come across his articles in + the comp.lang.c++.moderated and + comp.std.c++ newsgroups. The other + numerous things Aleksey is interested in include patterns, programming + languages, organization of software development process, and tools & + technologies which make programmer's life easier (e.g. compilers).

+ +

He is not married, but he has in mind one great girl he hopes to be with + someday.

+ +

You can contact him by sending mail to alexy@meta-comm.com.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2004 Aleksey Gurtovoy

+ +

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/people/andreas_huber.html b/people/andreas_huber.html new file mode 100644 index 0000000000..8856aaad9a --- /dev/null +++ b/people/andreas_huber.html @@ -0,0 +1,72 @@ + + + + + + + + + + Andreas Huber + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

http://boost.sourceforge.net/photos/andreas_huber.jpg

+ +

Andreas Huber is a software architect at + Phonak Hearing Systems, where he is responsible for the development and + maintenance of operations software. At former companies Andreas has + been developing systems ranging from PC control software for machinery to + custom-made CRM applications. In recent years, more and more of his + professional work has shifted to the .NET platform (C# and C++/CLI).

+ +

In his spare time Andreas still enjoys to program in standard C++, which + is how Boost.Statechart came + into being. His other hobbies include swimming, camping, hiking and + traveling.

+ +

Andreas lives in Zurich, Switzerland with his wife Ruth.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 09 April, 2007

+ +

Copyright © 2006-2007 + Andreas Huber Dönni

+ +

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/people/beman_dawes.html b/people/beman_dawes.html new file mode 100644 index 0000000000..e9fe3051e8 --- /dev/null +++ b/people/beman_dawes.html @@ -0,0 +1,76 @@ + + + + + + + + + + Beman Dawes + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+ Beman + Dawes is a software developer from Virginia in the United States and the + founder of boost.org.

+ +

He is the author of the StreetQuick® geographic atlas library used + by digital map publishers to help people get really, really, lost.

+ +

He wrote his first computer program 40 years ago, and does not mourn the + passing of bi-quinary + arithmetic.

+ +

Beman has been a voting member of the ANSI/ISO C++ Standards Committee + since 1992, and chaired the Library Working Group for five years.

+ +

He enjoys travel, sailing, hiking, and biking. He is married, and he and + his wife have three cats.

+ +

Email: bdawes@acm.org

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2004 Beman Dawes

+ +

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/people/darin_adler.htm b/people/darin_adler.htm new file mode 100644 index 0000000000..b2a71d8349 --- /dev/null +++ b/people/darin_adler.htm @@ -0,0 +1,94 @@ + + + + + + + + + + Darin Adler + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Darin Adler has + been programming computers since 1976. He loves to do it.

+ +

His first major professional experience was at Apple Computer. In 1988 he led the team that rewrote + the Macintosh Finder in C++. Before that project was completed, he was + shanghaied to be the technical lead for the System 7 project (these days + they would call it "Mac OS 7"). The group he formed to help him do that, + the Blue Meanies, is still a legend + in the Apple community.

+ +

Since Apple, Darin has worked at General Magic as an architect of the + Magic Cap OS, used + the moniker Bent Spoon Software to do + consulting, and helped start Eazel, a company that worked to make Linux + easier to use and developed the Nautilus graphical shell for GNOME. Since 1997, he has worked from his home + in Los Angeles, CA, collaborating with clients and coworkers in other + locations.

+ +

He prefers to use and program Macintosh computers with C++. But work on + the GNOME project is best accomplished with a non-Macintosh PC. (That's why + Darin is sitting in front of two computers.) + The other people working on the GNOME project don't like C++, so he's + writing a lot of C code these days.

+ +

The larger + version of his picture shows him hard at work with his C++ guru, his + daughter Sophia.

+ +

He has hobbies and stuff but you don't want to read about that here.

+ +

You can contact him by sending mail to darin@bentspoon.com.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 24 + December, 2006

+ +

Copyright © 2001 Darin Adler

+ +

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/people/daryle_walker.html b/people/daryle_walker.html new file mode 100644 index 0000000000..a38c643de9 --- /dev/null +++ b/people/daryle_walker.html @@ -0,0 +1,56 @@ + + + + + + + + Daryle Walker + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

http://boost.sourceforge.net/photos/daryle_walker.jpg (3618 bytes) Daryle Walker, born and raised in the United States since 1973, + needs to write a fuller biography.


+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 November, 2006

+ +

Copyright © 2001 Daryle Walker

+ +

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/people/dave_abrahams.htm b/people/dave_abrahams.htm new file mode 100644 index 0000000000..7f7fa04d39 --- /dev/null +++ b/people/dave_abrahams.htm @@ -0,0 +1,37 @@ + + + + + + Dave Abrahams + + + + + + + + + + + + + + +
boost.png + (6897 bytes)HomeLibrariesPeopleFAQMore
+

+ dave_abrahams.jpg (30926 bytes) + Dave Abrahams is a founding + member and moderator of Boost, and an active member of the wider open-source + community. He has been an ANSI/ISO C++ committee member since 1996, and has + worked in the software industry since 1988. In 2001 He founded + Boost Consulting + , a company dedicated to providing professional support and development + services for the Boost C++ libraries and associated tools. +

+ Dave often shows up at C++ standards committee meetings on a bicycle. He lives + in Somerville, Massachusetts with his beautiful wife, Luann.

+ + diff --git a/people/dietmar_kuehl.htm b/people/dietmar_kuehl.htm new file mode 100644 index 0000000000..041883f8a3 --- /dev/null +++ b/people/dietmar_kuehl.htm @@ -0,0 +1,81 @@ + + + + + + + + + + Dietmar Kuehl + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

dietmar_kuehl.jpg (57821 bytes)Dietmar Kuehl (the "ue" is + actually a "u-umlaut", ie. one of those funny German characters which has + two dots above it) was fork(2)ed in early 1968.

+ +

He visited school more or less successfully from 1973 to 1987. In 1987 + he started to study at the Technical University of Berlin. He finished his + studies in 1997 with a Diplom (roughly the German equivalent of a masters) + in Mathematics. His thesis was "Design Pattern for the Implementation of + Graph Algorithms"; strike the "Design Pattern" and put in "Generic" somehow + to get an idea of the main topic. The thesis is available from http://www.dietmar-kuehl.de/generic-graph-algorithms.pdf.

+ +

Since 1997 he has worked as consultant for a small company called Claas + Solutions (the "aa" is no typo), mainly working for major German banks. + Since late 1995 Dietmar Kuehl has been one of the moderators of the + newsgroup comp.lang.c++.moderated. He is active on + the C++ Standards committee.

+ +

Email: dietmar_kuehl@yahoo.com

+ +

Home page:  http://www.dietmar-kuehl.de/

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 21 + November, 2006

+ +

Copyright © 2000 Dietmar Kuehl

+ +

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/people/doug_gregor.html b/people/doug_gregor.html new file mode 100644 index 0000000000..33385225ec --- /dev/null +++ b/people/doug_gregor.html @@ -0,0 +1,78 @@ + + + + + + + + + + Doug Gregor + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+

+ +

Doug is a post-doctoral research fellow in the Open Systems Lab, part of the Computer Science department at Indiana University, Bloomington..

+ +

As a generic programming zealot, his search for the One True Generic + Language has seen him through the trials of the Generic Programming Group, and + many diversions.

+ +

When not hunched over in front of an XEmacs window, Doug looks to his wife Amy to + help him navigate through the daylight. Once there, he enjoys tennis and + the occasional game of paintball.

+ +

Email: dgregor -at- cs.indiana.edu

+ +

Home page: http://www.osl.iu.edu/~dgregor
+

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 November, 2006

+ +

Copyright © 2005 Doug Gregor

+ +

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/people/ed_brey.htm b/people/ed_brey.htm new file mode 100644 index 0000000000..dfa15444e9 --- /dev/null +++ b/people/ed_brey.htm @@ -0,0 +1,85 @@ + + + + + + + + + + Ed Brey + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

ed_brey.jpgEd Brey lives in Menomonee Falls, Wisconsin, a village outside of + Milwaukee. In the summertime, he likes to play tennis with his wife, and in + the winter, if there is enough snow, he likes to go tobogganing or + ice-skating. If it is not nice enough outside for either of those, he plays + on the piano.

+ +

Ed works at Eaton Corporation in + Milwaukee. He started working there as part of Marquette University's engineering co-op program. + Upon graduation in 1995 from Marquette with a BS in electrical and computer + engineering, he was hired on full-time, where he initially worked on + firmware for industrial controls. More recently, he has been working on a + PC-based configuration tool for industrial networks. Ed received his MS in + computer engineering in 2001 from NTU + .

+ +

Ed has held programming as a pastime since his grade school days, when + he wrote a babysitting invoicing program. Soon after, he wrote a game + inspired by the TV game show “Press Your Luck”. Ever since, + programming languages and concepts, along with finding ways to improve the + art and science of coding software, have always peeked his interest.

+ +

Lastly, Ed has managed to retain his perspective. As fun as computers + and programming are, Ed's true loves in life are the Lord Jesus whom he + serves and his dear wife Beth.

+
+ +

Home page: http://BreyFamily.net

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 20 + November, 2006

+ +

Copyright © 2002 Ed Brey

+ +

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/people/eric_friedman.htm b/people/eric_friedman.htm new file mode 100644 index 0000000000..ac0067e826 --- /dev/null +++ b/people/eric_friedman.htm @@ -0,0 +1,69 @@ + + + + + + + + Eric Friedman + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+ Eric Friedman is an undergraduate at Stanford University. Born + in 1984, he discovered programming at 10 and Boost at 17. He is a Computer + Science major, with interests in Political Science and Arabic.
+
+ Eric is co-author of the Variant + library and intends to author more.
+
+ He enjoys rap music, discussing politics, and, of course, programming.
+
+ Though not starving, Eric is a college student and so appreciates both + spontaneous donations and internship opportunities. He can be contacted at + ebf@users.sourceforge.net.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2003 Eric Friedman

+ +

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/people/fernando_cacciola.html b/people/fernando_cacciola.html new file mode 100644 index 0000000000..b8e771cf4f --- /dev/null +++ b/people/fernando_cacciola.html @@ -0,0 +1,84 @@ + + + + + + + + Fernando Cacciola + + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+

+ +

Fernando Cacciola has + been programming since 1984 when he got his hand on a Tandy Color Computer + II for the first time. He started with BASIC at the time, but quickly moved + to Assembly Language to get the most out of the Home Computers of the time + (from a Sinclair 1500 [Z80] to a Commodore 64 [Motorola 6510]).

+ +

In 1990 he discovered the C programming language and started to work as + a professional programmer. In 1995 he discovered C++, and during his long + time employement in a company producing CAD systems, the fields of + Geometric Computing, Computer Graphics, Image Processing and Numerics in + general.

+ +

He studied Biochemistry at the John F. Kennedy (Argentina) University + for 4+ years, but had to drop because of his full-time job as a programmer. + He would complete a CS degree if he only had the time.

+ +

After 13 years of being an employed programmer (in just a couple of + companies), by the end of 2003, he became a freelancer and founded SciSoft, + a company specialized in technically/scientifically-oriented software.

+

Currently he is an active developer of the + Computational Geometry Algotithms Library (CGAL) and a member of the + IEEE Computer Society, the + Association for Computing Machinery (ACM) and the + ACCU community.

+ +

You are always welcome to visit Fernando's home page.

+ + +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2004 Fernando Cacciola

+ +

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/people/gary_powell.htm b/people/gary_powell.htm new file mode 100644 index 0000000000..82ea5de69d --- /dev/null +++ b/people/gary_powell.htm @@ -0,0 +1,71 @@ + + + + + + + + + + Gary Powell + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Gary Powell has been messing around with C++ since + '87 when he dreamed about adding his own operators to the language. Since + then he's been busy overloading everything in sight, and working on + bringing functional programming to C++.

+ +

He currently works for Sierra On-line http://www.sierra.com a division of Havas + Interactive, a wholly owned subsidiary of Vivedi Universal of France, + http://www.vivendi.com as a game + programmer where he writes AI.

+ +

He can be reached at gary.powell@sierra.com but don't ask + him how to solve the riddle of the left handed troll.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2000 Gary Powell

+ +

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/people/gennadiy_rozental.htm b/people/gennadiy_rozental.htm new file mode 100644 index 0000000000..ba9bb166ef --- /dev/null +++ b/people/gennadiy_rozental.htm @@ -0,0 +1,69 @@ + + + + + + + + Gennadiy Rozental + + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Gennadiy Rozental is a software developer from + Ukraine, who now lives in New Jersey, United States and work for Thomson + Financial in New York. He is married, with son and daughter.

+ +

Gennadiy graduated from MIPT: Moscow Institute of Physics and Technology + with Master degree in computer science. Ever since Gennadiy has been + programming mostly in C++.

+ +

In his spare time he not only works on boost, but also enjoy origami + making.

+ +

You can contact him by sending mail to rogeeff at mail dot com

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 21 + November, 2006

+ +

Copyright © 2004 Gennadiy Rozental

+ +

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/people/greg_colvin.htm b/people/greg_colvin.htm new file mode 100644 index 0000000000..5f82ad0419 --- /dev/null +++ b/people/greg_colvin.htm @@ -0,0 +1,59 @@ + + + + + + + + Greg Colvin + + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Dr. Greg Colvin has been hacking happily + since 1972. He is a member of the ANSI/ISO C++ standards committee and a + Principal Member of Technical Staff with the Java Products Group at Oracle + Corporation. In his spare time he plays apocalyptic electric blues guitar + in his Colorado, USA home studio.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 November, 2006

+ +

Copyright © 2000 Greg Colvin

+ +

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/people/hartmut_kaiser.htm b/people/hartmut_kaiser.htm new file mode 100644 index 0000000000..b0e2084a7c --- /dev/null +++ b/people/hartmut_kaiser.htm @@ -0,0 +1,69 @@ + + + + + + + + + + Harmut Kaiser + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+ After 15+ interesting years + that Hartmut spent working in industrial software development, he still + tremendously enjoys working with modern software development technologies + and techniques. His preferred field of interest is the software development + in the area of object-oriented and component-based programming in C++ and + its application in complex contexts, such as for spatial information + systems, internet based applications and parser technologies. Hartmut + enjoys using and learning about modern C++ programming techniques, such as + template based generic and meta-programming and preprocessor based + meta-programming.

+ +

You can contact him by sending mail to: Hartmut.Kaiser [at] gmail [dot] + com

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 November, 2006

+ +

Copyright © 2006 Harmut Kaiser

+ +

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/people/herve_bronnimann.htm b/people/herve_bronnimann.htm new file mode 100644 index 0000000000..deba8e384b --- /dev/null +++ b/people/herve_bronnimann.htm @@ -0,0 +1,65 @@ + + + + + + + + + + Herve Bronnimann + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Hervé Brönnimann is an Assistant + Professor at the Polytechnic University + in Brooklyn, NY. His research deals with computational geometry, + algorithms, and implementation. Prior to crossing the Atlantic, he was a + researcher at INRIA, participating in the development of the CGAL library for geometric computation.
+
+ In Boost, he is one of the authors of the Interval library, and of the + Minmax library.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 November, 2006

+ +

Copyright © 2004 Hervé Brönnimann

+ +

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/people/howard_hinnant.htm b/people/howard_hinnant.htm new file mode 100644 index 0000000000..d5925da548 --- /dev/null +++ b/people/howard_hinnant.htm @@ -0,0 +1,75 @@ + + + + + + + + + + Howard Hinnant + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

howard_hinnant.jpg (19817 bytes)When Howard Hinnant is not monkeying around, he is a + software engineer for Apple and represents Apple on the C++ Standards + committee as Library Working Group Chairman.  Howard has is also one of the + co-authors / co-inventors of the rvalue reference work for C++09 making move + semantics and perfect forwarding practical in C++.  In the past Howard was the + principal author of the CodeWarrior C++ library.

+ +

Howard is married with four children, four dogs (he really isn't that fond of + dogs), a rabbit, several exotic lizards with the usual accompaniment of + insects (which the lizards are supposed to eat but find more entertaining to + turn loose in the house), um... let's see ... fish, wild mice (they eventually + kidnapped all the domesticated rodents), several dozen chickens (no I'm not + kidding)...  The neighbors are trying to turn my property into a federally + protected wildlife preserve.  They've got a fighting chance ... the kids alone + would qualify.

+ +

When not sitting in front of his computer, Howard enjoys snow skiing and ... + more, snow skiing.

+ +
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 06 December, 2006

+ +

Copyright © 2000 Howard Hinnant

+ +

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/people/hubert_holin.html b/people/hubert_holin.html new file mode 100644 index 0000000000..4a0dc25955 --- /dev/null +++ b/people/hubert_holin.html @@ -0,0 +1,77 @@ + + + + + + + + + Hubert Holin + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Hubert Holin is a mathematician. He is + currently a civil servant of the french state (no longer indentured, but + still stuck). He has also worked as a developper in a small french start-up + , and as a math teacher in a private non-religious higher-ed school.

+ +

His first programs were in assembly language/micro-code on an + Hewlett-Packard HP 25 + hand-held calculator (a marked improvement over his father's use of + binary-on-strips-of-paper on some forgoten piece of metal...), back in the + mists of time. He is a Mac-using refugee of the Atari, and on a personal + jihad against The Evil Empire Of Computing ™.

+ +

Very much a Child of the World, he has lived in Europe, Africa, the + U.S.A., and is married with a chinese girl (with whom he has both a + daughter and a son).

+
+ +

Email: Hubert.Holin@Bigfoot.com

+ +

Home page: http://www.Bigfoot.com/~Hubert.Holin
+

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 November, 2006

+ +

Copyright © 2001 Hubert Holin

+ +

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/people/jaakko_jarvi.htm b/people/jaakko_jarvi.htm new file mode 100644 index 0000000000..5e2aeb5086 --- /dev/null +++ b/people/jaakko_jarvi.htm @@ -0,0 +1,69 @@ + + + + + + + + + + Jaakko Järvi + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+

+ +

Jaakko Järvi is currently a researcher (Post doc) in the Open Systems Lab at Indiana University.
+
+ He's the author of the Tuple Library + and co-author of the Lambda + Library.
+
+ He can be reached at jajarvi@cs.indiana.edu.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2003 Jaakko Järvi

+ +

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/people/jeff_garland.html b/people/jeff_garland.html new file mode 100644 index 0000000000..775a3c7380 --- /dev/null +++ b/people/jeff_garland.html @@ -0,0 +1,74 @@ + + + + + + + + Jeff Garland + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Jeff Garland a + software developer/consultant from sunny Phoenix, Arizona USA (that's + always UTC-7 since there's no DST in AZ). He is the author of the boost date-time library + as well as a book on representing software + architecture.

+ +

Jeff has been distracted from finishing all those cool features people + want in date-time by running the Boost + Wiki, serving as a review manager, and a Boost Moderator.

+ +

On the rare day that he's not in front of a computer from morning till + night you might find him out hiking, biking, or skiing in Arizona's + mountains and canyons with his wife and 2 daughters.

+ +

Email: jeff at + crystalclearsoftware.com

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2005 Jeff Garland

+ +

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/people/jens_maurer.htm b/people/jens_maurer.htm new file mode 100644 index 0000000000..10de95d25f --- /dev/null +++ b/people/jens_maurer.htm @@ -0,0 +1,75 @@ + + + + + + + + + + Jens Maurer + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Jens Maurer is a software developer from Germany who + lives close to Frankfurt/Main. He was born in 1973 and hasn't died yet.

+ +

He has worked for a multimedia company programming home-banking + applications, CGI scripts and Java applications. He also helped program + some simulation systems for long-term decision support to aid businessmen + in arguing about company investments.

+ +

He is neither married nor does he have a girl friend, but asked his + colleagues to find one for him.

+ +

In his spare time, he likes visiting foreign countries but dislikes + getting there in uncomfortable airplane seats. On random week-ends, he + enjoys participating in historic dance courses (without a costume, of + course). Sometimes, he needs fresh air and goes for a walk. 

+ +

Email: Jens.Maurer@gmx.net

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2000 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/people/jeremy_siek.htm b/people/jeremy_siek.htm new file mode 100644 index 0000000000..5e087bcbde --- /dev/null +++ b/people/jeremy_siek.htm @@ -0,0 +1,71 @@ + + + + + + + + + + Jeremy Siek + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Jeremy Siek is a Ph.D. student at Indiana Univ. + Bloomington.
+
+ He is the author of the Matrix Template Library (MTL), and helped design + the Generic Graph Component Library, which is now the Boost Graph Library + (BGL).
+
+ Once in a while Jeremy "comes up for air" and enjoys fencing, hiking, + skiing, and reading. He's also been spotted at a few fightin' irish + tailgaters (BYOB).
+
+ Jeremy has an intense fear for the ancient dark forests where dusty decks + thrive and devour programmers, places where the light of abstraction has + not yet reached.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2001 Jeremy Siek

+ +

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/people/joaquin_lopez.htm b/people/joaquin_lopez.htm new file mode 100644 index 0000000000..e003463ef3 --- /dev/null +++ b/people/joaquin_lopez.htm @@ -0,0 +1,72 @@ + + + + + + + + Joaquín M López Muñoz + + + + + + + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+ +

+Joaquín is a telecom engineer from the Polytechnic University of Madrid. He currently + works at Telefónica, + Investigación y Desarrollo, the R&D branch of the + Telefónica Group, where he leads a small group of engineers working on + advanced mobile services. Though actual programming is not one of his + job responsibilities, he still does some C++ for fun when nobody's + around.

+ +

Joaquín's professional career began with his first exposure to a + Dragon 32 (a Tandy TRS-80 clone) at the age of 13, though at the time he + probably was unaware of the future impact of this event. He enjoys + Mathematics, Logic and Latin; his lower case interests include paper + folding, compulsive reading, travel and visiting all sorts of pubs and + restaurants. You can contact him at joaquin@tid.es.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 12 + February, 2007

+ +

Copyright © 2004-2007 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/people/joel_de_guzman.htm b/people/joel_de_guzman.htm new file mode 100644 index 0000000000..4eb51b4b6e --- /dev/null +++ b/people/joel_de_guzman.htm @@ -0,0 +1,72 @@ + + + + + + + + + + Joel de Guzman + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Joel got into electronics + and programming in the 80s because almost everything in music, his first + love, is becoming electronic and digital. Back then, he used to build his + own guitars, effect boxes and synths. He enjoys playing distortion-laden + rock guitar, composes and produces his own music in his home studio.

+ +

In the 90s, he went to Japan and worked there as a software engineer. + There, he learned C++ and immediately fell in love it. He's still trying + his best to master the language in all its immensity.

+ +

Joel is quite adept in writing code using modern C++ techniques such as + template metaprogramming and C++ functional programming. He's very happy + and enthusiastic with his current job as a consultant and engineer at + Boost Consulting.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2003 Joel de Guzman

+ +

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/people/john_maddock.htm b/people/john_maddock.htm new file mode 100644 index 0000000000..739e9f6a14 --- /dev/null +++ b/people/john_maddock.htm @@ -0,0 +1,65 @@ + + + + + John Maddock + + + + + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+ John Maddock is a software developer from + England and holds a PhD in Chemistry, but found that computers smell less + and explode less often!

+ +

John is the author of the regex++ + regular expression package, has an almost pathological interest in + anything that "can't be done", and can be contacted at john@johnmaddock.co.uk.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2003 John Maddock

+ +

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/people/jonathan_turkanis.htm b/people/jonathan_turkanis.htm new file mode 100755 index 0000000000..ab11d5301d --- /dev/null +++ b/people/jonathan_turkanis.htm @@ -0,0 +1,64 @@ + + + + + + + + + + Jonathan Turkanis + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Jonathan Turkanis is a Ph.D. Candidate in + mathematical logic at the University of California at Berkeley and a + coauthor of the forthcoming C++ Cookbook, published by O'Reily.

+ +

You can contact him by sending mail to technews@kangaroologic.com.
+

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 24 + December, 2006

+ +

Copyright © 2005 Jonathan Turkanis

+ +

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/people/kevlin_henney.htm b/people/kevlin_henney.htm new file mode 100644 index 0000000000..a6a63398d4 --- /dev/null +++ b/people/kevlin_henney.htm @@ -0,0 +1,84 @@ + + + + + + + + + + Kevlin Henney + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Kevlin Henney (mailto:kevlin@curbralan.com, http://www.curbralan.com) is an independent + consultant and trainer based in the UK. He has developed and delivered + training course material and consultancy on many aspects of OO development, + which he has practiced across a number of domains for longer than he cares + (or can) remember. His professional interests include patterns, OO and + component-based design, architecture, distributed object systems, and + languages, including C++, C#, Java, and Ruby. He is also a member of the + BSI C++ standards committee.

+ +

Now that writing code is no longer the core responsibility of his job, + his non-professional interests seem to include the hacking associated with + the aforementioned professional interests. However, never being one to keep + something to himself (like C++'s relationship with C, this is regarded as + both a strength and a weakness), he shares/inflicts (delete as necessary) + his professional and non-professional development experiences with/on + (ditto) others through writing articles and presenting tutorials, workshops + and papers at conferences.

+ +

He is married, and not just to his work. He and Carolyn have one child, + Stefan. The little spare time that remains to him is taken up with music, + reading, pub appreciation, etc. Although with a newborn, there is more + reading and less pub appreciation (pubs are still appreciated, but more in + memory than in interaction).  Finally, although he enjoys writing, + Kevlin is not really one for writing in the third person.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2002 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/people/liequan_lee.htm b/people/liequan_lee.htm new file mode 100644 index 0000000000..109509e964 --- /dev/null +++ b/people/liequan_lee.htm @@ -0,0 +1,66 @@ + + + + + + + + + + Lie-Quan Lee + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
  + +

+Lie-Quan Lee, AKA Rich Lee, is a graduate stduent in + Computer Science at University of Notre Dame. He is the author of the + Generic Graph Component Library (GGCL).

+ +

He has a strong desire of learning to disassemble and assemable any + electrical appliances. He likes playing bridge but never had a chance to + play it after he entered the wonderful world of computers.

+ +

He can be contacted at liequan@slac.stanford.edu.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2004 Lie-Quan Lee

+ +

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/people/mac_murrett.htm b/people/mac_murrett.htm new file mode 100644 index 0000000000..2b3fcb50e4 --- /dev/null +++ b/people/mac_murrett.htm @@ -0,0 +1,65 @@ + + + + + + + + Mac Murrett + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+ Mac Murrett is an Advanced Developer at Vanteon. He lives in Rochester, NY, where + everything closes at 10 PM. This gives him plenty of time to think.

+ +

Mac graduated from SUNY: University at Buffalo with a degree in + Mathematics. He has been programming Macintoshes since he was 12 years old, + and recently won the + Best Hack Contest at MacHack + 2001. Nonetheless, he swears up and down that his name has nothing to + do with the computer.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2002 Mac Murrett

+ +

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/people/mark_rodgers.htm b/people/mark_rodgers.htm new file mode 100644 index 0000000000..8cf2c4ca68 --- /dev/null +++ b/people/mark_rodgers.htm @@ -0,0 +1,74 @@ + + + + + + + + + + Mark Rodgers + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Mark Rodgers lives in Wellington, the capital of New + Zealand, with his wife, Clare, and their son, Ronnie.

+ +

He studied Computer Science at Victoria University of Wellington + from 1983 to 1986, completing a B.Sc. (Hons). He now works as + consultant through his company, Cadenza New Zealand Ltd, and also markets + Cadenza Drawing Board™, a CAD system he developed.

+ +

Mark has been programming in C++ since about 1990, and loves every + minute of it, but is continually amazed at how much more he still has to + learn.

+ +

You can contact Mark at mark.rodgers@cadenza.co.nz.
+

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 02 + December, 2006

+ +

Copyright © 2000 Mark Rodgers

+ +

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/people/mat_marcus.htm b/people/mat_marcus.htm new file mode 100644 index 0000000000..22b1703a94 --- /dev/null +++ b/people/mat_marcus.htm @@ -0,0 +1,69 @@ + + + + + + + + + + Mat Marcus + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+

+ +

Mat Marcus is a senior computer + scientist in the Software Technology Lab at Adobe Systems, Inc. He has been + developing software since 1985. Recent projects include a collaboration + with Alex Stepanov on a + programming class and work on the Adobe Source Library. Mat's first + contribution to Boost came in the summer of 2000, when he discovered a way + to exploit the properties of the sizeof operator to simulate partial + specialization (is_pointer, etc. with Jesse Jones). Mat lives in Seattle + with his wife and son.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 21 + November, 2006

+ +

Copyright © 2002 Mat Marcus

+ +

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/people/paul_mensonides.htm b/people/paul_mensonides.htm new file mode 100644 index 0000000000..e94527917c --- /dev/null +++ b/people/paul_mensonides.htm @@ -0,0 +1,60 @@ + + + + + + + + Paul Mensonides + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Paul Mensonides was born on March 31 in 1977. + He lives in Tacoma, Washington.

+ +

His interests include musical composition, playing the guitar, skiing, + and programming--particularly in C and C++.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2002 Paul Mensonides

+ +

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/people/paul_moore.htm b/people/paul_moore.htm new file mode 100644 index 0000000000..ffbf11e322 --- /dev/null +++ b/people/paul_moore.htm @@ -0,0 +1,33 @@ + + + + + + Paul Moore + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+

paul_moore.jpg (12023 bytes)Paul + Moore lives in Cheshire, England. He is married, with one son. His "day + job" is as an Oracle DBA, but he writes C and C++ programs in his spare + time.

+

Paul started programming on Acorn's BBC Micro and RISC PC series of computers, + but finally went mainstream and bought a PC, on which he now runs Windows and + Linux. Paul's main interest is in porting and developing open-source software, + and so his main programming language is C (at least until the open source + community switches to C++).

+

Paul's main claim to C++ fame is that he owns all 3 editions of Bjarne + Stroustrup's "The C++ Programming language", plus the ARM and the C++ + standard, but he didn't own a C++ compiler until after the 3rd edition of + Stroustrup's book came out. Make of that what you will...

+ + diff --git a/people/pavol_droba.htm b/people/pavol_droba.htm new file mode 100644 index 0000000000..83bca1ba7a --- /dev/null +++ b/people/pavol_droba.htm @@ -0,0 +1,76 @@ + + + + + + + + + + Pavol Droba + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+ Pavol Droba lives in Bratislava, the + capital of Slovakia with his beautiful wife Lenka.

+ +

Since childhood he has always been messing with computers in one way or + the other until he settled down with C++. Since then he did a lot of + various projects but he retained his affinity to his favorite programming + language.

+ +

He loves to design nice programs that works and to see how the pieces of + the puzzle called design come together.

+ +

Currently he is a developer in a small company where he leads a group of + 5 other guys.

+ +

When he is not at the computer Pavol enjoys his time with his wife. In + winter he likes skiing, in summer he does some scuba diving.

+ +

You can leave him a message at droba@topmail.sk.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2004 Pavol Droba

+ +

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/people/people.htm b/people/people.htm new file mode 100644 index 0000000000..b01723522f --- /dev/null +++ b/people/people.htm @@ -0,0 +1,529 @@ + + + + + + + + + + Boost People + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

Boost People

+ +

(Click on the names for biographies)
+ (Click on the images for enlarged images)

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Dave Abrahams+
Darin Adler+
Ed Brey+
Hervé + Brönnimann+
Fernando Cacciola+
Greg Colvin+
Beman Dawes+
Joel de Guzmanhttp://boost.sourceforge.net/photos/joel_de_guzman.jpg
Peter Dimov+
Pavol Droba+
Eric Friedman+
Ron Garcia+
Jeff Garland+
Doug Gregor+
Ralf W + Grosse-Kunstleve+
Aleksey Gurtovoy+
Kevlin Henney+
Howard Hinnant+
Hubert Holin+
Andreas Huber+
Nicolai Josuttis+
Jaakko Järvi+
Hartmut Kaiserhttp://boost.sourceforge.net/photos/hartmut_kaiser.jpg
Vesa Karvonen+
William Kempf+
Samuel Krempp+
Dietmar Kühl+
Lie-Quan Lee+
Joaquín M López + Muñoz+
John Maddock+
Mat Marcus+
Jens Maurer+
Paul Mensonides+
Paul Moore+
Mac Murrett+
Thorsten Ottosen+
Gary Powell+
Vladimir Prus+
Robert Ramey+
Rene Rivera+
Mark Rodgers+
Gennadiy Rozentalhttp://boost.sourceforge.net/photos/gennadiy_rozental.jpg
Jeremy Siek+
Jonathan Turkanis+
Daryle Walker+
Thomas Witt+
+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2004 Beman Dawes

+ +

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/people/peter_dimov.htm b/people/peter_dimov.htm new file mode 100644 index 0000000000..110083255a --- /dev/null +++ b/people/peter_dimov.htm @@ -0,0 +1,63 @@ + + + + + + + + + + Peter Dimov + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+
+
Peter Dimov is a software + developer from Plovdiv, Bulgaria.

+ +

He likes C++. Not to the extent to donate a kidney for every proposed + extension, but close.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2005 Peter Dimov

+ +

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/people/ralf_w_grosse_kunstleve.htm b/people/ralf_w_grosse_kunstleve.htm new file mode 100644 index 0000000000..e76ea87fa4 --- /dev/null +++ b/people/ralf_w_grosse_kunstleve.htm @@ -0,0 +1,94 @@ + + + + + + + + Ralf W. Grosse-Kunstleve + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+ Ralf is a crystallographer. He has a + degree in Mineralogy (Bochum, + Germany), and a Ph.D. in Crystallography (ETH Zurich , + Switzerland). Real Mineralogists and Crystallographers run experiments with + x-rays and hardware that is not normally associated with C++ and Boost. + However, when Ralf kept breaking the expensive experimental equipment too + often, he decided that he would cause less damage as a computational + crystallographer.

+ +

Being a scientist, Ralf spent most of his life programming in Fortran, + the great grand-father of all good programming languages (if you know + Backus-Naur you know the name of the inventor + of Fortran). Ralf is a co-author of the CNS Fortran program that is very popular in + structural biology. When he learned that a real programmer can write + Fortran in any language, Ralf knew that it was time for him to learn C++. + Of course, absorbing four decades of progress in the field of computer + science all at once crashed his brain. To be able to deal with the + challenge, he spawned two child processes and named them Lisa and Anna. To + see Lisa, click on the picture and turn your monitor by 180 degrees around + the view axis. (Other pictures of Lisa and Anna do not require + gymnastics with the monitor.)

+ +

Right now, Ralf is working for the Computational Crystallography Initiative at the + Lawrence Berkeley National Laboratory in + California. The goal of this initiative is to write a software system for + high-throughput protein crystal structure determination, also known as + Structural + Genomics. Surprisingly, the gestation period for such a system turns + out to be much longer than it was for Lisa and Anna. However, pre-natal + diagnosis already revealed that Python and C++ are the parents-to-be. For + an ultra-sound image of the new system at its early developmental stage + click here.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2001 Ralf W. Grosse-Kunstleve

+ +

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/people/rene_rivera.htm b/people/rene_rivera.htm new file mode 100644 index 0000000000..55fbcfaf7d --- /dev/null +++ b/people/rene_rivera.htm @@ -0,0 +1,78 @@ + + + + + + + + + + + Rene Rivera + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+ Rene has spent most of his + life programming in one language or another. From assembly, through BASIC, + and up to C++ and Lisp, he has managed to program on a variety of computers + and operating systems.

+ +

Currently he is running Redshift Software, Inc. (redshift-software.com), a company he + founded with the help of some friends in 1997.

+ +

In the past he managed to get a concurrent MS and BS in Computer Science + from Loyola University at Chicago. Work for the Institute for the Learning + Sciences at Northwestern University building AI related systems. And worked + on game development at Jellyvision Inc. (jellyvision.com). Where he lead the + programming of "You Don't Know Jack: The 5th Dementia", and of "That's a + Fact: Jack! Read.". Which where the basis for the development of the first + two versions of "Who Wants To Be a Millionaire".

+ +

His motto of "clean code, clean graphics, it can always stand + improvement" has repeatedly gotten him in trouble.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2003 Rene Rivera

+ +

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/people/robert_ramey.htm b/people/robert_ramey.htm new file mode 100644 index 0000000000..72f04d4dab --- /dev/null +++ b/people/robert_ramey.htm @@ -0,0 +1,71 @@ + + + + + + + + + + Robert Ramey + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Robert Ramey is a contract software developer + living in Santa Barbara, California. He has been involved in all aspects of + the computer industry for more than 30 years.

+ +

After graduating with an MS in Operations Research from U.C. Berkeley in + 1971 and serving 18 months in the miltary, he left on a trip to Ecuador. + There he founded a data processing company which is still in operation + today. Returning to California in 1986, he focused on the more technical + aspects of software development. This has resulted in the completion of + projects such as the Postman's Sort and Boost serialization library - among + others.

+ +

Other current interests include hanggliding, squash, hiking and bike + riding.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2004 Robert Ramey

+ +

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/people/ronald_garcia.htm b/people/ronald_garcia.htm new file mode 100644 index 0000000000..161a19d6f2 --- /dev/null +++ b/people/ronald_garcia.htm @@ -0,0 +1,67 @@ + + + + + + + + + + Ronald Garcia + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Ronald Garcia is a + Ph.D. student at Indiana University in Bloomington, Indiana. He is the + author of the Boost Multidimensional Array Library (MultiArray). His research + interests include software engineering tools and techniques, programming + languages, generic and generative programming and high performance + scientific computing.

+ +

When he's not in front of a computer, Ron's interests include playing + ultimate frisbee, bass guitar, drumset, and West African + percussion.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 20 November, 2006

+ +

Copyright © 2002 Ronald Garcia

+ +

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/people/samuel_krempp.htm b/people/samuel_krempp.htm new file mode 100644 index 0000000000..f173e45162 --- /dev/null +++ b/people/samuel_krempp.htm @@ -0,0 +1,70 @@ + + + + + + + + + + Samuel Krempp + + + + + + + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+ +

+Samuel Krempp is a PhD + student in mathematics, at the CMLA in the 'Ecole Normale + Supérieure' de Cachan (France). He spends most of his time + implementing complicated image recognition algorithms, and thus had to get + acquainted with C++.

+ +

He enjoys many other things - one of them is diving in wonderful, warm, + sunny seas when he can afford it. And obviously, another is eating + camembert and bread, drinking wine... and other activities typical of a + French guy :)

+ +

He's the author of the Boost Format + library.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2002 Samuel Krempp

+ +

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/people/thomas_witt.html b/people/thomas_witt.html new file mode 100644 index 0000000000..8d1bc4bf9d --- /dev/null +++ b/people/thomas_witt.html @@ -0,0 +1,75 @@ + + + + + + + + + + Thomas Witt + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+

+ +

Thomas Witt is a senior software developer at Zephyr Associates, Inc.. Being a + mechanical engineer by training, he nowadays spends most of his time + developing applications and libraries in C++. Twice a year he is allowed to + leave his office to attend C++ standards committee meetings.

+ +

Thomas is coauthor of the Boost.Iterator library and in a less busy and + distant past was acting as Boost Review + Wizard

+ +

In his spare time Thomas likes reading, running, swimming and skiing. + There is also rumor of him being a railroad enthusiast, but Thomas refuses + to comment on this. Thomas lives in Stateline, Nevada enjoying the view of + Lake Tahoe and the slopes of the surrounding ski resorts.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2005 Thomas Witt

+ +

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/people/thorsten_ottosen.html b/people/thorsten_ottosen.html new file mode 100755 index 0000000000..e6cf4a3e66 --- /dev/null +++ b/people/thorsten_ottosen.html @@ -0,0 +1,73 @@ + + + + + + + + Thorsten Ottosen + + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+

+ +

Thorsten Ottosen holds a Bsc in + Computer Science at Aalborg University, Denmark. After having studied + mathematics at University of Technology in Sydney, Australia, he has now + returned to Denmark to write a second thesis in the area of decision + support systems. His first thesis was in computer graphics + since he used to dream about making computer games.

+ +

Thorsten is also a co-owner and part-time employee of Dezide, a company that specializes is + trouble-shooting programs based on Bayesian-network technology.

+ +

In his spare-time he codes/reads/hacks C++ and participates in ANSI/ISO + C++ committee meetings. In his spare-time of his spare-time he enjoys + jogging, reading, and being with family and friends.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2004 Thorsten Ottosen

+ +

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/people/vesa_karvonen.htm b/people/vesa_karvonen.htm new file mode 100644 index 0000000000..5a222d50e8 --- /dev/null +++ b/people/vesa_karvonen.htm @@ -0,0 +1,65 @@ + + + + + + Vesa Karvonen + + + + + + + + + + + +
+ boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+

If + we are to believe MBTI tests, Vesa is an + INTJ. He has been like that probably since late 1978-1979, because, + according to some sources, it takes 2-3 years to develop the basic temperament. + Previously he saw himself mostly as a "builder of systems" and + "applier of theoretical models", but nowadays he is beginning to see + the "mastermind" aspect of his personality. As a + "Free-Thinker", his mind hardly ever rests.

+

Vesa enjoys healthy and sustainable ways of life. He is a vegetarian and likes + cooking. Exercise is a daily part of his life - he needs to be in good shape in + order to sit all day in work. He likes going to the gym, swimming, spinning, + running, roller skating, etc... He also practices dancing.

+

For the past years, he has been working in a small + company that develops console games. His role is the development of + software technology, such as class libraries, frameworks and tools, for making + games. He doesn't see himself as a game or a graphics programmer, although he + has been involved in quite a few such projects. For the past few years, most of + his programming has been in C++, but recently he has also enjoyed writing some + Ocaml.

+

He likes buying technical books using the company credit card, but lately he + hasn't had the time to read as much as he would like (hopefully this changes + soon). He likes reading (a lot) computer science and software engineering, but + also psychology, philosophy and various self-help books, because he knows that + all the really hard problems are social - not technical. Fantasy is also close + to his heart.

+

Vesa is a bit ambivalent about his university studies. He is a self-educated + programmer and has experience ranging from bit twiddling to generative + programming and also leading of small teams. Like many of his close colleagues, + he sees that the depth of computer science education, at least in Finland, is, + frankly, insufficient. He'll probably complete his studies some day, because + sadly most people respect authority by rank, title or publication far more than + he does.

+

Vesa is an eXtreme Programmer. He has found out that in order for pair + programming to work, both pairs must share a similar level of experience and + must be both willing and able to externalize their thoughts. If he is sometimes + forced to stop refactoring, he'll probably quit his job. He thinks that + optimization, including improving readability and simplifying structure, is the + root of all fun in programming. He dislikes writing documentation and reports + that are never read.

+

One of his friends coerced him to use the image that you see on this page. The + image was scanned from a rather worn out picture taken by an ex-girlfriend and + is probably the only picture of Vesa having his natural smile. Vesa is neither + married nor engaged, but just recently he met a very nice girl... While + programming is interesting and fun, it is love that really makes him happy. ;)

+ + diff --git a/people/vladimir_prus.htm b/people/vladimir_prus.htm new file mode 100644 index 0000000000..342ea69695 --- /dev/null +++ b/people/vladimir_prus.htm @@ -0,0 +1,65 @@ + + + + + + + + Vladimir Prus + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

vladimir_prus.jpg (25247 bytes)Vladimir Prus is a PhD student at Moscow State + University. He's supposed to do some research about program analysis, + processors and graphs, but also has various other interests, like software + engineering tools and compilers.

+ +

Volodya would probably spend all his time staring at the monitor and + haunting MSU corridors, but luckily is married and hardly can be seen in + front of a computer on weekends. He's not into any extreme sports, and + spends spare time going to cinema or just walking with his wife Caroline in + quiet parts of Moscow.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2004 Vladimir Prus

+ +

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/people/william_kempf.htm b/people/william_kempf.htm new file mode 100644 index 0000000000..0ce2f90486 --- /dev/null +++ b/people/william_kempf.htm @@ -0,0 +1,69 @@ + + + + + + + + + + William Kempf + + + + + + + + + + + + + + + + + +
+HomeLibrariesPeopleFAQMore
+ +

+Bill Kempf lives in Omaha, NE with his wife + Bonnie, his cat Dexter and his two Chinchillas, Chimney and Minuet. He + married on Oct. 30, 1999 where he and his wife held a Halloween costume + reception. If that doesn't give you an idea of what kind of guy he is, + nothing will.

+ +

Bill graduated from Doane, a small private college in Nebraska in 1992 + with a B.S. in Computer Science/Math. Being in the wrong place at the wrong + time he had to take a job as the only person in an IS shop for a local + affiliate of the Bunge Grain Company. In 1995 he moved on to a job as a + software engineer for First Data Resources where he worked on client/server + financial applications.

+
+ +

Valid HTML 4.01 Transitional

+ +

Revised + 11 + November, 2006

+ +

Copyright © 2000 William Kempf

+ +

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/project-root.jam b/project-root.jam new file mode 100644 index 0000000000..35201d6dbb --- /dev/null +++ b/project-root.jam @@ -0,0 +1,6 @@ +# Copyright Rene Rivera, Vladimir Prus, David Abrahams +# 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) + +path-constant BOOST_ROOT : . ; diff --git a/regression/.htaccess b/regression/.htaccess new file mode 100644 index 0000000000..48f216a8e7 --- /dev/null +++ b/regression/.htaccess @@ -0,0 +1,6 @@ +RewriteEngine on + +#~ RewriteRule ^(.+)\.cpp$ http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/boost/boost/$1.cpp?rev=HEAD&content-type=text/vnd.viewcvs-markup [R,L] + +RewriteRule ^developement(/.*) http://engineering.meta-comm.com/boost-regression/CVS-HEAD$1 [R,L] +RewriteRule ^release(/.*) http://engineering.meta-comm.com/boost-regression/1_34_0$1 [R,L] diff --git a/rst.css b/rst.css new file mode 100755 index 0000000000..657224b7b1 --- /dev/null +++ b/rst.css @@ -0,0 +1,149 @@ +@import url("doc/html/boostbook.css"); +@import url("doc/html/docutils.css"); +/* Copyright David Abrahams 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) + */ + +dl.docutils dt { + font-weight: bold } + +img.boost-logo { + border: none; + vertical-align: middle +} + +pre.literal-block span.concept { + font-style: italic; +} + +.nav { +display: inline; +list-style-type: none; +} + +.prevpage { +padding-top: -5px; +text-align: left; +float: left; +} + +.nextpage { +padding-top: -20px; +text-align: right; +float: right; +} + +div.small { + font-size: smaller } + +h2 a { + font-size: 90%; +} +h3 a { + font-size: 80%; +} +h4 a { + font-size: 70%; +} +h5 a { + font-size: 60%; +} + +dl,table +{ + text-align: left; + font-size: 10pt; + line-height: 1.15; +} + + +/*============================================================================= + Tables +=============================================================================*/ + +/* The only clue docutils gives us that tables are logically tables, + and not, e.g., footnotes, is that they have border="1". Therefore + we're keying off of that. We used to manually patch docutils to + add a "table" class to all logical tables, but that proved much too + fragile. +*/ + + table[border="1"] + { + width: 92%; + margin-left: 4%; + margin-right: 4%; + } + + table[border="1"] + { + padding: 4px; + } + + /* Table Cells */ + table[border="1"] tr td + { + padding: 0.5em; + text-align: left; + font-size: 9pt; + } + + table[border="1"] tr th + { + padding: 0.5em 0.5em 0.5em 0.5em; + border: 1pt solid white; + font-size: 80%; + } + + @media screen + { + + /* Tables */ + table[border="1"] tr td + { + border: 1px solid #DCDCDC; + } + + table[border="1"] tr th + { + background-color: #F0F0F0; + border: 1px solid #DCDCDC; + } + + pre, + .screen + { + border: 1px solid #DCDCDC; + } + + td pre + td .screen + { + border: 0px + } + + .sidebar pre + { + border: 0px + } + + } + + pre, + .screen + { + font-size: 9pt; + display: block; + margin: 1pc 4% 0pc 4%; + padding: 0.5pc 0.5pc 0.5pc 0.5pc; + } + + /* Program listings in tables don't get borders */ + td pre, + td .screen + { + margin: 0pc 0pc 0pc 0pc; + padding: 0pc 0pc 0pc 0pc; + } + diff --git a/status/.cvsignore b/status/.cvsignore new file mode 100644 index 0000000000..d265891d55 --- /dev/null +++ b/status/.cvsignore @@ -0,0 +1,5 @@ +*.log +boosttmp.* +regression +rng.saved +rng.tmp diff --git a/status/Jamfile.v2 b/status/Jamfile.v2 new file mode 100644 index 0000000000..df81ca6c7c --- /dev/null +++ b/status/Jamfile.v2 @@ -0,0 +1,203 @@ +# Boost regression-testing Jamfile +# (C) Copyright David Abrahams 2002. Permission to copy, use, modify, sell and +# distribute this software is granted provided this copyright notice appears in +# all copies. This software is provided "as is" without express or implied +# warranty, and with no claim as to its suitability for any purpose. + +# Status: +# - std::locale-support usage is commented out. +# Two test suite have different names. +# in config test is commented out. +# One of the smart_ptr test is run only from invocation dir in V1, and not +# run in V2 at all. + + +project status + : source-location $(BOOST_ROOT) + : requirements true + ; + +import testing ; + +alias test_exec_monitor : ../libs/test/build//boost_test_exec_monitor/static ; +alias unit_test_framework : ../libs/test/build//boost_unit_test_framework/static ; + +# Tests from Jamfiles in individual library test subdirectories +# Please keep these in alphabetic order by test-suite name +build-project ../libs/algorithm/minmax/test ; # test-suite algorith/minmax +build-project ../libs/algorithm/string/test ; # test-suite algorithm/string +build-project ../libs/assign/test ; # test-suite assign +build-project ../libs/any/test ; # test-suite any +build-project ../libs/bind/test ; # test-suite bind +build-project ../libs/concept_check ; # test-suite concept_check +build-project ../libs/conversion/test ; # test-suite conversion +build-project ../libs/date_time/test ; # test-suite date_time +build-project ../libs/dynamic_bitset ; # test-suite dynamic_bitset +build-project ../libs/filesystem/test ; # test-suite filesystem +build-project ../libs/foreach/test ; # test-suite foreach +build-project ../libs/format/test ; # test-suite format +build-project ../libs/function/test ; # test-suite function +build-project ../libs/functional/hash/test ; # test-suite functional/hash +build-project ../libs/graph/test ; # test-suite graph +build-project ../libs/io/test ; # test-suite io +build-project ../libs/iostreams/test ; # test-suite iostreams +build-project ../libs/iterator/test ; # test-suite iterator +build-project ../libs/logic/test ; # test-suite logic +build-project ../libs/math/test ; # test-suite math +build-project ../libs/mpl/test ; # test-suite mpl +build-project ../libs/numeric/conversion/test ; # test-suite numeric/conversion +build-project ../libs/numeric/interval/test ; # test-suite numeric/interval +build-project ../libs/numeric/ublas/test ; # test-suite numeirc/uBLAS +build-project ../libs/multi_array/test ; # test-suite multi_array +build-project ../libs/multi_index/test ; # test-suite multi_index +build-project ../libs/optional/test ; # test-suite optional +build-project ../libs/parameter/test ; # test-suite parameter +build-project ../libs/program_options/test ; # test-suite program_options +build-project ../libs/property_map/test ; # test-suite property_map +build-project ../libs/ptr_container/test ; # test-suite ptr_container +build-project ../libs/python/test ; # test-suite python +build-project ../libs/random/test ; # test-suite random +build-project ../libs/range/test ; # test-suite range +build-project ../libs/regex/test ; # test-suite regex +build-project ../libs/regex/example ; # test-suite regex-examples +build-project ../libs/serialization/test ; # test-suite serialization +build-project ../libs/signals/test ; # test-suite signals +build-project ../libs/smart_ptr/test ; # test-suite smart_ptr +build-project ../libs/spirit/test ; # test-suite spirit +build-project ../libs/statechart/test ; # test-suite statechart +build-project ../libs/static_assert ; # test-suite static_assert +build-project ../libs/test/test ; # test-suite test +build-project ../libs/thread/test ; # test-suite thread +build-project ../libs/tr1/test ; # test-suite tr1 +build-project ../libs/type_traits/test ; # test-suite type_traits +build-project ../libs/typeof/test ; # test-suite typeof +build-project ../libs/utility/enable_if/test ; # test-suite utility/enable_if +build-project ../libs/utility/test ; # test-suite utility +build-project ../libs/variant/test ; # test-suite variant +build-project ../libs/wave/test/build ; # test-suite wave +build-project ../libs/xpressive/test ; # test-suite xpressive + +# Tests specified in this Jamfile + + test-suite config + : + # FIXME: Ideally, this should be just an alias to 'main' test suite + # defined in libs/config/test/Jamfile.v2 + # That way, we'll avoid code duplication and won't run additional + # tests in 'auxilliary' test suites, that need to be run and + # interpreted by humans. + # But such change will require tweaking libs/config/tools/generate.cpp + # so postponing to later. + [ run libs/config/test/config_test.cpp test_exec_monitor + : #args + : #input-files + : #requirements + multi #!!!config_test.cpp + ] + [ run libs/config/test/config_info.cpp : : : always_show_run_output ] + [ run libs/config/test/math_info.cpp : : : always_show_run_output borland:static ] + [ run libs/config/test/abi/abi_test.cpp libs/config/test/abi/main.cpp ] + [ run libs/config/test/limits_test.cpp test_exec_monitor ] + [ run libs/config/test/link/main.cpp ../libs/config/test/link//link_test + : #args + : #input-files + : #requirements + shared + BOOST_DYN_LINK=1 + BOOST_CONFIG_NO_LIB=1 + : + config_link_test + ] + [ compile-fail libs/config/test/threads/test_thread_fail1.cpp ] + [ compile-fail libs/config/test/threads/test_thread_fail2.cpp ] + ; + + test-suite array_suite # !!! + : [ run libs/array/array0.cpp ] + [ run libs/array/array1.cpp ] + [ run libs/array/array2.cpp ] + [ run libs/array/array3.cpp ] + [ run libs/array/array4.cpp ] + [ run libs/array/array5.cpp ] + ; + + run libs/crc/crc_test.cpp test_exec_monitor ; + + + test-suite disjoint_sets + : [ run libs/disjoint_sets/disjoint_set_test.cpp test_exec_monitor ] + ; + + run libs/functional/function_test.cpp ; + + + test-suite integer + : [ run libs/integer/cstdint_test.cpp ] + [ run libs/integer/integer_test.cpp ] + [ run libs/integer/integer_traits_test.cpp test_exec_monitor ] + ; + + test-suite lambda + : [ run libs/lambda/test/algorithm_test.cpp test_exec_monitor ] + [ run libs/lambda/test/bind_tests_simple.cpp test_exec_monitor ] + [ run libs/lambda/test/bind_tests_advanced.cpp test_exec_monitor ] + [ run libs/lambda/test/bind_tests_simple_f_refs.cpp test_exec_monitor ] + [ run libs/lambda/test/bll_and_function.cpp test_exec_monitor ] + [ run libs/lambda/test/cast_test.cpp test_exec_monitor : : : : lambda_cast_test ] + [ run libs/lambda/test/constructor_tests.cpp test_exec_monitor ] + [ run libs/lambda/test/control_structures.cpp test_exec_monitor ] + [ run libs/lambda/test/exception_test.cpp test_exec_monitor ] + [ run libs/lambda/test/extending_rt_traits.cpp test_exec_monitor ] + [ run libs/lambda/test/is_instance_of_test.cpp test_exec_monitor ] + [ run libs/lambda/test/member_pointer_test.cpp test_exec_monitor ] + [ run libs/lambda/test/operator_tests_simple.cpp test_exec_monitor ] + [ run libs/lambda/test/phoenix_control_structures.cpp test_exec_monitor ] + [ run libs/lambda/test/switch_construct.cpp test_exec_monitor ] + ; + + + run libs/pool/test/test_pool_alloc.cpp test_exec_monitor ; + + test-suite preprocessor + : [ compile libs/preprocessor/test/arithmetic.cpp ] + [ compile libs/preprocessor/test/array.cpp ] + [ compile libs/preprocessor/test/comparison.cpp ] + [ compile libs/preprocessor/test/control.cpp ] + [ compile libs/preprocessor/test/debug.cpp ] + [ compile libs/preprocessor/test/facilities.cpp ] + [ compile libs/preprocessor/test/iteration.cpp ] + [ compile libs/preprocessor/test/list.cpp ] + [ compile libs/preprocessor/test/logical.cpp ] + [ compile libs/preprocessor/test/repetition.cpp ] + [ compile libs/preprocessor/test/selection.cpp ] + [ compile libs/preprocessor/test/seq.cpp ] + [ compile libs/preprocessor/test/slot.cpp ] + [ compile libs/preprocessor/test/tuple.cpp ] + ; + + test-suite rational + : [ run libs/rational/rational_example.cpp ] + [ run libs/rational/rational_test.cpp unit_test_framework ] + ; + + + + compile libs/timer/timer_test.cpp ; + + test-suite tokenizer + : [ run libs/tokenizer/examples.cpp test_exec_monitor ] + [ run libs/tokenizer/simple_example_1.cpp ] + [ run libs/tokenizer/simple_example_2.cpp ] + [ run libs/tokenizer/simple_example_3.cpp ] + [ run libs/tokenizer/simple_example_4.cpp ] + [ run libs/tokenizer/simple_example_5.cpp ] + ; + + test-suite tuple_suite # !!! + : [ run libs/tuple/test/tuple_test_bench.cpp test_exec_monitor ] + [ run libs/tuple/test/io_test.cpp test_exec_monitor ] + ; + + + + diff --git a/status/borland_logo.gif b/status/borland_logo.gif new file mode 100644 index 0000000000..0165fb44ef Binary files /dev/null and b/status/borland_logo.gif differ diff --git a/status/compiler_status.html b/status/compiler_status.html new file mode 100644 index 0000000000..09ba3c3c3d --- /dev/null +++ b/status/compiler_status.html @@ -0,0 +1,247 @@ + + + + + + +Boost Compiler Status Report + + + + + + + + + + + + + +
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+ +

Compiler Status Tables

+ +

Compiler Status +Summary (on SourceForge) of Boost regression test results.
+Introduction
+Understanding the Tables
+Acknowledgements

+ +

Introduction

+ +

Will all Boost libraries work with your compiler?  +Unfortunately, the answer is "it depends". See the +Compiler Status Summary +to see exactly what works and what doesn't.

+ +

Boost libraries rely on modern C++ features such as templates +and the C++ Standard Library.  Most modern compilers support +those major features fairly well. But even today, years after the +adoption of the C++ Standard, some compilers still don't support +important minor features like partial template specialization.

+ +

Boost library authors often expend a great deal of effort +trying to work around compiler deficiencies.  Nevertheless, +some libraries will not compile at all with certain compilers or +may have crippled functionality.  Even if the current +release of a compiler supports a boost library, older versions of +the compiler may not work properly.

+ +

Boost releases are run through regression +tests which +automatically generates Compiler Status Tables for various +platforms. Unless otherwise indicated, the C++ Standard Library +implementation is the one shipped with the compiler.

+ +

Warnings:

+ +
    +
  • These tables are not a good indication of a +particular compiler's compliance with the C++ Standard.  The +Boost libraries often contain workarounds which mask compiler +deficiencies.
    + 
    • +
  • Some regression tests are run only occasionally, and so are relatively + out-of-date.  Check the date for each table.
    • +
+ +

The +Compiler Status Summary +includes table summaries for specific releases, as well as table summaries for +recent CVS snapshots. Release +tables are identified by the release number appended to the table name. CVS +snapshot tables do not have a release number appended.

+ +

The CVS +code is being updated several times a day, so it may contain bug fixes, compiler +workarounds, new features, and even whole new libraries. It may be unstable, +however.

+ +

Understanding the Tables

+ +

A table might look like this:

+ +
+

Run Date: 21 Sep 2001 15:31 GMT

+

System Configuration: Microsoft Windows 32bit 

+ + + + + + + + + + + + + + + + + + + +
ProgramTest
+ Type		BelchFire
+ Rev 5280		WorkHorse
+ 5.3
libs/foo/test/foo_test.cppcompilePassPass
libs/bar/bar_test.cpprunFailPass
+
+ +

The Run Date is important because the regression tests +which create the status tables are run asynchronously, and thus +may not represent the most current Boost release.

+ +

The Program column identifies the actual source file +for the test.  Each row in the table represents a different +test.

+ +

The Test Type column identifies +the type of test performed:

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Test TypeActionRequired to PassDescription and Use
compilecompile onlyCompiler returns 0.Verify that a source file will compile correctly, but + without any attempt to link or execute.  Used when + factors such as possible object library unavailability + make a run test impractical.
compile-failcompile onlyCompiler must return non-zero.Verify that a source file fails to compile. Used to + verify that an expected compile-time error was detected.
linkcompile, linkBoth compiler & linker return 0.Verify that a source file will compile and link + correctly, but without any attempt to execute the result.  + Used when factors such as possible data file + unavailability make a run test impractical.
link-failcompile, linkEither the compiler or linker must return non-zero.Verify that a source file fails to compile and link. + Used to verify that error detect which depends on + unresolved externals works correctly.
runcompile, link, executeCompiler, linker, and executable must all return 0.Verify that a source file compiles, links, and the + resulting program executes correctly (as indicated by a + zero return code.)  This is the primary test type + for most uses.
run-failcompile, link, executeBoth compiler and linker must return 0, and the + executable must return non-zero.Verify that a source file compiles and links + correctly, and that execution of the resulting program + detects some error.  Used to verify runtime error + detection code works properly.
+ +

Each remaining column in the table represents the individual +compiler indicated. Unless otherwise indicated, the C++ Standard +Library implementation is the one shipped with the compiler. A Pass +entry indicates success for the indicated Test Type, while +a Fail entry indicates +failure. See Required to Pass in the above table for specifics.

+ +

When possible, Fail entries are linked to +error messages indicating the reason for the failure. Note that the web page +containing error messages may be as much as one megabyte in size.

+ +

Acknowledgements

+ +

The compiler status tables have been prepared with resources +donated by a number of individuals, educational institutions, and +companies. Boost would like to thank them for their support.

+ + + +

Note, however, that Boost does not endorse any product or +service, nor does Boost guarantee that some or all of its +libraries work with any of the products or services mentioned +above.

+ +
+ +

Revised +22 January 2004

+ + + diff --git a/status/explicit-failures-markup.xml b/status/explicit-failures-markup.xml new file mode 100644 index 0000000000..445ad11e6b --- /dev/null +++ b/status/explicit-failures-markup.xml @@ -0,0 +1,5157 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The compiler does not support features that are essential for the library. + + + + + + + + The toolset is not supported by Boost.Regex. + + + + + + + + + + + + The test fail with ICE, but the exact reason for ICE is not + known. A minimal example of casting any to reference type + seem to work. Anyone interested in using this functionality + with msvc is suggested to do additional testing. + + + + + + + + + + + + + + + Compilers need to support partial template specialization + to work with zero length arrays. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The test would (most likely) compile and run properly if the workaround + syntax .to_container( c ) was applied to all list_of() expressions. + + + + + + + + + + + + + + + + + + + + This test could probably be made to work if somebody with knowledge + about the compilers would submit a patch. + + + + + + + + + + + + The test would (most likely) compile and run properly if the workaround + syntax .to_container( c ) was applied to all list_of() expressions. + + + + + + + + The test could probably be made to work if somebody submitted a patch. + + + + + + + + + + + + + + + + + + + + + The test would (most likely) compile and run properly if the workaround + syntax .to_container( c ) was applied to all list_of() expressions. + + + + + + + + + + + + + + + + + + + The test depends on Boost.Pointer Container which probably does not work for + this compiler. + + + + + + + + + + + + The test depends on Boost.Pointer Container which probably does not work for + this compiler. + + + + + + + + + + + + The test depends on Boost.Pointer Container which probably does not work for + this compiler. + + + + + + + The test does not work for + this compiler. + + + + + + + + + + The test depends on Boost.Tuple which probably does not work for + this compiler. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This failure is caused by Boost.Function. + + + + + + + + + + + + + + This failure is caused by a bug in the compiler triggered by the + use of the debug flag '-gall'. It has been reported to the + compiler vendor. + + + + + + + + + + + + + + This failure is only present in release mode and is caused by /OPT:ICF. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Long double NaN's are apparently handled incorrectly on this platform. + + + + + + + + + + + + + + + This failure is due to NaNs trapping. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The serialization library does not support this compiler. + + + + + + + + XML serialization is not supported on this compiler. + + + + + + + + + The serialization library does not support this compiler. + + + + + + + + XML serialization is not supported on this compiler. + + + + + + + + + + + + + + + + + + + + + + + + + These are strange runtime failures for + which there is no obvious explanation. Later versions of the + Intel compiler (eg:8.0) seem to have resolved the issue. + + + + + + + + + + + + + + + + + + + + + + + + + + + For some reason Code Warrior has difficulty compiling some of the + input code. This may be related to limitations of locale handling, + but it's unclear at this time (2005-May-21). + + + + + + + + + + + + + + + + + Some older compilers are confused by the template code here. + These are new features to date-time in 1.33 and there is no + plan to backport to these non-compliant compilers. + + + + + + + + + + + + + + + Some older compilers are confused by the template code here. + These are new features to date-time in 1.33 and there is no + plan to backport to these non-compliant compilers. + + + + + + + + + + + + + + + Some older compilers are confused by the template code here. + These are new features to date-time in 1.33 and there is no + plan to backport to these non-compliant compilers. + + + + + + + + + + + + + + + Some older compilers are confused by the template code here. + These are new features to date-time in 1.33 and there is no + plan to backport to these non-compliant compilers. + + + + + + + + + + + + + + Some compilers are confused by the template code here. + These are new features to date-time in 1.33 and there is no + plan to backport to these non-compliant compilers. + + + + + + + + + + + + + + + + + Some older compilers are confused by the template code here. + These are new features to date-time in 1.33 and there is no + plan to backport to these non-compliant compilers. + + + + + + + + + + + + + + + + + + Some older compilers are confused by the template code here. + These are new features to date-time in 1.33 and there is no + plan to backport to these non-compliant compilers. + + + + + + + + + + + + + Some older compilers are confused by the template code here. + These are new features to date-time in 1.33 and there is no + plan to backport to these non-compliant compilers. + + + + + + + + + + + + Some older compilers are confused by the template code here. + These are new features to date-time in 1.33 and there is no + plan to backport to these non-compliant compilers. + + + + + + + + + + + + + Some compilers are confused by the template code here. + These are new features to date-time in 1.33 and there is no + plan to backport to these non-compliant compilers. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + These compilers are unfortunately able to correctly compile the + new format-based input-output code for date time. Suitable, but + less flexible, alternatives are available on these compilers. + + + + + + + + + + + + + + These compilers are unfortunately able to correctly compile the + new format-based input-output code for date time. Suitable, but + less flexible, alternatives are available on these compilers. + + + + + + + + + + + + + + These compilers are unfortunately able to correctly compile the + new format-based input-output code for date time. Suitable, but + less flexible, alternatives are available on these compilers. + + + + + + + + + + + + + These compilers are unfortunately able to correctly compile the + new format-based input-output code for date time. Suitable, but + less flexible, alternatives are available on these compilers. + + + + + + + + + + + + + These compilers are unfortunately able to correctly compile the + new format-based input-output code for date time. Suitable, but + less flexible, alternatives are available on these compilers. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + There is apparently a bug in Borland library + such that std::local_time and std::gmtime are + returning a time that's 1 hour ahead GetSystemTimeAsFileTime + during DST. This is a rather serious problem in that + some of the date-time clock interfaces will give the wrong + current time. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The sun 5.8 compiler and standard library have a problem with + the classic facet which causes some of the io tests for date-time + to fail. Overall this should not affect most uses of the library. + + + + + + + + + The STLPort standard library has issues with some custom + facet settings causing an unexplained failure in these + facet tests. + + + + + + + + + + + The STLPort standard library has issues with the handling + of the classic facet which causes some fo the i/o tests + for date-time to fail. Overall this should not affect + most uses of the library. + + + + + + + + + + + + MSVC 7.1 with its standard library passes all date-time tests. + For some reason when paired with stlport a few widestream + io tests do not format output correctly. Overall this should + not affect most uses of the library. + + + + + + + + + + Although these tests compile, the execution aborts for + an unknown reason. Note that sometimes the excution is + ok on cw-9_4. This may be fixable if someone + can track down the source of the problem. + + + + + + + + + + These tests are failing with the beta2 version of VC_8. At least + one of them is directly a result of the new VC_8 standard library + restricting the year value in a tm struct to be positive (that is + greater than year 1900). This is a change from VC7_1 and Microsoft + is considering removing this restriction. + + + + + + + + + These tests are for serialization which has been marked as unusable. + The issue was specifically noted on + AIX version : 5.2.0.41 using IBM XL Version 8.0.0.0. + + + + + + + + + + + The failure is caused by a standard library bug. It doesn't + support user defined facets which are not default + constructible. This has been reported to the compiler vendor. + + + + + + + + + + + These tests rely on the ability of an std::map to be + instantiated on an incomplete type. The Rogue Wave + version 2.2 and higher does not allow this. + + + + + + + + The failure is caused by a standard library bug. It doesn't + support user defined facets which are not default + constructible. This has been reported to the compiler vendor. + + + + + + + + + + + The failure is caused by a standard library bug. The end-of-stream + istream iterator can only be constructed when the istream iterator + has been instantiated with char as the character type. This has + been reported to the compiler vendor. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The exact reason of this (linker related) bug is unresearched. The test passes + on some environments. The test was found to fail on a platform whit a german + version of the compiler. + + + + + + + + + + + + + + + + + + + + + + + + + + + Due to standard library bugs this configuration is not supported by + the most recent version of the library. + + + + + + Due to standard library bugs, this version is not supported. + More recent version of the library should work OK. + + + + + + + fstream for this compiler has serious problems and is not supported + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The library does not support wide paths on this compiler because + it does not support SFINAE. + + + + + + + + + + + + + + + These failures are reported to be fixed in Sun's + next compiler release. + + + + + + + + + + + This compiler does not support the Boost.Range + library, on which Boost.Foreach depends. + + + + + + + + + + + + + + + + + + + + + + + + + This compiler does not support detection of + const rvalues. + + + + + + + + + + + + + + This compiler does not support detection of + rvalues. + + + + + + + + + These compilers cannot handle BOOST_FOREACH + in a template, where the collection type + depends on a template parameter. + + + + + + + + This failure is because the Boost.Range extension + mechanism is broken on these compilers. It requires + ADL which these compilers do not support. + + + + + + + is_base_and_derived<> is broken on this compiler, but + the problem can be worked around by specializing + boost::foreach::is_noncopyable<> for collection + types that are noncopyable. + + + + + + + + + + The failure is caused by a standard library bug: the + iostream components fail to handle ios::internal + flag. + + + + + + + + + + + + + + + + + + + + + + + hash_value is not overloaded for arrays for older versions + of Visual C++. There is a work around so that + boost::hash<T[N]>, boost::hash_combine and boost::hash_range + work. + + + + + + + + + + + + + + + On this compiler the hash function is returning the same value + for std::numeric_limits<long double>::max(), + std::numeric_limits<long double>::max() / 2 and + std::numeric_limits<long double>::max() * 3 / 4. + This suggests the hash function isn't taking into account the + full range of long double - it might be + converting it to a double. This won't cause + anything to break, but means that the hash function isn't + as good as it should be for long doubles. + + + + + + + + On this platform both std::frexp and std::ldexp treat long + doubles as longs, so the hashing algorithm does the same. + This means that you'll get very bad results for long doubles + that can't be represented by doubles. + + + + + + + + + + These examples only work on compilers with support for ADL. + It is possible to work around this, but I wanted to keep the + example code as clean as possible. + + + + + + + + + It appears that Borland doesn't find friend functions defined + in a class by ADL. This is easily fixed but this example is + meant to show the typical way of customising boost::hash, not + the portable way. + + + + + + + + + The test demonstrates a Borland bug - functions that aren't + in a namespace don't appear to be found by ADL. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This failure is due to a problem with partial ordering + of class template partial specializations. + + + + + + + + + The test fails due to compile error in relaxed_heap.hpp. + The compile error is likely caused by a compiler bug. + + + + + + + The test fails from completely unknown reason -- it might + be compiler bug, or compiler misconfiguration or testing + system bug. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This is gcc bug 26526, and is fixed in later releases. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + compiler can't compile "windows.h" in strict mode + + + + + + + + The failure reflects a problem with the build system: the zlib + object files are generated in the wrong directory. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + I'm not sure whether CodeWarrior is correct to report that the member + in question is inaccessible; however, when the member is made public + an internal error occur that I have not been able to fix, so for + now the question is moot. + + + + + + + Memory mapped files are not supported in QNX Neutrino version 6.3.0. + + + + + + + Fails to compile on some installations but not others; may + depend on which compiler updates have been installed + + + + + + + These six tests pass individually but cause a compiler stack overflow + when compiled as a group + + + + + + + No bzip2 support on the testing machine and no way to + disable this test with BBv2 at present. + + + + + + + The test fails at runtime for unknown reasons. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The compiler is not supported by the library due to an + utterly broken templates support. + + + + + + + + + + + + This failure is caused by a deficient SFINAE implementation; the bug + was fixed in the next major compiler version (CodeWarrior 9.x). + + + + + + + + + + + + This failure is caused by a deficient SFINAE implementation. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This failure is caused by a problem with recursive templates and default template parameters, fixed in Update 2. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This failure is caused by a lack of compiler support for template template + parameters. + + + + + + + + + + + + + This is an advanced functionality that hasn't been ported to the deficient + compilers (yet). Patches are welcome! + + + + + + + + + This is an advanced functionality that hasn't been ported to the deficient + compilers (yet). Patches are welcome! + + + + + + + + + This is a regression in the gcc 4.1 series that will be + fixed in gcc 4.1.2. See bug + #28088 for details. + + + + + + + This is reported to be fixed in the next Sun + compiler release. + + + + + + + When compiling this test, aCC6 runs out of memory. The HP + compiler group is aware of this issue and is working on the fix. + + + + + + + + + + + + +

+ This library has never worked [on Borland 5.5.1 and 5.6.4], and the only tests + that 'pass' are compile-fail tests failing for the wrong reasons! +

+ + + + + + + + + + + + Known error in MSVC. see + +http://boost-consulting.com/boost/libs/multi_index/doc/compiler_specifics.html#msvc_60 +for more information. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The VC++ 6.0 backend runs out of internal resources while + trying to process the Comeau output for this library; + Comeau Computing has been asked about a solution. + On the other hand, Comeau 4.3.3 with VC++ 7.0 backend works + fine. + + + + + + + + + + + + + + + + + + + This error shows when using the dynamic version of the STLport + library. The problem is reportedly fixed in STLport 5.0 (in beta + stage as of this writing.) + + + + + + + Boost.Serialization is not supported on this platform. + + + + + + + + + This test fails due to limitations of the template + instantiation model used in the testing environment + (-timplicit_local) resulting in erroneous duplication of some + function-static variables. The test passes with other template + instantiation models. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The test is exposing the following known error of Sun Studio 11: + overload resolution fails if + a) some class has a conversion operator to a reference to + a built-in type, and + b) overload resolution involves a user-defined operator as well + as a built-in operator, and + c) the built-in operator takes the result of the conversion + mentioned in a) as an operand. + A fix will be reportedly included in patch no 6 of Sun Studio 11. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This error shows when the code has become too complex for the + compiler to handle. The problem has no relationship with the + functionality being tested, which in fact does work for + MSVC++ 7.0. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + msvc 6 compiler failure. The facility being tested conflicts the the + compiler in a fundamental way and cannnot be worked around. + + + + + + + + msvc 6 compiler failure. The facility being tested conflicts the the + compiler in a fundamental way and cannnot be worked around. + + + + + + + + + This failure appears when STLPort is built and used as a DLL with msvc 6. + STLPort suggests that the next version of STLPort(5.0) will include a workaround + for this problem. + + + + + + + + The library is believed to work in this configuration if compiled against + Spirit 1.6. The latter is not provided by the particular testing + environment these tests have been run in. + + + + + + + + + + + + + + + + + + + + All tests that serialize derived pointers currently fail with Metrowerks compilers. + + + + + + + + + + + + + + + + + + + + + + + + + + + This is caused by a compiler bug in this particular version, but not present + in version thereafter. The compiler has some difficulties resolving operators + to methods in the archive classes. This can be worked around by calling the + operator directly, and such a work around is already present in library code. + This test demonstrates that this can happen in user code. + + + + + + + + + The CW compilers have problems with the static construction idiom used to + implement the type registration in the Boost.Serialization library. In many + cases CW specific work arounds are implemented in the library but this one + is not immediately solvable. There is a user work around possible, please + contact the library developers on the Boost list for information on the + work around if needed. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The variant library is not supported for this compiler version. + Therefore serialization of variants doesn't work. + + + + + + + + + + + + + + + The compiler fails with an error supposedly related to std::fpos<>::_Stz from the + <iosfwd> header. It is not known what causes the compiler to instantiate this + field and what causes the instantiation to fail. + + + + + + + + This failure is caused by an unresearched compiler bug; the + conditions under which the bug manifests itself seem to be + uncommon, however, and the static version of this same test + builds and runs correctly. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+ Historically, Spirit supported a lot of compilers, including (to some + extent) poorly conforming compilers such as VC6. Spirit v1.6.x will be + the last release that will support older poorly conforming compilers. + Starting from Spirit v1.8.0, ill conforming compilers will not be + supported. If you are still using one of these older compilers, you can + still use Spirit v1.6.x. +

+

+ The reason why Spirit v1.6.x worked on old non-conforming compilers is + that the authors laboriously took the trouble of searching for + workarounds to make these compilers happy. The process takes a lot of + time and energy, especially when one encounters the dreaded ICE or + "Internal Compiler Error". Sometimes searching for a single workaround + takes days or even weeks. Sometimes, there are no known workarounds. This + stifles progress a lot. And, as the library gets more progressive and + takes on more advanced C++ techniques, the difficulty is escalated to + even new heights. +

+

+ Spirit v1.6.x will still be supported. Maintenance and bug fixes will + still be applied. There will still be active development for the back- + porting of new features introduced in Spirit v1.8.0 (and Spirit 1.9.0) + to lesser able compilers; hopefully, fueled by contributions from the + community. For instance, there is already a working AST tree back-port + for VC6 and VC7 by Peder Holt. +

+ + + + + + + + + + + + + + + + This failure is caused by a compiler bug that manifests itself in the + particular environment/hardware configuration the test has been run in. + You may or may not experience this issue in your local setup. + + + + + + + + + + + + + + + + + + + + + + + + + + + + This compiler is not supported. + + + + + + + + + + + + + + + + Native mode is not supported for this compiler. + + + + + + + + + Emulation mode is not supported for this compiler. + + + + + + + + + + + The feature is not supported by this compiler. + + + + + + + The feature is not supported by this compiler. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This failure is caused by a compiler bug. Templated operators + that combine different iterators built with iterator_facade or + iterator_adaptor may be present in an overload set even when those + iterators are not interoperable. The usual result is that error + messages generated by illegal use of these operators will be of + lower quality. + + + + + + + + + + + + + + + This failure is caused by a compiler bug. + is_convertible<T,U>::value may be true for unrelated + iterators T and U + (including many of the Boost specialized adaptors) which use + enable_if_convertible to restrict the applicability + of converting constructors, even when T is not + convertible to U because instantiating the + conversion will cause a compilation failure. + + + + + + + + + + + + + This failure is caused by a compiler bug. The + compiler tends to drop const-ness and as a result + some indirect_iterators will have pointer and + reference members of T* and T& that should + have been T const* and T const&. + + + + + + + + + + + + + + + This test fails with a link error that is most likely + a STLport issue. As STLport 4 is officially unsupported + there is no known resolution. + + + + + + + + For some currently unknown reason, with aCC6, this test can be compiled + only in strict ansi mode. Since on HP-UX/aCC6 boost testing is done in the + default compilation mode, this test fails to compile on this platform. + + + + + + + + + + + + + + + + + + + + + + There appears to be a bug in gcc's std::exp (long + double) on this platform. + + + + + + + + std::numeric_limits>long double<::infinity() is apparently + broken in this compiler: it's filed as bug 6347520 with Sun. + + + + + + + + Not yet diagnosed the precise reason these tests give bad results. + + + + + + + std::numeric_limits>long double<::infinity() is apparently + broken in this compiler. + + + + + + + Incomplete std::complex support make these tests pointless + (the complex trig functions are absent). + + + + + + + + + + These have yet to fully investigated, but the code is known + to compile with more conforming compilers, probably workarounds + are possible if someone is prepared to invest the time. + + + + + + + + + + This compiler is not sufficiently conforming to compile these tests. + + + + + + + Appears to be a bug in STLport's complex abs function, but needs more investigation. + + + + + + + This appears to be a problem with STLPort's abs function: the issue only effects the + test code. A workaround should be possible but users should be encouraged to use + STLport 5 instead. + + + + + + + + No true long double standard lib support causes these tests to fail. + + + + + + + + + + This is Intel issue 409291, it should be fixed from + compiler package l_cc_c_9.1.046 onwards. + + + + + + + + + + + + + + + This failure appears to be caused by a compiler bug: please note + that the issue only effects the test suite, not the library itself. + A workaround is available but breaks other compilers. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This test ensures the inclusion property of interval + arithmetic is available for built-in floating-point types + float and double. If the test + fails, interval<float> and + interval<double> should not be used + on this compiler/platform since there will be no + numerical guarantee. + + + + + + + + + This compiler has some problems with name looup / overload resolution. + + + + + + + + + + + + + + + + + + + This failure is unresearched. Presumably, the problem + is that the abs function is not available in the "right" + namespace with this compiler/stdlib combination. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This old version of the stlport library causes the BOOST_NO_STDC_NAMESPACE + macro to be set. But this conflicts with the requirements of the library. + + + + + + + + + + + + + + + + + The failure is caused by standard library deficiencies + -- it lacks the basic_string class template and + the <locale> header. + + + + + + + + + + + + + + + + + + + + + + + + + + + The failures are caused by problems + with std::locale implementation + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The failures are caused by compiler bug: it's not possible to + explicitly pass template arguments to member template function. The + failure is serious and makes one of the primary interfaces + unusable. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Several compiler bugs were worked around in order to get + this test to pass, so it could be considered to be only + partially working. However, the library's macro system, + which is really being tested here, does work on this + compiler, which is why we worked around the failures. + Please see the test's + source file for details. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + These compilers do not support SFINAE, so are expected to + fail this test. + + + + + + + + + Borland does not support this feature. A compatibility syntax + might be developed later on. + + + + + + + + + + + This feature generally requires advanced compiler + features not supported by these compilers. It might + be possible to work around the issue on VC6/7, but + at this time no such workaround has been done. + + + + + + + + This is old and should not be tested any more. + + + + + + + + + + + + + + + These test failure are reported to be under investigation + at Sun's compiler labs. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The error is due to problems in the standard library implementation. + It should be fixed in newer versions of the compiler. + + + + + + + The error is due to problems in the standard library implementation. + It should be fixed in newer versions of the compiler. + + + + + + + This error seems to be a bug the compiler. Please submit a + patch. + + + + + + + + + + This error seems to be a bug the standard library. Please submit a + patch. + + + + + + + + This test fails because the test ptr_vector fails. Please see the note + for that test. + + + + + + + + For sun the problem is that insert(iterator,range) + is not available due to partial ordering errors (the core library remains usable). + For codewarrior the problem is at least std::auto_ptr overloads (the core library remains usable). + + + + + + + + For sun the problem is that insert(iterator,range) + is not available due to partial ordering errors (the core library remains usable). + For codewarrior the problem is at least std::auto_ptr overloads (the core library remains usable). + + + + + + + + For sun the problem is that insert(iterator,range) + is not available due to partial ordering errors (the core library remains usable). + For codewarrior the problem is at least std::auto_ptr overloads (the core library remains usable). + + + + + + + + + For hp, this compiler bug is insignificant. + For sun the problem is that transfer(range,ptr_map) + is not available due to partial ordering errors (the core library remains usable). + For codewarrior the problem is not known so please submit a patch. + + + + + + + + For sun the problem is that transfer(range,ptr_map) and + insert(range)code> + is not available due to partial ordering errors (the core library remains usable). + For codewarrior the problem is at least std::auto_ptr overloads (the core library remains usable).. + + + + + + + This cause of this problem is unknown. Please submit a patch. + + + + + + + For sun the problem is due to Boost.Test. + + + + + + + Seem like a bug in the compiler. Please submit a patch. + + + + + + + Seem like a bug in the compiler. Please submit a patch. + + + + + + + + + + + + + + + + + + The library fails to compile because of an error in the C++ + standard library implementation on this platform. It incorrectly + assumes that fpos_t is of an integral type, which is not always + the case. This is fixed in a later release. + + + + + + This compiler seems to be having trouble digesting + Boost.Tuple. Until it can handle Boost.Tuple there's + little chance it will handle Boost.Python + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The problems with GCC 2.x only occur when C++ exceptions are thrown and + the framework catches them, which happens quite often in the tests. + So technically GCC 2.x is usable if you're careful. + + + + + + + + + + + + + + This test assumes standard-compliant dependent template name lookup which + is performed by aCC6 only in strict ansi mode. Since on HP-UX/aCC6 boost + testing is done in the default compilation mode, this test fails to + compile on this platform (in strict ansi mode, it compiles and succeeds). + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Reported to Intel as issue 409291, and confirmed + as a problem. Probably this relates to a specific + Linux-Kernal or GLibC version. + + + + + + Test fails with ranlux*_O1 RNGs when saving and recalling the state due to a bug in the + double to string conversion. The problem has been reported to QNX as PR29252. + + + + + + This test fails because of limitations in the system assembler + version used by GCC. It most probably would pass if the test + were split into multiple source files. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + For most compilers this is due to problems + with built-in arrays (notably char arrays) and operator==() + and operator!=() for iterator_range. Thus, not using built-in arrays + fixes the problem. + + For other compilers it is simply a bug in the standard library. + + + + + + + + This test probably fails because it uses built-in arrays. So do expect these + functions to work in normal code. + + + + + + + + + + + The string functionality is expected to work if + the user employs std::string and stays away from built-in + arrays. + + + + + + + + + + + + + + For most compilers this is due to problems + with built-in arrays (notably char arrays) and operator==() + and operator!=() for iterator_range. Thus, not using built-in arrays + fixes the problem. + + + + + + + At the time of release I couldn't figure out why this was failing. + Anyway, the failure is not very important; also, the well-definedness of + "singularity" of an iterator range is likely to change. + + + + + + + + The test requires support for Argument Dependent Lookup (ADL) + which the compiler in question does not provide. + + + + + + + + + + + + + + + + + + + + + + + No Wide character support on this platform. + + + + + + + + No Wide character support on this platform. + + + + + + + + This test requires features that are unsupported by Como: + use and building of dll's mainly. + + + + + + + + + This test requires features that are unsupported by Como: + use and building of dll's mainly. + + + + + + + GCC on tru64 appears not to cope with C++ exceptions + thrown from within threads. + + + + + + + + + + + + + + + + + + + + + + + + + This test fails because a dependency (Boost.Program Options) doesn't build with this compiler. + + + + + + + + + + + + + + + + There appears to be a linker bug that prevents these + projects from building, see http://qc.borland.com/wc/qcmain.aspx?d=32020. + + + + + + + + + + + + + + + + There appears to be a linker bug that prevents these + projects from building, see http://qc.borland.com/wc/qcmain.aspx?d=32020. + + + + + + + Test fails due to unresilved externals from STLport: appears to be + an STLport bug. + + + + + + + + + + These tests pass when run directly from the command line, + but fail when run under the regression test script. + The issue has never been fully pinned down, but appears + to be related to how long the tests take to run. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + A runtime failure of this test indicates that this platform + dynamically links code in a manner such that under + certain circumstances more than one instance of a + header-defined static class member can exist at runtime. See + here + for more information. + + + + + + + A runtime failure of this test indicates that this platform + statically links code in a manner such that under + certain circumstances more than one instance of a + header-defined static class member can exist at runtime. See + here + for more information. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This test runs without problem on Borland compilers, + which means the static assertion is not being caught. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The test verifies that Boost.Test detects division by + zero. Division by zero has an undefined result + on PowerPC processors. The compiler has to emit extra + code to assert that the divisor isn't zero. + + Compiler options -fno-trapping-math and -fnon-call-exceptions + might affect this. However, in default configuration + no check is done, and division by zero is not detected. + + + + + + + + The test appears to test that failed assertion result + in non-zero exit status. That seems to be not the + case, for unknown reasons. + + + + + + + + + + + + + + + + + + + + + + + + This failure is caused by a conflict between the compiler + and the testing environment: the tests are run on a platform with + too recent version of glibc, which is not currently + supported by the compiler vendor (Intel). + + If you are having the same problem and really want to make + things work, renaming strol symbol in the + compiler's static runtime library (libcprts.a) to + something else is known to resolve the issue. + + + + + + + + + + + + + + + + When a thread ends, tss data needs to be cleaned up. This process + is mostly automatic. When threads are launched by the Boost.Thread API + cleanup is handled by the library implementation. For threads, launched + by the native operating system API it is not possible to get this cleanup + on every compiler/platform. A warning (error) will be present in this case, + which cleary states this fact. It is recommended to start threads only + by means of the Boost.Thread API if you need to avoid the leaks that appear + on the end of the thread. If this is not possible the cleanup can be invoked + from user code before the process actually ends. For library implementors + this means to call these functions during library initialization and + finalization. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This failure is caused by the lack of compiler support for class template + partial specialization. A limited subset of the tested functionality is + available on the compiler through a user-side workaround (see + + http://www.boost.org/libs/type_traits/index.html#transformations for + details). + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This functionality is available only on compilers that implement C++ Core Language + Defect Report 337. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The Type Traits library is broken when used with Sunpro-5.3 and the + argument to the template is an array or function type. Most other argument types + do work as expected: in other words the functionality is limited + with this compiler, but not so much as to render the library unuseable. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The Type Traits library is broken when used with Sunpro-5.8 and the + argument to the template is a function type. Most other argument types + do work as expected: in other words the functionality is limited + with this compiler, but not so much as to render the library unuseable. + + + + + + + + + + + + + + + Older versions of MWCW incorrectly align pointers to member functions + (they use 12-byte boundaries, rather than a power-of-2 boundary), + leading to alignment_of / aligned_storage + to fail with these types on this compiler. + + + + + + + + + + + VC6/7 has a buggy using declaration syntax which + basically makes it impossible to implement the + namespace forwarding that this library relies upon. + See KB article 263630 here: http://support.microsoft.com/default.aspx?scid=kb;en-us;263630 + + + + + + Metrowerks Codeworrier has partial TR1 support built in + which conflicts with this implementation. Porting to this + compiler is almost certainly possible, but will require some + work by someone who has this compiler. + + + + + + + + + + + + + + + + These tests test features that are not supported in the + current Boost implementations of TR1 components, they will + currently fail on all compilers, unless that compiler has + native TR1 support. + + + + + + + + + + + + + These tests fail on this platform due to a lack of + wide character support. + + + + + + + + + These tests fail on this platform due to incomplete + wide character support. + + + + + + + + + These tests fail on this platform due to incomplete + wide character support. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Support for Borland C++ in the various TR1 libraries is pretty + poor (due to numerous compiler bugs sadly). The TR1 concept + checks are *very* strict, and are expected to fail with this + compiler. In addition most of the type_traits tests fail + whenever debugging support is turned on with an internal + compiler error. More conservative uses are more likely to succeed + with this compiler however. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Support for Borland C++ in the various TR1 libraries is pretty + poor (due to numerous compiler bugs sadly). The TR1 concept + checks are *very* strict, and are expected to fail with this + compiler. More conservative uses are more likely to succeed + with this compiler however. + + + + + + + + + + These tests fail on this platform due to a recuring GCC bug. + + + + + + + + + + + + These tests fail due to a known compiler bug + that is fixed in more recent GNU compiler releases. Users are + very unlikely to encounter this as a real problem + in practice. + + + + + + + + + + + + + These tests fail due to a known compiler bug + that is fixed in more recent releases. Users are + very unlikely to encounter this as a real problem + in practice. + + + + + + + + + + + + + + + + + + + + + + + + These tests fail due to a known compiler bug + that is fixed in more recent releases. This + functionality may not be usable with this compiler. + + + + + + + + + + + These tests fail due to a known stdlib bug + that has been reported to the vendor. + + + + + + + + + + + + + + + + + + + + + This failure is caused by the lack of compiler support for class template + partial specialization. A limited subset of the tested functionality is + available on the compiler through a user-side workaround (see + + http://www.boost.org/libs/type_traits/index.html#transformations for + details). + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This functionality is available only on compilers that implement C++ Core Language + Defect Report 337. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + The Type Traits library is broken when used with Sunpro-5.3 and the + argument to the template is an array or function type. Most other argument types + do work as expected: in other words the functionality is limited + with this compiler, but not so much as to render the library unuseable. + + + + + + + + + + + + + + + + + + + + + The Type Traits library is broken when used with Sunpro-5.8 and the + argument to the template is a function type. Most other argument types + do work as expected: in other words the functionality is limited + with this compiler, but not so much as to render the library unuseable. + + + + + + + + + These failures appear to represent a genuine issue with the + Boost.Random library that has yet to be addressed. + + + + + + + + + + + These failures are completely spurious: they're caused by the tests + being run with bjam -j2 and the post-processing not coping with the + resulting output. These failures should clear if these tests + are re-run at some point in the future. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This library is almost unusable with VC7 due to name lookup issues. + + + + + + + Older versions of MWCW incorrectly align pointers to member functions + (they use 12-byte boundaries, rather than a power-of-2 boundary), + leading to alignment_of / aligned_storage + to fail with these types on this compiler. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Compiler has a problem with BOOST_STATIC_CONSTANT in nested templates + inside class template specializations. + + + + + + + + + + + + + + + + + + + + + This failure is caused by an UNRELATED compiler bug resulted from the particular test strategy. + 'boost::none' DOES work correctly in this compiler. + + + + + + + + This failure is caused by a compiler bug (default-constructed scalar + types are not zero-initialized) that has been fixed in the latest + versions of the compiler (VC 7.1 and greater). + + + + + + + The test takes more that 30 minutes to compile and the + compilation is automatically killed. It is likely caused + by the compiler bug, but it unknown how much this + bug affects regular use of the operators library. Is it + also unknown if the test can be refactored so that + not to trigger this bug. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + This toolset isn't supported because of the used Spirit V1.8.x, which in turn is + not usable with this toolset. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + These compilers do not support class template partial + specialization. + + + + + + Boost.Fusion doesn't work on this compiler. + + + + + + This compiler doesn't support SFINAE / enable_if + + + + + + Digital Mars cannot seem to handle dependent default template parameters, + such as "template < class T, bool B = is_foo < T > ::value >" + + + + + + + + + + + + + This test fails only intermittently. + + + + The failure is caused by a problem in Boost code. The Boost developers are aware of + the problem and plan to fix it. + + + + The failure is caused by a compiler bug. + + + + The failure is caused by a compiler bug, which has been reported to the compiler + supplier (or is already known to them). + + + + The failure is caused by a standard library bug. + + + + The failure is caused by a standard library bug, which has been reported to the + standard library supplier (or is already known to them). + + + + The failure is probably caused by the test code, harness, or configuration. Thus, + it may not affect users of the library. + + + + The failure is serious and likely to prevent all use of this Boost library with this compiler. + + + + The failure is serious and likely to prevent all use of this Boost library with this + compiler. The failure is caused by a compiler bug, which has been reported to the compiler + supplier (or is already known to them). + + + + The failure is caused by a platform API bug. + + + + The failure is caused by a platform API bug, which has been reported to the platform API + supplier (or is already known to them). + + + + The failure is not serious and will not affect most users. The library degrades gracefully. + + + + This compiler's bugs are not supported by the library. + + + + Locales missing or adequately supported by this compiler. + + + + Missing or inadequate wchar/wstring/wstream support for this compiler. + + + + No std iterator traits for this compiler. + + + + Library has limited input/output support due to compiler inadequacies. + + + + No high precision clock for this platform. + + + + A bug in standard library prevents passing std::set from DLL to + application. A fixed <tree> header is available from + http://www.dinkumware.com/vc_fixes.html. + + + + Although the documentation from the Comeau website would make it appear + that windows DLL's are supported using the --windows option, after some + experimentation we have been unsuccessful in making dll configurations + work correctly. + + + + The failure is caused by a runtime limitation. Locale support is only + available with the static linked variant of the runtime. Generally + the dynamic linked variant is required when building dynamic modules, + DLL, so, etc. + + + + This failure is caused by a compiler bug with no known workaround. + Patches are welcome! + + + + This failure is caused by bugs in the standard library implementation and/or + bugs in the compiler. + + + + Unresearched failure -- please contact library developers for more + information about possible causes. + + + + The test fails due to unresearched issues. The library + developers are aware of this failure, but need help with + investigating/addressing it for future releases. + + + + The support for this deficient compiler will be dropped starting + from Boost 1.33.0 release. Please use one of the previous Boost + releases if you need the library to work on this compiler. + + + + This failure is caused by compiler bugs or limitations. Some advanced + or esoteric library features may be unavailable or only partially available. + This does not impact most common uses of the library. + + + + This failure is caused by a compiler bug. Certain code constructs that should + fail compilation are accepted by the compiler. This can mask some programming + errors, but does not impact the usability of the library. + + + + The failures are caused by the wrong handling of the + std::internal flag in the iostreams implementation of the + standard library used on that compiler/platform combo. Apart from that, + the format library works as expected. + + + + The failures are caused by the fact that the iword and pword arrays seem + to share the same memory area in the iostreams implementation of the + standard library used on that compiler/platform combo. As long as you + stay clear of iword and pword, the library should work ok. + + + + This failure occurs only when using shared libraries for this + compiler and platform, although the same programs should work + properly when using static libraries. This problem has not + been researched. + + + + Wide character support is disabled in the GNU Standard C++ library as + supplied on the QNX Neutrino version 6.3.0 distribution. + + + + This problem is due to the non-conforming STLport + implementation of vector's swap: it can be easily + reproduced with the following code snippet: + + typedef std::vector<int> vector_type; + typedef vector_type::reference reference_type; + + vector_type v1(4u, 1); + vector_type v2(7u, 0); + + reference_type ref = v1[2]; + int x = ref; + + std::swap(v1, v2); + BOOST_CHECK(v2[2] == x); // ok + v2[2] = 1 - v2[2]; + BOOST_CHECK(ref != x); // oops + + + diff --git a/status/explicit-failures.xsd b/status/explicit-failures.xsd new file mode 100644 index 0000000000..6c77750720 --- /dev/null +++ b/status/explicit-failures.xsd @@ -0,0 +1,99 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/status/index.html b/status/index.html new file mode 100644 index 0000000000..ef88d3195f --- /dev/null +++ b/status/index.html @@ -0,0 +1,9 @@ + + + + + +Automatic redirection failed, please go to +compiler_status.html. + + \ No newline at end of file diff --git a/status/intel_logo.gif b/status/intel_logo.gif new file mode 100644 index 0000000000..47f9ded887 Binary files /dev/null and b/status/intel_logo.gif differ diff --git a/status/kai_logo.gif b/status/kai_logo.gif new file mode 100644 index 0000000000..42defced07 Binary files /dev/null and b/status/kai_logo.gif differ diff --git a/status/ms_logo.gif b/status/ms_logo.gif new file mode 100644 index 0000000000..09dca73b9f Binary files /dev/null and b/status/ms_logo.gif differ diff --git a/status/notes.html b/status/notes.html new file mode 100644 index 0000000000..3ac028830b --- /dev/null +++ b/status/notes.html @@ -0,0 +1,54 @@ + + + + + + + +Win32 Regression Testing Notes + + + + +

Regression Testing Notes

+

Note 0

+

This test fails only intermittently.

+

Note 1

+

The failure is caused by a problem in Boost code. The Boost developer is +aware of the problem and plans to fix it.

+

Note 2

+

The failure is caused by a compiler bug.

+

Note 3

+

The failure is caused by a compiler bug, which has been reported to the +compiler supplier (or is already known to them).

+

Note 4

+

The failure is caused by a standard library bug.

+

Note 5

+

The failure is caused by a standard library bug, which has been reported to +the standard library supplier (or is already known to them).

+

Note 6

+

The failure is probably caused by the test code, harness, or configuration. +Thus it may not affect users of the library.

+

Note 9

+

The failure is serious and likely to prevent all use of this Boost library +with this compiler.

+

Note 10

+

The failure is serious and likely to prevent all use of this Boost library +with this compiler. The failure is caused by a compiler bug, which has been reported to the +compiler supplier (or is already known to them).

+

Note 14

+

The failure is caused by a platform API bug.

+

Note 15

+

The failure is caused by a platform API bug, which has been reported to +the platform API supplier (or is already known to them).

+

Note 16

+

The failure is not serious and will not affect most users. The library degrades gracefully.

+

Note 17

+

This compiler's bugs are not supported by the library.

+ + +
 
+ + + + diff --git a/status/win32-notes-map.txt b/status/win32-notes-map.txt new file mode 100644 index 0000000000..7fcc7be412 --- /dev/null +++ b/status/win32-notes-map.txt @@ -0,0 +1,187 @@ +// Notes map format: +// +// toolset/library-name/test-name,note# +// */library-name/test-name,note# +// toolset/library-name/*,note# +// */library-name/*,note# +// +// The * can only be used to indicate "all" - it can't select portions +// of a toolset or test name. +// +// Multiple notes can apply to the same test or library. For example: +// +// borland/random/random_test,2 +// borland/random/random_test,10 +// +// Note superscripts normally only appear if a test fails. If the note# +// is preceded by a minus sign, the note superscript will appear regardless +// of success or failure of the test. + +// All + +*/iterator/interoperable_fail,16 +*/iterator/is_convertible_fail,16 + +// Borland + +borland/array/array3,3 +borland/array/array4,3 +borland/concept_check/class_concept_fail_expected,3 +borland/random/random_test,2 +borland/function/function_arith_cxx98,3 +borland/function/function_ref_cxx98,3 +borland/function/lambda_test,3 +borland/function/lib_function_test,3 +borland/function/mem_fun_cxx98,3 +borland/function/std_bind_cxx98,3 +borland/function/sum_avg_cxx98,3 +borland/graph/*,3 +borland/iterator/interoperable_fail,2 +borland/iterator/is_convertible_fail,2 +borland/lambda/*,3 +borland/signals/signal_test,3 +borland/python/*,2 +borland/python/*,17 +borland/utility/enable_if_constructors,3 +borland/utility/enable_if_dummy_arg_disambiguation,3 +borland/utility/enable_if_lazy,3 +borland/utility/enable_if_lazy_test,3 +borland/utility/enable_if_member_templates,3 +borland/utility/enable_if_namespace_disambiguation,3 +borland/utility/enable_if_no_disambiguation,3 +borland/utility/enable_if_partial_specializations,3 +borland/variant/recursive_variant_test,3 +borland/variant/variant_test1,2 +borland/variant/variant_test5,0 +borland/variant/variant_test5,2 + +// GCC + +gcc/date_time/testmicrosec_time_clock,14 +gcc/iterator/interoperable_fail,3 +gcc/thread/*,6 + +// Codewarrior 8.3 + +cwpro8/concept_check/class_concept_fail_expected,3 +cwpro8/config/limits_test,3 +cwpro8/static_assert/static_assert_test_fail_8,3 +cwpro8/random/random_test,3 +cwpro8/function/lib_function_test,2 +cwpro8/function/lambda_test,2 +cwpro8/function/mem_fun_cxx98,2 +cwpro8/signals/signal_test,2 +cwpro8/utility/enable_if_constructors,3 +cwpro8/utility/enable_if_dummy_arg_disambiguation,3 +cwpro8/utility/enable_if_lazy,3 +cwpro8/utility/enable_if_lazy_test,3 +cwpro8/utility/enable_if_member_templates,3 +cwpro8/utility/enable_if_namespace_disambiguation,3 +cwpro8/utility/enable_if_no_disambiguation,3 +cwpro8/utility/enable_if_partial_specializations,3 +cwpro8/variant/variant_reference_test,3 + +// Comeau + +como-win32/test/errors_handling_test,3 +como-win32/utility/fun_out_iter_example,4 +como-win32/random/random_test,3 +como-win32/thread/*,10 +como-win32/variant/recursive_variant_test,3 + +// Intel 8.0 + +intel-win32/math/octonion_test,3 +intel-win32/math/quaternion_test,3 +intel-win32/ublas/concepts,3 +intel-win32/ublas/test2,3 +intel-win32/variant/variant_reference_test,3 + +// VC++ 6.0 + +msvc/array/array3,3 +msvc/array/array4,3 +msvc/concept_check/class_concept_fail_expected,3 +msvc/random/*,10 +msvc/function/allocator_test,5 +msvc/function/function_arith_cxx98,3 +msvc/function/function_ref_cxx98,3 +msvc/function/mem_fun_cxx98,3 +msvc/function/std_bind_cxx98,3 +msvc/function/sum_avg_cxx98,3 +msvc/function/lib_function_test,3 +msvc/function/lambda_test,3 +msvc/function/std_bind_portable,5 +msvc/graph/*,3 +msvc/io/*,3 +msvc/iterator/interoperable_fail,2 +msvc/iterator/is_convertible_fail,2 +msvc/lambda/*,3 +msvc/math/octonion_test,3 +msvc/math/quaternion_test,3 +msvc/math/special_functions_test,3 +msvc/signals/signal_test,3 +msvc/type_traits/function_traits_test,3 +msvc/type_traits/remove_bounds_test,3 +msvc/type_traits/remove_const_test,3 +msvc/type_traits/remove_cv_test,3 +msvc/type_traits/remove_pointer_test,3 +msvc/type_traits/remove_reference_test,3 +msvc/type_traits/remove_volatile_test,3 +msvc/utility/enable_if_constructors,3 +msvc/utility/enable_if_dummy_arg_disambiguation,3 +msvc/utility/enable_if_lazy,3 +msvc/utility/enable_if_lazy_test,3 +msvc/utility/enable_if_member_templates,3 +msvc/utility/enable_if_namespace_disambiguation,3 +msvc/utility/enable_if_no_disambiguation,3 +msvc/utility/enable_if_partial_specializations,3 +msvc/variant/recursive_variant_test,3 +msvc/variant/variant_reference_test,3 + +// VC++ 7.0 + +vc7/array/array3,3 +vc7/array/array4,3 +vc7/concept_check/class_concept_fail_expected,3 +vc7/random/*,10 +vc7/thread/test_mutex,0 +vc7/thread/test_mutex,6 +vc7/function/allocator_test,5 +vc7/function/function_arith_cxx98,3 +vc7/function/function_ref_cxx98,3 +vc7/function/mem_fun_cxx98,3 +vc7/function/std_bind_cxx98,3 +vc7/function/sum_avg_cxx98,3 +vc7/function/lib_function_test,3 +vc7/function/lambda_test,3 +vc7/graph/adj_matrix_cc,3 +vc7/graph/edge_list_cc,3 +vc7/graph/subgraph,3 +vc7/graph/transitive_closure_test,3 +vc7/graph/vector_graph_cc,3 +vc7/iterator/interoperable_fail,2 +vc7/iterator/is_convertible_fail,2 +vc7/lambda/*,3 +vc7/math/octonion_test,3 +vc7/math/quaternion_test,3 +vc7/math/special_functions_test,3 +vc7/signals/signal_test,3 +vc7/type_traits/function_traits_test,3 +vc7/type_traits/function_traits_test,3 +vc7/type_traits/remove_bounds_test,3 +vc7/type_traits/remove_const_test,3 +vc7/type_traits/remove_cv_test,3 +vc7/type_traits/remove_pointer_test,3 +vc7/type_traits/remove_reference_test,3 +vc7/type_traits/remove_volatile_test,3 +vc7/utility/enable_if_constructors,3 +vc7/utility/enable_if_dummy_arg_disambiguation,3 +vc7/utility/enable_if_lazy,3 +vc7/utility/enable_if_lazy_test,3 +vc7/utility/enable_if_member_templates,3 +vc7/utility/enable_if_namespace_disambiguation,3 +vc7/utility/enable_if_no_disambiguation,3 +vc7/utility/enable_if_partial_specializations,3 +vc7/variant/recursive_variant_test,3 +vc7/variant/variant_reference_test,3 diff --git a/tools/Jamfile.v2 b/tools/Jamfile.v2 new file mode 100644 index 0000000000..984001120f --- /dev/null +++ b/tools/Jamfile.v2 @@ -0,0 +1,54 @@ +# Copyright 2005 Rene Rivera +# Copyright 2005 Hartmut Kaiser +# Copyright 2005 John Maddock +# Copyright 2003 Vladimir Prus +# Distributed under the Boost Software License, Version 1.0. +# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) + + +# Jamfile which builds all the tools. + +project + : + requirements + static + ; + +TOOLS = + bcp//bcp + inspect/build//inspect + quickbook//quickbook + regression/build//compiler_status + regression/build//process_jam_log + wave/build//wave + ; + +install dist-bin + : + $(TOOLS) + : + EXE + ../dist/bin + : + release + ; + +install dist-lib + : + $(TOOLS) + : + LIB + ../dist/lib + : + release + ; + +local patterns = *.dtd *.xml *.xsl LICENSE ; +local dirs = boostbook/dtd boostbook/xsl ; +install dist-share-boostbook + : + [ glob $(dirs)/$(patterns) $(dirs)/*/$(patterns) $(dirs)/*/*/$(patterns) ] + : + ../dist/share + . + ; diff --git a/tools/bcp b/tools/bcp new file mode 160000 index 0000000000..af596bfca0 --- /dev/null +++ b/tools/bcp @@ -0,0 +1 @@ +Subproject commit af596bfca076451166e4f9a3af7866c3f1b9bda0 diff --git a/tools/boostbook b/tools/boostbook new file mode 160000 index 0000000000..aaf484f4aa --- /dev/null +++ b/tools/boostbook @@ -0,0 +1 @@ +Subproject commit aaf484f4aa2dc129d5b1abfb361cfab010bc02a0 diff --git a/tools/build b/tools/build new file mode 160000 index 0000000000..5af6d49b66 --- /dev/null +++ b/tools/build @@ -0,0 +1 @@ +Subproject commit 5af6d49b664b591c8cf97c66c77446a354bd3835 diff --git a/tools/index.html b/tools/index.html new file mode 100644 index 0000000000..4449e5be78 --- /dev/null +++ b/tools/index.html @@ -0,0 +1,78 @@ + + + + + + + + + + + + Boost Tools + + + + + + + + + + + + + + + +
+ boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
+

Boost Tools

+

Boost developers, testers, and maintainers have developed various programs to + help with the administration of the Boost Libraries. Like everything else about + Boost, these tools are available in source form, and are part of the regular + Boost distribution.

+

Users may find these tools useful when porting Boost libraries to a new + platform, or for use with their own applications.

+
    +
  • + Boost.Build - The Boost build system, including + the full Boost version of the jam sources.
    +   +
  • + Regression - The Boost regression testing + system reporting sources.
    +   +
  • + Inspect - The inspection tool used to detect + errors in the Boost directory hierarchy.
    +   +
  • + BoostBook - A Boost documentation + system, based on DocBook and the + Extensible Stylesheet Language (XSL), used by some Boost libraries.
    +   +
  • + bcp - A utility to extract subsets of Boost; to + determine which parts of Boost your code is using; and to print reports on + Boost usage (including Licence information).
    +   +
  • + QuickBook - QuickBook is a WikiWiki style + documentation tool geared towards C++ documentation using simple rules and markup + for simple formatting tasks. QuickBook generates + BoostBook XML.
    +   +
  • + Wave - A Standards conformant C/C++ + preprocessor usable on top of any other compiler. Usable for instance for the debugging + of the expansion of macros in your code or as a replacement for your build in + preprocessor.
    +
    • +
+
+

Revised + + 19 February, 2005

+ + diff --git a/tools/inspect b/tools/inspect new file mode 160000 index 0000000000..35f8b2e4de --- /dev/null +++ b/tools/inspect @@ -0,0 +1 @@ +Subproject commit 35f8b2e4de629fea0d962602c6cc009853007ce6 diff --git a/tools/make-cputime-page.pl b/tools/make-cputime-page.pl new file mode 100644 index 0000000000..e6969be597 --- /dev/null +++ b/tools/make-cputime-page.pl @@ -0,0 +1,54 @@ +#!/usr/bin/perl -w + +# Copyright 2004 Aleksey Gurtovoy +# Copyright 2001 Jens Maurer +# Distributed under the Boost Software License, Version 1.0. +# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) + +use strict; + +my $filename; +my $compiler; +my $time = 0; +my $ct = 0; +my $first = 2; + +print "\n\n\nCompile Times\n\n\n"; +print "\n"; +print ""; +print "

\n"; +print "Compile time for each successful regression test in seconds.\n"; +print "

\n"; + +print "\n"; +print "\n"; + +while(<>) { + if(/^\*\*\* (.*) \*\*\*$/) { + $filename = $1; + $first = ($first == 0 ? 0 : $first-1); + if($first == 0) { + print "\n\n\n\n"; + } + } elsif(/^\*\* (.*)/) { + $compiler = $1; + if($first) { + print "\n"; + } else { + $ct = 1; + } + } elsif($ct && /^CPU time: ([.0-9]*) s user, ([.0-9]*) s system/) { + $time = $1 + $2; + } elsif($ct && /^Pass$/) { + printf "\n", $time; + $ct = 0; + } elsif($ct && /^Fail$/) { + print "\n"; + $ct = 0; + } +} + +print "\n"; +print "
Test
$filename$compiler%.02f-
\n"; +print "\n\n"; + diff --git a/tools/quickbook b/tools/quickbook new file mode 160000 index 0000000000..7e558d5fbd --- /dev/null +++ b/tools/quickbook @@ -0,0 +1 @@ +Subproject commit 7e558d5fbda52eea6bd2309f06e0ecf49f8ba004 diff --git a/tools/regression/build/Jamfile.v2 b/tools/regression/build/Jamfile.v2 new file mode 100644 index 0000000000..cbf97e71c1 --- /dev/null +++ b/tools/regression/build/Jamfile.v2 @@ -0,0 +1,41 @@ +# Regression test status reporting tools build Jamfile + +exe process_jam_log + : + ../process_jam_log.cpp ../detail/tiny_xml.cpp + /boost/filesystem//boost_filesystem + : + : + release + ; + +exe compiler_status + : + ../compiler_status.cpp ../detail/tiny_xml.cpp + /boost/filesystem//boost_filesystem + : + : + release + ; + +install dist-bin + : + process_jam_log + compiler_status + : + EXE + ../../../dist/bin + : + release + ; + +install dist-lib + : + process_jam_log + compiler_status + : + LIB + ../../../dist/lib + : + release + ; diff --git a/tools/regression/build/vcide/process_jam_log.sln b/tools/regression/build/vcide/process_jam_log.sln new file mode 100644 index 0000000000..29833cc0e1 --- /dev/null +++ b/tools/regression/build/vcide/process_jam_log.sln @@ -0,0 +1,21 @@ +Microsoft Visual Studio Solution File, Format Version 8.00 +Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "process_jam_log", "process_jam_log.vcproj", "{9A751791-929F-496A-8DE7-B61020619BFA}" + ProjectSection(ProjectDependencies) = postProject + EndProjectSection +EndProject +Global + GlobalSection(SolutionConfiguration) = preSolution + Debug = Debug + Release = Release + EndGlobalSection + GlobalSection(ProjectConfiguration) = postSolution + {9A751791-929F-496A-8DE7-B61020619BFA}.Debug.ActiveCfg = Debug|Win32 + {9A751791-929F-496A-8DE7-B61020619BFA}.Debug.Build.0 = Debug|Win32 + {9A751791-929F-496A-8DE7-B61020619BFA}.Release.ActiveCfg = Release|Win32 + {9A751791-929F-496A-8DE7-B61020619BFA}.Release.Build.0 = Release|Win32 + EndGlobalSection + GlobalSection(ExtensibilityGlobals) = postSolution + EndGlobalSection + GlobalSection(ExtensibilityAddIns) = postSolution + EndGlobalSection +EndGlobal diff --git a/tools/regression/build/vcide/process_jam_log.vcproj b/tools/regression/build/vcide/process_jam_log.vcproj new file mode 100644 index 0000000000..93dd003035 --- /dev/null +++ b/tools/regression/build/vcide/process_jam_log.vcproj @@ -0,0 +1,68 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/compiler_status.cpp b/tools/regression/compiler_status.cpp new file mode 100644 index 0000000000..464579a2fe --- /dev/null +++ b/tools/regression/compiler_status.cpp @@ -0,0 +1,975 @@ +// Generate Compiler Status HTML from jam regression test output -----------// + +// 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) + +// See http://www.boost.org/tools/regression/ for documentation. + +/******************************************************************************* + + This program was designed to work unchanged on all platforms and + configurations. All output which is platform or configuration dependent + is obtained from external sources such as the .xml file from + process_jam_log execution, the tools/build/xxx-tools.jam files, or the + output of the config_info tests. + + Please avoid adding platform or configuration dependencies during + program maintenance. + +*******************************************************************************/ + +#include "boost/filesystem/operations.hpp" +#include "boost/filesystem/fstream.hpp" +#include "detail/tiny_xml.hpp" +namespace fs = boost::filesystem; +namespace xml = boost::tiny_xml; + +#include // for abort, exit +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +using std::string; + +const string pass_msg( "Pass" ); +const string warn_msg( "Warn" ); +const string fail_msg( "Fail" ); +const string note_msg( "*" ); +const string missing_residue_msg( "Missing" ); + +const std::size_t max_compile_msg_size = 10000; + +namespace +{ + fs::path boost_root; // boost-root complete path + fs::path locate_root; // locate-root (AKA ALL_LOCATE_TARGET) complete path + + bool ignore_pass; + bool no_warn; + bool no_links; + bool boost_build_v2; + + fs::path jamfile_path; + + fs::directory_iterator end_itr; + + // It's immportant for reliability that we find the same compilers for each + // test, and that they match the column header. So save the names at the + // time column headings are generated. + std::vector toolsets; + + fs::ifstream jamfile; + fs::ofstream report; + fs::ofstream links_file; + string links_name; + + fs::path notes_path; + string notes_html; + + fs::path notes_map_path; + typedef std::multimap< string, string > notes_map; // key is test_name-toolset, + // value is note bookmark + notes_map notes; + + string specific_compiler; // if running on one toolset only + + const string empty_string; + + // prefix for library and test hyperlink prefix + string cvs_root ( "http://boost.cvs.sourceforge.net/" ); + string url_prefix_dir_view( cvs_root + "boost/boost" ); + string url_prefix_checkout_view( cvs_root + "*checkout*/boost/boost" ); + string url_suffix_text_view( "?view=markup&rev=HEAD" ); + +// build notes_bookmarks from notes HTML -----------------------------------// + + void build_notes_bookmarks() + { + if ( notes_map_path.empty() ) return; + fs::ifstream notes_map_file( notes_map_path ); + if ( !notes_map_file ) + { + std::cerr << "Could not open --notes-map input file: " << notes_map_path.string() << std::endl; + std::exit( 1 ); + } + string line; + while( std::getline( notes_map_file, line ) ) + { + string::size_type pos = 0; + if ( (pos = line.find( ',', pos )) == string::npos ) continue; + string key(line.substr( 0, pos ) ); + string bookmark( line.substr( pos+1 ) ); + +// std::cout << "inserting \"" << key << "\",\"" << bookmark << "\"\n"; + notes.insert( notes_map::value_type( key, bookmark ) ); + } + } + +// load_notes_html ---------------------------------------------------------// + + bool load_notes_html() + { + if ( notes_path.empty() ) return false; + fs::ifstream notes_file( notes_path ); + if ( !notes_file ) + { + std::cerr << "Could not open --notes input file: " << notes_path.string() << std::endl; + std::exit( 1 ); + } + string line; + bool in_body( false ); + while( std::getline( notes_file, line ) ) + { + if ( in_body && line.find( "" ) != string::npos ) in_body = false; + if ( in_body ) notes_html += line; + else if ( line.find( "" ) ) in_body = true; + } + return true; + } + +// relative path between two paths -----------------------------------------// + + void relative_path( const fs::path & from, const fs::path & to, + fs::path & target ) + { + if ( from.string().size() <= to.string().size() ) return; + target /= ".."; + relative_path( from.branch_path(), to, target ); + return; + } + +// extract object library name from target directory string ----------------// + + string extract_object_library_name( const string & s ) + { + string t( s ); + string::size_type pos = t.find( "/build/" ); + if ( pos != string::npos ) pos += 7; + else if ( (pos = t.find( "/test/" )) != string::npos ) pos += 6; + else return ""; + return t.substr( pos, t.find( "/", pos ) - pos ); + } + +// find_file ---------------------------------------------------------------// +// given a directory to recursively search + + bool find_file( const fs::path & dir_path, const string & name, + fs::path & path_found, const string & ignore_dir_named="" ) + { + if ( !fs::exists( dir_path ) ) return false; + for ( fs::directory_iterator itr( dir_path ); itr != end_itr; ++itr ) + if ( fs::is_directory( *itr ) + && itr->leaf() != ignore_dir_named ) + { + if ( find_file( *itr, name, path_found ) ) return true; + } + else if ( itr->leaf() == name ) + { + path_found = *itr; + return true; + } + return false; + } + +// platform_desc -----------------------------------------------------------// +// from locate_root/status/bin/config_info.test/xxx/.../config_info.output + + string platform_desc() + { + string result; + fs::path dot_output_path; + + // the gcc config_info "Detected Platform" sometimes reports "cygwin", so + // prefer any of the other compilers. + if ( find_file( locate_root / "bin/boost/status/config_info.test", + "config_info.output", dot_output_path, "gcc" ) + || find_file( locate_root / "bin/boost/status/config_info.test", + "config_info.output", dot_output_path ) + || find_file( locate_root / "status/bin/config_info.test", + "config_info.output", dot_output_path, "gcc" ) + || find_file( locate_root / "status/bin/config_info.test", + "config_info.output", dot_output_path ) ) + { + fs::ifstream file( dot_output_path ); + if ( file ) + { + while( std::getline( file, result ) ) + { + if ( result.find( "Detected Platform: " ) == 0 ) + { + result.erase( 0, 19 ); + return result; + } + } + result.clear(); + } + } + return result; + } + +// version_desc ------------------------------------------------------------// +// from locate-root/status/bin/config_info.test/xxx/.../config_info.output + + string version_desc( const string & compiler_name ) + { + string result; + fs::path dot_output_path; + if ( find_file( locate_root / "bin/boost/status/config_info.test" + / compiler_name, "config_info.output", dot_output_path ) + || find_file( locate_root / "status/bin/config_info.test" + / compiler_name, "config_info.output", dot_output_path ) ) + { + fs::ifstream file( dot_output_path ); + if ( file ) + { + if( std::getline( file, result ) ) + { + string::size_type pos = result.find( "version " ); + if ( pos != string::npos ) + { + result.erase( 0, pos+8 ); + } + else result.clear(); + } + } + } + return result; + } + +// compiler_desc -----------------------------------------------------------// +// from boost-root/tools/build/xxx-tools.jam + + string compiler_desc( const string & compiler_name ) + { + string result; + fs::path tools_path( boost_root / "tools/build/v1" / (compiler_name + + "-tools.jam") ); + if ( !fs::exists( tools_path ) ) + tools_path = boost_root / "tools/build" / (compiler_name + "-tools.jam"); + fs::ifstream file( tools_path ); + if ( file ) + { + while( std::getline( file, result ) ) + { + if ( result.substr( 0, 3 ) == "#//" ) + { + result.erase( 0, 3 ); + return result; + } + } + result.clear(); + } + return result; + } + +// target_directory --------------------------------------------------------// +// this amounts to a request to find a unique leaf directory + + fs::path target_directory( const fs::path & root ) + { + if ( !fs::exists( root ) ) return fs::path("no-such-path"); + fs::path child; + for ( fs::directory_iterator itr( root ); itr != end_itr; ++itr ) + { + if ( fs::is_directory( *itr ) ) + { + // SunCC creates an internal subdirectory everywhere it writes + // object files. This confuses the target_directory() algorithm. + // This patch ignores the SunCC internal directory. Jens Maurer + if ( (*itr).leaf() == "SunWS_cache" ) continue; + // SGI does something similar for template instantiations. Jens Maurer + if( (*itr).leaf() == "ii_files" ) continue; + + if ( child.empty() ) child = *itr; + else + { + std::cout << "Warning: only first of two target possibilities will be reported for: \n " + << root.string() << ": " << child.leaf() + << " and " << (*itr).leaf() << "\n"; + } + } + } + if ( child.empty() ) return root; // this dir has no children + return target_directory( child ); + } + +// element_content ---------------------------------------------------------// + + const string & element_content( + const xml::element & root, const string & name ) + { + static string empty_string; + xml::element_list::const_iterator itr; + for ( itr = root.elements.begin(); + itr != root.elements.end() && (*itr)->name != name; + ++itr ) {} + return itr != root.elements.end() ? (*itr)->content : empty_string; + } + +// find_element ------------------------------------------------------------// + + const xml::element empty_element; + + const xml::element & find_element( + const xml::element & root, const string & name ) + { + xml::element_list::const_iterator itr; + for ( itr = root.elements.begin(); + itr != root.elements.end() && (*itr)->name != name; + ++itr ) {} + return itr != root.elements.end() ? *((*itr).get()) : empty_element; + } + +// attribute_value ----------------------------------------------------------// + +const string & attribute_value( const xml::element & element, + const string & attribute_name ) +{ + static const string empty_string; + xml::attribute_list::const_iterator atr; + for ( atr = element.attributes.begin(); + atr != element.attributes.end() && atr->name != attribute_name; + ++atr ) {} + return atr == element.attributes.end() ? empty_string : atr->value; +} + +// find_bin_path -----------------------------------------------------------// + +// Takes a relative path from boost root to a Jamfile. +// Returns the directory where the build targets from +// that Jamfile are located. If not found, emits a warning +// and returns empty path. +const fs::path find_bin_path(const string& relative) +{ + fs::path bin_path; + if (boost_build_v2) + { + bin_path = locate_root / "bin.v2" / relative; + if (!fs::exists(bin_path)) + { + std::cerr << "warning: could not find build results for '" + << relative << "'.\n"; + std::cerr << "warning: tried directory " + << bin_path.native_directory_string() << "\n"; + bin_path = ""; + } + } + else + { + bin_path = locate_root / "bin/boost" / relative; + if (!fs::exists(bin_path)) + { + bin_path = locate_root / "bin" / relative / "bin"; + if (!fs::exists(bin_path)) + { + bin_path = fs::path( locate_root / relative / "bin" ); + if (!fs::exists(bin_path)) + { + bin_path = fs::path( locate_root / "bin/boost/libs" / + relative.substr( relative.find( '/' )+1 ) ); + } + } + } + if (!fs::exists(bin_path)) + { + std::cerr << "warning: could not find build results for '" + << relative << "'.\n"; + bin_path = ""; + } + } + return bin_path; +} + + +// generate_report ---------------------------------------------------------// + + // return 0 if nothing generated, 1 otherwise, except 2 if compiler msgs + int generate_report( const xml::element & db, + const string & source_library_name, + const string & test_type, + const string & test_name, // possibly object library name + const string & toolset, + bool pass, + bool always_show_run_output = false ) + { + // compile msgs sometimes modified, so make a local copy + string compile( ((pass && no_warn) + ? empty_string : element_content( db, "compile" )) ); + + const string & link( pass ? empty_string : element_content( db, "link" ) ); + const string & run( (pass && !always_show_run_output) + ? empty_string : element_content( db, "run" ) ); + string lib( (pass ? empty_string : element_content( db, "lib" )) ); + + // some compilers output the filename even if there are no errors or + // warnings; detect this if one line of output and it contains no space. + string::size_type pos = compile.find( '\n', 1 ); + if ( pos != string::npos && compile.size()-pos <= 2 + && compile.find( ' ' ) == string::npos ) compile.clear(); + + if ( lib.empty() + && (compile.empty() || test_type == "compile_fail") + && link.empty() && run.empty() ) return 0; + + int result = 1; // some kind of msg for sure + + // limit compile message length + if ( compile.size() > max_compile_msg_size ) + { + compile.erase( max_compile_msg_size ); + compile += "...\n (remainder deleted because of excessive size)\n"; + } + + links_file << "

" + << source_library_name << " - " << test_name << " - " << toolset << "

\n"; + + if ( !compile.empty() ) + { + ++result; + links_file << "

Compiler output:

"
+        << compile << "
\n"; + } + if ( !link.empty() ) + links_file << "

Linker output:

" << link << "
\n"; + if ( !run.empty() ) + links_file << "

Run output:

" << run << "
\n"; + + // for an object library failure, generate a reference to the object + // library failure message, and (once only) generate the object + // library failure message itself + static std::set< string > failed_lib_target_dirs; // only generate once + if ( !lib.empty() ) + { + if ( lib[0] == '\n' ) lib.erase( 0, 1 ); + string object_library_name( extract_object_library_name( lib ) ); + + // changing the target directory naming scheme breaks + // extract_object_library_name() + assert( !object_library_name.empty() ); + if ( object_library_name.empty() ) + std::cerr << "Failed to extract object library name from " << lib << "\n"; + + links_file << "

Library build failure:

\n" + "See " + << source_library_name << " - " + << object_library_name << " - " << toolset << ""; + + if ( failed_lib_target_dirs.find( lib ) == failed_lib_target_dirs.end() ) + { + failed_lib_target_dirs.insert( lib ); + fs::path pth( locate_root / lib / "test_log.xml" ); + fs::ifstream file( pth ); + if ( file ) + { + xml::element_ptr db = xml::parse( file, pth.string() ); + generate_report( *db, source_library_name, test_type, object_library_name, toolset, false ); + } + else + { + links_file << "

" + << object_library_name << " - " << toolset << "

\n" + "test_log.xml not found\n"; + } + } + } + return result; + } + + // add_notes --------------------------------------------------------------// + + void add_notes( const string & key, bool fail, string & sep, string & target ) + { + notes_map::const_iterator itr = notes.lower_bound( key ); + if ( itr != notes.end() && itr->first == key ) + { + for ( ; itr != notes.end() && itr->first == key; ++itr ) + { + string note_desc( itr->second[0] == '-' + ? itr->second.substr( 1 ) : itr->second ); + if ( fail || itr->second[0] == '-' ) + { + target += sep; + sep = ","; + target += ""; + target += note_desc; + target += ""; + } + } + } + } + + // get_notes -------------------------------------------------------------// + + string get_notes( const string & toolset, + const string & library, const string & test, bool fail ) + { + string sep; + string target( "" ); + add_notes( toolset + "/" + library + "/" + test, fail, sep, target ); + add_notes( "*/" + library + "/" + test, fail, sep, target ); + add_notes( toolset + "/" + library + "/*", fail, sep, target ); + add_notes( "*/" + library + "/*", fail, sep, target ); + if ( target == "" ) target.clear(); + else target += ""; + return target; + } + + // do_cell ---------------------------------------------------------------// + + bool do_cell( const string & lib_name, + const fs::path & test_dir, + const string & test_type, + const string & test_name, + const string & toolset, + string & target, + bool always_show_run_output ) + // return true if any results except pass_msg + { + fs::path target_dir( target_directory( test_dir / toolset ) ); + bool pass = false; + + if ( !fs::exists( target_dir / "test_log.xml" ) ) + { + std::cerr << "Missing jam_log.xml in target:\n " + << target_dir.string() << "\n"; + target += "" + missing_residue_msg + ""; + return true; + } + + int anything_generated = 0; + bool note = false; + + fs::path pth( target_dir / "test_log.xml" ); + fs::ifstream file( pth ); + if ( !file ) // could not open jam_log.xml + { + std::cerr << "Can't open jam_log.xml in target:\n " + << target_dir.string() << "\n"; + target += "" + missing_residue_msg + ""; + return false; + } + + xml::element_ptr dbp = xml::parse( file, pth.string() ); + const xml::element & db( *dbp ); + + std::string test_type_base( test_type ); + if ( test_type_base.size() > 5 ) + { + const string::size_type trailer = test_type_base.size() - 5; + if ( test_type_base.substr( trailer ) == "_fail" ) + { + test_type_base.erase( trailer ); + } + } + if ( test_type_base.size() > 4 ) + { + const string::size_type trailer = test_type_base.size() - 4; + if ( test_type_base.substr( trailer ) == "_pyd" ) + { + test_type_base.erase( trailer ); + } + } + const xml::element & test_type_element( find_element( db, test_type_base ) ); + + pass = !test_type_element.name.empty() + && attribute_value( test_type_element, "result" ) != "fail"; + + if ( !no_links ) + { + note = attribute_value( test_type_element, "result" ) == "note"; + + // generate bookmarked report of results, and link to it + anything_generated + = generate_report( db, lib_name, test_type, test_name, toolset, pass, + always_show_run_output || note ); + } + + // generate the status table cell pass/warn/fail HTML + target += ""; + if ( anything_generated != 0 ) + { + target += ""; + target += pass + ? (anything_generated < 2 ? pass_msg : warn_msg) + : fail_msg; + target += ""; + if ( pass && note ) target += note_msg; + } + else target += pass ? pass_msg : fail_msg; + + // if notes, generate the superscript HTML + if ( !notes.empty() ) + target += get_notes( toolset, lib_name, test_name, !pass ); + + target += ""; + return (anything_generated != 0) || !pass; + } + +// do_row ------------------------------------------------------------------// + + void do_row( + const fs::path & test_dir, // locate_root / "status/bin/any_test.test" + const string & test_name, // "any_test" + string & target ) + { + // get library name, test-type, test-program path, etc., from the .xml file + string lib_name; + string test_path( test_name ); // test_name is default if missing .test + string test_type( "unknown" ); + bool always_show_run_output( false ); + fs::path xml_file_path; + if ( find_file( test_dir, "test_log.xml", xml_file_path ) ) + { + fs::ifstream file( xml_file_path ); + if ( file ) + { + xml::element_ptr dbp = xml::parse( file, xml_file_path.string() ); + const xml::element & db( *dbp ); + test_path = attribute_value( db, "test-program" ); + lib_name = attribute_value( db, "library" ); + test_type = attribute_value( db, "test-type" ); + always_show_run_output + = attribute_value( db, "show-run-output" ) == "true"; + } + } + + // generate the library name, test name, and test type table data + string::size_type row_start_pos = target.size(); + target += "" + lib_name + ""; + target += "" + test_name + ""; + target += "" + test_type + ""; + + bool no_warn_save = no_warn; + //if ( test_type.find( "fail" ) != string::npos ) no_warn = true; + + // for each compiler, generate ... html + bool anything_to_report = false; + for ( std::vector::const_iterator itr=toolsets.begin(); + itr != toolsets.end(); ++itr ) + { + anything_to_report |= do_cell( lib_name, test_dir, test_type, test_name, *itr, target, + always_show_run_output ); + } + + target += ""; + if ( ignore_pass && !anything_to_report ) target.erase( row_start_pos ); + no_warn = no_warn_save; + } + +// do_rows_for_sub_tree ----------------------------------------------------// + + void do_rows_for_sub_tree( + const fs::path & bin_dir, std::vector & results ) + { + for ( fs::directory_iterator itr( bin_dir ); itr != end_itr; ++itr ) + { + if ( fs::is_directory( *itr ) + && itr->string().find( ".test" ) == (itr->string().size()-5) ) + { + results.push_back( std::string() ); + do_row( *itr, + itr->leaf().substr( 0, itr->leaf().size()-5 ), + results[results.size()-1] ); + } + } + } + +// do_table_body -----------------------------------------------------------// + + void do_table_body( const fs::path & bin_dir ) + { + // rows are held in a vector so they can be sorted, if desired. + std::vector results; + + // do primary bin directory + do_rows_for_sub_tree( bin_dir, results ); + + // do subinclude bin directories + jamfile.clear(); + jamfile.seekg(0); + string line; + while( std::getline( jamfile, line ) ) + { + bool v2(false); + string::size_type pos( line.find( "subinclude" ) ); + if ( pos == string::npos ) { + pos = line.find( "build-project" ); + v2 = true; + } + if ( pos != string::npos + && line.find( '#' ) > pos ) + { + if (v2) + pos = line.find_first_not_of( " \t./", pos+13 ); + else + pos = line.find_first_not_of( " \t./", pos+10 ); + + if ( pos == string::npos ) continue; + string subinclude_bin_dir( + line.substr( pos, line.find_first_of( " \t", pos )-pos ) ); + + fs::path bin_path = find_bin_path(subinclude_bin_dir); + if (!bin_path.empty()) + do_rows_for_sub_tree( bin_path, results ); + } + } + + + std::sort( results.begin(), results.end() ); + + for ( std::vector::iterator v(results.begin()); + v != results.end(); ++v ) + { report << *v << "\n"; } + } + +// do_table ----------------------------------------------------------------// + + void do_table() + { + // Find test result locations, trying: + // - Boost.Build V1 location with ALL_LOCATE_TARGET + // - Boost.Build V2 location with top-lelve "build-dir" + // - Boost.Build V1 location without ALL_LOCATE_TARGET + string relative( fs::initial_path().string() ); + relative.erase( 0, boost_root.string().size()+1 ); + fs::path bin_path = find_bin_path(relative); + + report << "\n"; + + // generate the column headings + + report << "\n" + "\n"; + + fs::directory_iterator itr( bin_path ); + while ( itr != end_itr + && ((itr->string().find( ".test" ) != (itr->string().size()-5)) + || !fs::is_directory( *itr ))) + ++itr; // bypass chaff + if ( itr != end_itr ) + { + fs::directory_iterator compiler_itr( *itr ); + if ( specific_compiler.empty() ) + std::clog << "Using " << itr->string() << " to determine compilers\n"; + for (; compiler_itr != end_itr; ++compiler_itr ) + { + if ( fs::is_directory( *compiler_itr ) // check just to be sure + && compiler_itr->leaf() != "test" ) // avoid strange directory (Jamfile bug?) + { + if ( specific_compiler.size() != 0 + && specific_compiler != compiler_itr->leaf() ) continue; + toolsets.push_back( compiler_itr->leaf() ); + string desc( compiler_desc( compiler_itr->leaf() ) ); + string vers( version_desc( compiler_itr->leaf() ) ); + report << "\n"; + } + } + } + + report << "\n"; + + // now the rest of the table body + + do_table_body( bin_path ); + + report << "
LibraryTest NameTest Type" + << (desc.size() ? desc : compiler_itr->leaf()) + << (vers.size() ? (string( "
" ) + vers ) : string( "" )) + << "
\n"; + } + +} // unnamed namespace + +// main --------------------------------------------------------------------// + +#define BOOST_NO_CPP_MAIN_SUCCESS_MESSAGE +#include + +int cpp_main( int argc, char * argv[] ) // note name! +{ + fs::path comment_path; + while ( argc > 1 && *argv[1] == '-' ) + { + if ( argc > 2 && std::strcmp( argv[1], "--compiler" ) == 0 ) + { specific_compiler = argv[2]; --argc; ++argv; } + else if ( argc > 2 && std::strcmp( argv[1], "--locate-root" ) == 0 ) + { locate_root = fs::path( argv[2], fs::native ); --argc; ++argv; } + else if ( argc > 2 && std::strcmp( argv[1], "--comment" ) == 0 ) + { comment_path = fs::path( argv[2], fs::native ); --argc; ++argv; } + else if ( argc > 2 && std::strcmp( argv[1], "--notes" ) == 0 ) + { notes_path = fs::path( argv[2], fs::native ); --argc; ++argv; } + else if ( argc > 2 && std::strcmp( argv[1], "--notes-map" ) == 0 ) + { notes_map_path = fs::path( argv[2], fs::native ); --argc; ++argv; } + else if ( std::strcmp( argv[1], "--ignore-pass" ) == 0 ) ignore_pass = true; + else if ( std::strcmp( argv[1], "--no-warn" ) == 0 ) no_warn = true; + else if ( std::strcmp( argv[1], "--v2" ) == 0 ) boost_build_v2 = true; + else if ( argc > 2 && std::strcmp( argv[1], "--jamfile" ) == 0) + { jamfile_path = fs::path( argv[2], fs::native ); --argc; ++argv; } + else { std::cerr << "Unknown option: " << argv[1] << "\n"; argc = 1; } + --argc; + ++argv; + } + + if ( argc != 3 && argc != 4 ) + { + std::cerr << + "Usage: compiler_status [options...] boost-root status-file [links-file]\n" + " boost-root is the path to the boost tree root directory.\n" + " status-file and links-file are paths to the output files.\n" + "Must be run from directory containing Jamfile\n" + " options: --compiler name Run for named compiler only\n" + " --ignore-pass Do not report tests which pass all compilers\n" + " --no-warn Warnings not reported if test passes\n" + " --locate-root path Path to ALL_LOCATE_TARGET for bjam;\n" + " default boost-root.\n" + " --comment path Path to file containing HTML\n" + " to be copied into status-file.\n" + " --notes path Path to file containing HTML\n" + " to be copied into status-file.\n" + " --notes-map path Path to file of toolset/test,n lines, where\n" + " n is number of note bookmark in --notes file.\n" + " --jamfile path Path to Jamfile. By default \"Jamfile\".\n" + "Example: compiler_status --compiler gcc /boost-root cs.html cs-links.html\n" + "Note: Only the leaf of the links-file path and --notes file string are\n" + "used in status-file HTML links. Thus for browsing, status-file,\n" + "links-file, and --notes file must all be in the same directory.\n" + ; + return 1; + } + + boost_root = fs::path( argv[1], fs::native ); + if ( locate_root.empty() ) locate_root = boost_root; + + if (jamfile_path.empty()) + if (boost_build_v2) + jamfile_path = "Jamfile.v2"; + else + jamfile_path = "Jamfile"; + jamfile_path = fs::complete( jamfile_path, fs::initial_path() ); + jamfile.open( jamfile_path ); + if ( !jamfile ) + { + std::cerr << "Could not open Jamfile: " << jamfile_path.native_file_string() << std::endl; + return 1; + } + + report.open( fs::path( argv[2], fs::native ) ); + if ( !report ) + { + std::cerr << "Could not open report output file: " << argv[2] << std::endl; + return 1; + } + + if ( argc == 4 ) + { + fs::path links_path( argv[3], fs::native ); + links_name = links_path.leaf(); + links_file.open( links_path ); + if ( !links_file ) + { + std::cerr << "Could not open links output file: " << argv[3] << std::endl; + return 1; + } + } + else no_links = true; + + build_notes_bookmarks(); + + char run_date[128]; + std::time_t tod; + std::time( &tod ); + std::strftime( run_date, sizeof(run_date), + "%X UTC, %A %d %B %Y", std::gmtime( &tod ) ); + + report << "\n" + "\n" + "Boost Compiler Status Automatic Test\n" + "\n" + "\n" + "\n" + "\n" + "\n" + "\n
\n" + "

Compiler Status: " + platform_desc() + "

\n" + "Run Date: " + << run_date + << "\n" + ; + + if ( !comment_path.empty() ) + { + fs::ifstream comment_file( comment_path ); + if ( !comment_file ) + { + std::cerr << "Could not open \"--comment\" input file: " << comment_path.string() << std::endl; + return 1; + } + char c; + while ( comment_file.get( c ) ) { report.put( c ); } + } + + report << "
\n
\n"; + + if ( !no_links ) + { + links_file + << "\n" + "\n" + "Boost Compiler Status Error Log\n" + "\n" + "\n" + "\n" + "\n" + "\n" + "\n
\n" + "

Compiler Status: " + platform_desc() + "

\n" + "Run Date: " + << run_date + << "\n
\n
\n" + ; + } + + do_table(); + + if ( load_notes_html() ) report << notes_html << "\n"; + + report << "\n" + "\n" + ; + + if ( !no_links ) + { + links_file + << "\n" + "\n" + ; + } + return 0; +} diff --git a/tools/regression/detail/tiny_xml.cpp b/tools/regression/detail/tiny_xml.cpp new file mode 100644 index 0000000000..682c04ff7b --- /dev/null +++ b/tools/regression/detail/tiny_xml.cpp @@ -0,0 +1,167 @@ +// tiny XML sub-set tools implementation -----------------------------------// + +// (C) 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) + +#include "tiny_xml.hpp" +#include +#include + +namespace +{ + + void eat_whitespace( char & c, std::istream & in ) + { + while ( c == ' ' || c == '\r' || c == '\n' || c == '\t' ) + in.get( c ); + } + + std::string get_name( char & c, std::istream & in ) + { + std::string result; + eat_whitespace( c, in ); + while ( std::strchr( + "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_-.", c ) + != 0 ) + { + result += c; + if(!in.get( c )) + throw std::string("xml: unexpected eof"); + } + return result; + } + + void eat_delim( char & c, std::istream & in, + char delim, const std::string & msg ) + { + eat_whitespace( c, in ); + if ( c != delim ) + throw std::string("xml syntax error, expected ") + delim + + " (" + msg + ")"; + in.get( c ); + } + + std::string get_value( char & c, std::istream & in ) + { + std::string result; + while ( c != '\"' ) + { + result += c; + in.get( c ); + } + in.get( c ); + return result; + } + +} + +namespace boost +{ + namespace tiny_xml + { + + // parse -----------------------------------------------------------------// + + element_ptr parse( std::istream & in, const std::string & msg ) + { + char c = 0; // current character + element_ptr e( new element ); + + if(!in.get( c )) + throw std::string("xml: unexpected eof"); + if ( c == '<' ) + if(!in.get( c )) + throw std::string("xml: unexpected eof"); + + e->name = get_name( c, in ); + eat_whitespace( c, in ); + + // attributes + while ( c != '>' ) + { + attribute a; + a.name = get_name( c, in ); + + eat_delim( c, in, '=', msg ); + eat_delim( c, in, '\"', msg ); + + a.value = get_value( c, in ); + + e->attributes.push_back( a ); + eat_whitespace( c, in ); + } + if(!in.get( c )) // next after '>' + throw std::string("xml: unexpected eof"); + + eat_whitespace( c, in ); + + // sub-elements + while ( c == '<' ) + { + if ( in.peek() == '/' ) break; + e->elements.push_back( parse( in, msg ) ); + in.get( c ); // next after '>' + eat_whitespace( c, in ); + } + + // content + if ( c != '<' ) + { + e->content += '\n'; + while ( c != '<' ) + { + e->content += c; + if(!in.get( c )) + throw std::string("xml: unexpected eof"); + } + } + + assert( c == '<' ); + if(!in.get( c )) // next after '<' + throw std::string("xml: unexpected eof"); + + eat_delim( c, in, '/', msg ); + std::string end_name( get_name( c, in ) ); + if ( e->name != end_name ) + throw std::string("xml syntax error: beginning name ") + + e->name + " did not match end name " + end_name + + " (" + msg + ")"; + + eat_delim( c, in, '>', msg ); + return e; + } + + // write ---------------------------------------------------------------// + + void write( const element & e, std::ostream & out ) + { + out << "<" << e.name; + if ( !e.attributes.empty() ) + { + for( attribute_list::const_iterator itr = e.attributes.begin(); + itr != e.attributes.end(); ++itr ) + { + out << " " << itr->name << "=\"" << itr->value << "\""; + } + } + out << ">"; + if ( !e.elements.empty() ) + { + out << "\n"; + for( element_list::const_iterator itr = e.elements.begin(); + itr != e.elements.end(); ++itr ) + { + write( **itr, out ); + } + } + if ( !e.content.empty() ) + { + out << e.content; + } + out << "\n"; + } + + } // namespace tiny_xml +} // namespace boost + diff --git a/tools/regression/detail/tiny_xml.hpp b/tools/regression/detail/tiny_xml.hpp new file mode 100644 index 0000000000..f9d91d2652 --- /dev/null +++ b/tools/regression/detail/tiny_xml.hpp @@ -0,0 +1,70 @@ +// tiny XML sub-set tools --------------------------------------------------// + +// (C) 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) + +// Provides self-contained tools for this XML sub-set: +// +// element ::= { "<" name { name "=" "\"" value "\"" } ">" +// {element} [contents] "" } +// +// The point of "self-contained" is to minimize tool-chain dependencies. + +#ifndef BOOST_TINY_XML_H +#define BOOST_TINY_XML_H + +#include "boost/smart_ptr.hpp" // for shared_ptr +#include "boost/utility.hpp" // for noncopyable +#include +#include +#include + +namespace boost +{ + namespace tiny_xml + { + class element; + struct attribute + { + std::string name; + std::string value; + + attribute(){} + attribute( const std::string & name, const std::string & value ) + : name(name), value(value) {} + }; + typedef boost::shared_ptr< element > element_ptr; + typedef std::list< element_ptr > element_list; + typedef std::list< attribute > attribute_list; + + class element + : private boost::noncopyable // because deep copy sematics would be required + { + public: + std::string name; + attribute_list attributes; + element_list elements; + std::string content; + + element() {} + explicit element( const std::string & name ) : name(name) {} + }; + + element_ptr parse( std::istream & in, const std::string & msg ); + // Precondition: stream positioned at either the initial "<" + // or the first character after the initial "<". + // Postcondition: stream positioned at the first character after final + // ">" (or eof). + // Returns: an element_ptr to an element representing the parsed stream. + // Throws: std::string on syntax error. msg appended to what() string. + + void write( const element & e, std::ostream & out ); + + } +} + +#endif // BOOST_TINY_XML_H + + + diff --git a/tools/regression/detail/tiny_xml_test.cpp b/tools/regression/detail/tiny_xml_test.cpp new file mode 100644 index 0000000000..b5c0542ba4 --- /dev/null +++ b/tools/regression/detail/tiny_xml_test.cpp @@ -0,0 +1,17 @@ +// tiny XML test program ---------------------------------------------------// + +// 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) + +#include "tiny_xml.hpp" + +#include + +int main() +{ + boost::tiny_xml::element_ptr tree( boost::tiny_xml::parse( std::cin ) ); + boost::tiny_xml::write( *tree, std::cout ); + return 0; +} + diff --git a/tools/regression/detail/tiny_xml_test.txt b/tools/regression/detail/tiny_xml_test.txt new file mode 100644 index 0000000000..25bc531e0b --- /dev/null +++ b/tools/regression/detail/tiny_xml_test.txt @@ -0,0 +1,12 @@ + + + +It's Howdy Doody time! + +It's not Howdy Doody time! + + +It's +Eastern Standard time! + + diff --git a/tools/regression/index.htm b/tools/regression/index.htm new file mode 100644 index 0000000000..01079ed2da --- /dev/null +++ b/tools/regression/index.htm @@ -0,0 +1,43 @@ + + + + + + + +Regression Test Reporting Tools + + + + +

boost.png (6897 bytes) Regression Test Reporting +Tools

+ +

Boost regression testing uses Boost.Build +to run the actual builds and tests. A separate set of tools is +used to generate the actual status reports.

+ +
    +
  • Instructions + for running regression tests and reporting results back to + Boost.
    • +
  • process_jam_log.cpp - + Processes the bjam outputs, creating a file named + test_log.xml for each test encountered.
    • +
  • compiler_status.cpp - + Generates HTML status tables from test_log.xml and other + files.
    • +
  • Jamfile.v2 - Builds + process_jam_log and compiler_status executables.
    • +
+ +
+ +

Revised 09 January, 2003

+ + diff --git a/tools/regression/index.shtml b/tools/regression/index.shtml new file mode 100644 index 0000000000..918036ff4a --- /dev/null +++ b/tools/regression/index.shtml @@ -0,0 +1,45 @@ + + + +Boost Regression Tests + + + + + + + + + +

Boost Regression Tests

+ +

Boost-wide reports

+ + +

Reports by platform

+ + + + diff --git a/tools/regression/process_jam_log.cpp b/tools/regression/process_jam_log.cpp new file mode 100644 index 0000000000..42ad78946c --- /dev/null +++ b/tools/regression/process_jam_log.cpp @@ -0,0 +1,801 @@ +// process jam regression test output into XML -----------------------------// + +// 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) + +// See http://www.boost.org/tools/regression for documentation. + +#include "detail/tiny_xml.hpp" +#include "boost/filesystem/operations.hpp" +#include "boost/filesystem/fstream.hpp" +#include "boost/filesystem/exception.hpp" +#include "boost/filesystem/convenience.hpp" + +#include +#include +#include +#include +#include // for make_pair +#include +#include // for tolower + +using std::string; +namespace xml = boost::tiny_xml; +namespace fs = boost::filesystem; + +#define BOOST_NO_CPP_MAIN_SUCCESS_MESSAGE +#include + +// options + +static bool echo = false; +static bool create_dirs = false; +static bool boost_build_v2 = false; + +namespace +{ + struct test_info + { + string file_path; // relative boost-root + string type; + bool always_show_run_output; + }; + typedef std::map< string, test_info > test2info_map; // key is test-name + test2info_map test2info; + + fs::path boost_root; + fs::path locate_root; // ALL_LOCATE_TARGET (or boost_root if none) + +// append_html -------------------------------------------------------------// + + void append_html( const string & src, string & target ) + { + // there are a few lines we want to ignore + if ( src.find( "th target..." ) != string::npos + || src.find( "cc1plus.exe: warning: changing search order for system directory" ) != string::npos + || src.find( "cc1plus.exe: warning: as it has already been specified as a non-system directory" ) != string::npos + ) return; + + // on some platforms (e.g. tru64cxx) the following line is a real performance boost + target.reserve(src.size() * 2 + target.size()); + + for ( string::size_type pos = 0; pos < src.size(); ++pos ) + { + if ( src[pos] == '<' ) target += "<"; + else if ( src[pos] == '>' ) target += ">"; + else if ( src[pos] == '&' ) target += "&"; + else target += src[pos]; + } + } + + // timestamp ---------------------------------------------------------------// + + string timestamp() + { + char run_date[128]; + std::time_t tod; + std::time( &tod ); + std::strftime( run_date, sizeof(run_date), + "%Y-%m-%d %X UTC", std::gmtime( &tod ) ); + return string( run_date ); + } + +// convert path separators to forward slashes ------------------------------// + + void convert_path_separators( string & s ) + { + for ( string::iterator itr = s.begin(); itr != s.end(); ++itr ) + if ( *itr == '\\' || *itr == '!' ) *itr = '/'; + } + +// trim_left ----------------------------------------------------------------// + + std::string trim_left( std::string const& s ) + { + std::string::size_type const pos( s.find_first_not_of(' ') ); + return pos != std::string::npos + ? s.substr( pos, s.size() - pos + 1 ) + : "" + ; + } + + +// split --------------------------------------------------------------------// + + std::vector split( std::string const& s ) + { + std::string::size_type const pos( s.find_first_of(' ') ); + std::vector result( 1, s.substr( 0, pos ) ); + if ( pos == std::string::npos ) + return result; + + std::vector const rest( split( trim_left( s.substr( pos, s.size() - pos + 1 ) ) ) ); + result.insert( result.end(), rest.begin(), rest.end() ); + return result; + } + + +// extract a target directory path from a jam target string ----------------// +// s may be relative to the initial_path: +// ..\..\..\libs\foo\build\bin\libfoo.lib\vc7\debug\runtime-link-dynamic\boo.obj +// s may be absolute: +// d:\myboost\libs\foo\build\bin\libfoo.lib\vc7\debug\runtime-link-dynamic\boo.obj +// return path is always relative to the boost directory tree: +// libs/foo/build/bin/libfs.lib/vc7/debug/runtime-link-dynamic + + string target_directory( const string & s ) + { + string temp( s ); + convert_path_separators( temp ); + temp.erase( temp.find_last_of( "/" ) ); // remove leaf + temp = split( trim_left( temp ) ).back(); + if ( temp[0] == '.' ) temp.erase( 0, temp.find_first_not_of( "./" ) ); + else temp.erase( 0, locate_root.string().size()+1 ); + if ( echo ) + std::cout << "\ttarget_directory( \"" << s << "\") -> \"" << temp << "\"" << std::endl; + return temp; + } + + string::size_type target_name_end( const string & s ) + { + string::size_type pos = s.find( ".test/" ); + if ( pos == string::npos ) pos = s.find( ".dll/" ); + if ( pos == string::npos ) pos = s.find( ".so/" ); + if ( pos == string::npos ) pos = s.find( ".lib/" ); + if ( pos == string::npos ) pos = s.find( ".pyd/" ); + if ( pos == string::npos ) pos = s.find( ".a/" ); + return pos; + } + + string toolset( const string & s ) + { + string::size_type pos = target_name_end( s ); + if ( pos == string::npos ) pos = s.find( "build/" ); + if ( pos == string::npos ) return ""; + pos = s.find( "/", pos ) + 1; + return s.substr( pos, s.find( "/", pos ) - pos ); + } + + string test_name( const string & s ) + { + string::size_type pos = target_name_end( s ); + if ( pos == string::npos ) return ""; + string::size_type pos_start = s.rfind( '/', pos ) + 1; + return s.substr( pos_start, + (s.find( ".test/" ) != string::npos + ? pos : s.find( "/", pos )) - pos_start ); + } + + // Take a path to a target directory of test, and + // returns library name corresponding to that path. + string test_path_to_library_name( string const& path ) + { + std::string result; + string::size_type start_pos( path.find( "libs/" ) ); + if ( start_pos != string::npos ) + { + // The path format is ...libs/functional/hash/test/something.test/.... + // So, the part between "libs" and "test/something.test" can be considered + // as library name. But, for some libraries tests are located too deep, + // say numeric/ublas/test/test1 directory, and some libraries have tests + // in several subdirectories (regex/example and regex/test). So, nested + // directory may belong to several libraries. + + // To disambituate, it's possible to place a 'sublibs' file in + // a directory. It means that child directories are separate libraries. + // It's still possible to have tests in the directory that has 'sublibs' + // file. + + std::string interesting; + start_pos += 5; + string::size_type end_pos( path.find( ".test/", start_pos ) ); + end_pos = path.rfind('/', end_pos); + if (path.substr(end_pos - 5, 5) == "/test") + interesting = path.substr( start_pos, end_pos - 5 - start_pos ); + else + interesting = path.substr( start_pos, end_pos - start_pos ); + + // Take slash separate elements until we have corresponding 'sublibs'. + end_pos = 0; + for(;;) + { + end_pos = interesting.find('/', end_pos); + if (end_pos == string::npos) { + result = interesting; + break; + } + result = interesting.substr(0, end_pos); + + if ( fs::exists( ( boost_root / "libs" ) / result / "sublibs" ) ) + { + end_pos = end_pos + 1; + } + else + break; + } + } + + return result; + } + + // Tries to find target name in the string 'msg', starting from + // position start. + // If found, extract the directory name from the target name and + // stores it in 'dir', and return the position after the target name. + // Otherwise, returns string::npos. + string::size_type parse_skipped_msg_aux(const string& msg, + string::size_type start, + string& dir) + { + dir.clear(); + string::size_type start_pos = msg.find( '<', start ); + if ( start_pos == string::npos ) return string::npos; + ++start_pos; + string::size_type end_pos = msg.find( '>', start_pos ); + dir += msg.substr( start_pos, end_pos - start_pos ); + if ( boost_build_v2 ) + { + // The first letter is a magic value indicating + // the type of grist. + convert_path_separators( dir ); + dir.erase( 0, 1 ); + // We need path from root, not from 'status' dir. + if (dir.find("../") == 0) + dir.erase(0,3); + else // dir is always relative to the boost directory tree + dir.erase( 0, locate_root.string().size()+1 ); + } + else + { + if ( dir[0] == '@' ) + { + // new style build path, rooted build tree + convert_path_separators( dir ); + dir.replace( 0, 1, "bin/" ); + } + else + { + // old style build path, integrated build tree + start_pos = dir.rfind( '!' ); + convert_path_separators( dir ); + string::size_type path_sep_pos = dir.find( '/', start_pos + 1 ); + if ( path_sep_pos != string::npos ) + dir.insert( path_sep_pos, "/bin" ); + else + { + // see http://article.gmane.org/gmane.comp.lib.boost.devel/146688; + // the following code assumes that: a) 'dir' is not empty, + // b) 'end_pos != string::npos' and c) 'msg' always ends with '...' + if ( dir[dir.size() - 1] == '@' ) + dir += "/" + msg.substr( end_pos + 1, msg.size() - end_pos - 1 - 3 ); + } + } + } + return end_pos; + } + + // the format of paths is really kinky, so convert to normal form + // first path is missing the leading "..\". + // first path is missing "\bin" after "status". + // second path is missing the leading "..\". + // second path is missing "\bin" after "build". + // second path uses "!" for some separators. + void parse_skipped_msg( const string & msg, + string & first_dir, string & second_dir ) + { + string::size_type pos = parse_skipped_msg_aux(msg, 0, first_dir); + if (pos == string::npos) + return; + parse_skipped_msg_aux(msg, pos, second_dir); + } + +// test_log hides database details -----------------------------------------// + + class test_log + : boost::noncopyable + { + const string & m_target_directory; + xml::element_ptr m_root; + public: + test_log( const string & target_directory, + const string & test_name, + const string & toolset, + bool force_new_file ) + : m_target_directory( target_directory ) + { + if ( !force_new_file ) + { + fs::path pth( locate_root / target_directory / "test_log.xml" ); + fs::ifstream file( pth ); + if ( file ) // existing file + { + try + { + m_root = xml::parse( file, pth.string() ); + return; + } + catch(...) + { + // unable to parse existing XML file, fall through + } + } + } + + string library_name( test_path_to_library_name( target_directory ) ); + + test_info info; + test2info_map::iterator itr( test2info.find( library_name + "/" + test_name ) ); + if ( itr != test2info.end() ) + info = itr->second; + + if ( !info.file_path.empty() ) + library_name = test_path_to_library_name( info.file_path ); + + if ( info.type.empty() ) + { + if ( target_directory.find( ".lib/" ) != string::npos + || target_directory.find( ".dll/" ) != string::npos + || target_directory.find( ".so/" ) != string::npos + || target_directory.find( ".dylib/" ) != string::npos + || target_directory.find( "/build/" ) != string::npos + ) + { + info.type = "lib"; + } + else if ( target_directory.find( ".pyd/" ) != string::npos ) + info.type = "pyd"; + } + + m_root.reset( new xml::element( "test-log" ) ); + m_root->attributes.push_back( + xml::attribute( "library", library_name ) ); + m_root->attributes.push_back( + xml::attribute( "test-name", test_name ) ); + m_root->attributes.push_back( + xml::attribute( "test-type", info.type ) ); + m_root->attributes.push_back( + xml::attribute( "test-program", info.file_path ) ); + m_root->attributes.push_back( + xml::attribute( "target-directory", target_directory ) ); + m_root->attributes.push_back( + xml::attribute( "toolset", toolset ) ); + m_root->attributes.push_back( + xml::attribute( "show-run-output", + info.always_show_run_output ? "true" : "false" ) ); + } + + ~test_log() + { + fs::path pth( locate_root / m_target_directory / "test_log.xml" ); + if ( create_dirs && !fs::exists( pth.branch_path() ) ) + fs::create_directories( pth.branch_path() ); + fs::ofstream file( pth ); + if ( !file ) + { + std::cout << "*****Warning - can't open output file: " + << pth.string() << "\n"; + } + else xml::write( *m_root, file ); + } + + const string & target_directory() const { return m_target_directory; } + + void remove_action( const string & action_name ) + // no effect if action_name not found + { + xml::element_list::iterator itr; + for ( itr = m_root->elements.begin(); + itr != m_root->elements.end() && (*itr)->name != action_name; + ++itr ) {} + if ( itr != m_root->elements.end() ) m_root->elements.erase( itr ); + } + + void add_action( const string & action_name, + const string & result, + const string & timestamp, + const string & content ) + { + remove_action( action_name ); + xml::element_ptr action( new xml::element(action_name) ); + m_root->elements.push_back( action ); + action->attributes.push_back( xml::attribute( "result", result ) ); + action->attributes.push_back( xml::attribute( "timestamp", timestamp ) ); + action->content = content; + } + }; + +// message_manager maps input messages into test_log actions ---------------// + + class message_manager + : boost::noncopyable + { + string m_action_name; // !empty() implies action pending + // IOW, a start_message awaits stop_message + string m_target_directory; + string m_test_name; + string m_toolset; + + bool m_note; // if true, run result set to "note" + // set false by start_message() + + // data needed to stop further compile action after a compile failure + // detected in the same target directory + string m_previous_target_directory; + bool m_compile_failed; + + public: + message_manager() : m_note(false) {} + ~message_manager() { /*assert( m_action_name.empty() );*/ } + + bool note() const { return m_note; } + void note( bool value ) { m_note = value; } + + void start_message( const string & action_name, + const string & target_directory, + const string & test_name, + const string & toolset, + const string & prior_content ) + { + assert( !target_directory.empty() ); + + if ( !m_action_name.empty() ) stop_message( prior_content ); + m_action_name = action_name; + m_target_directory = target_directory; + m_test_name = test_name; + m_toolset = toolset; + m_note = false; + + if ( m_previous_target_directory != target_directory ) + { + m_previous_target_directory = target_directory; + m_compile_failed = false; + } + } + + void stop_message( const string & content ) + { + if ( m_action_name.empty() ) return; + stop_message( m_action_name, m_target_directory, + "succeed", timestamp(), content ); + } + + void stop_message( const string & action_name, + const string & target_directory, + const string & result, + const string & timestamp, + const string & content ) + // the only valid action_names are "compile", "link", "run", "lib" + { + // My understanding of the jam output is that there should never be + // a stop_message that was not preceeded by a matching start_message. + // That understanding is built into message_manager code. + assert( m_action_name == action_name ); + assert( m_target_directory == target_directory ); + assert( result == "succeed" || result == "fail" ); + + // if test_log.xml entry needed + if ( !m_compile_failed + || action_name != "compile" + || m_previous_target_directory != target_directory ) + { + if ( action_name == "compile" + && result == "fail" ) m_compile_failed = true; + + test_log tl( target_directory, + m_test_name, m_toolset, action_name == "compile" ); + tl.remove_action( "lib" ); // always clear out lib residue + + // dependency removal + if ( action_name == "lib" ) + { + tl.remove_action( "compile" ); + tl.remove_action( "link" ); + tl.remove_action( "run" ); + } + else if ( action_name == "compile" ) + { + tl.remove_action( "link" ); + tl.remove_action( "run" ); + if ( result == "fail" ) m_compile_failed = true; + } + else if ( action_name == "link" ) + { + tl.remove_action( "run" ); + } + + // dependency removal won't work right with random names, so assert + else { assert( action_name == "run" ); } + + // add the "run" stop_message action + tl.add_action( action_name, + result == "succeed" && note() ? std::string("note") : result, + timestamp, content ); + } + + m_action_name = ""; // signal no pending action + m_previous_target_directory = target_directory; + } + }; +} + + +// main --------------------------------------------------------------------// + + +int cpp_main( int argc, char ** argv ) +{ + // Turn off synchronization with corresponding C standard library files. This + // gives a significant speed improvement on platforms where the standard C++ + // streams are implemented using standard C files. + std::ios::sync_with_stdio(false); + + if ( argc <= 1 ) + std::cout << "Usage: bjam [bjam-args] | process_jam_log [--echo] [--create-directories] [--v2] [locate-root]\n" + "locate-root - the same as the bjam ALL_LOCATE_TARGET\n" + " parameter, if any. Default is boost-root.\n" + "create-directories - if the directory for xml file doesn't exists - creates it.\n" + " usually used for processing logfile on different machine\n"; + + boost_root = fs::initial_path(); + + while ( !boost_root.empty() + && !fs::exists( boost_root / "libs" ) ) + { + boost_root /= ".."; + } + + if ( boost_root.empty() ) + { + std::cout << "must be run from within the boost-root directory tree\n"; + return 1; + } + + boost_root.normalize(); + + if ( argc > 1 && std::strcmp( argv[1], "--echo" ) == 0 ) + { + echo = true; + --argc; ++argv; + } + + + if (argc > 1 && std::strcmp( argv[1], "--create-directories" ) == 0 ) + { + create_dirs = true; + --argc; ++argv; + } + + if ( argc > 1 && std::strcmp( argv[1], "--v2" ) == 0 ) + { + boost_build_v2 = true; + --argc; ++argv; + } + + + if (argc > 1) + { + locate_root = fs::path( argv[1], fs::native ); + if ( !locate_root.is_complete() ) + locate_root = ( fs::initial_path() / locate_root ).normalize(); + + --argc; ++argv; + } + else + { + locate_root = boost_root; + } + + std::cout << "boost_root: " << boost_root.string() << '\n' + << "locate_root: " << locate_root.string() << '\n'; + + message_manager mgr; + + string line; + string content; + bool capture_lines = false; + + std::istream* input; + if (argc > 1) + { + input = new std::ifstream(argv[1]); + } + else + { + input = &std::cin; + } + + // This loop looks at lines for certain signatures, and accordingly: + // * Calls start_message() to start capturing lines. (start_message() will + // automatically call stop_message() if needed.) + // * Calls stop_message() to stop capturing lines. + // * Capture lines if line capture on. + + int line_num = 0; + while ( std::getline( *input, line ) ) + { + ++line_num; + + std::vector const line_parts( split( line ) ); + std::string const line_start( line_parts[0] != "...failed" + ? line_parts[0] + : line_parts[0] + " " + line_parts[1] + ); + + if ( echo ) + { + std::cout + << "line " << line_num << ": " << line << "\n" + << "\tline_start: " << line_start << "\n"; + } + + // create map of test-name to test-info + if ( line_start.find( "boost-test(" ) == 0 ) + { + string::size_type pos = line.find( '"' ); + string test_name( line.substr( pos+1, line.find( '"', pos+1)-pos-1 ) ); + test_info info; + info.always_show_run_output + = line.find( "\"always_show_run_output\"" ) != string::npos; + info.type = line.substr( 11, line.find( ')' )-11 ); + for (unsigned int i = 0; i!=info.type.size(); ++i ) + { info.type[i] = std::tolower( info.type[i] ); } + pos = line.find( ':' ); + // the rest of line is missing if bjam didn't know how to make target + if ( pos + 1 != line.size() ) + { + info.file_path = line.substr( pos+3, + line.find( "\"", pos+3 )-pos-3 ); + convert_path_separators( info.file_path ); + if ( info.file_path.find( "libs/libs/" ) == 0 ) info.file_path.erase( 0, 5 ); + if ( test_name.find( "/" ) == string::npos ) + test_name = "/" + test_name; + test2info.insert( std::make_pair( test_name, info ) ); + // std::cout << test_name << ", " << info.type << ", " << info.file_path << "\n"; + } + else + { + std::cout << "*****Warning - missing test path: " << line << "\n" + << " (Usually occurs when bjam doesn't know how to make a target)\n"; + } + continue; + } + + // these actions represent both the start of a new action + // and the end of a failed action + else if ( line_start.find( "C++-action" ) != string::npos + || line_start.find( "vc-C++" ) != string::npos + || line_start.find( "C-action" ) != string::npos + || line_start.find( "Cc-action" ) != string::npos + || line_start.find( "vc-Cc" ) != string::npos + || line_start.find( ".compile.") != string::npos + || line_start.find( "compile-") != string::npos + || line_start.find( "-compile") != string::npos + || line_start.find( "Link-action" ) != string::npos + || line_start.find( "vc-Link" ) != string::npos + || line_start.find( "Archive-action" ) != string::npos + || line_start.find( ".archive") != string::npos + || ( line_start.find( ".link") != string::npos && + // .linkonce is present in gcc linker messages about + // unresolved symbols. We don't have to parse those + line_start.find( ".linkonce" ) == string::npos ) + ) + { + string action( ( line_start.find( "Link-action" ) != string::npos + || line_start.find( "vc-Link" ) != string::npos + || line_start.find( "Archive-action" ) != string::npos + || line_start.find( ".archive") != string::npos + || line_start.find( ".link") != string::npos + ) + ? "link" : "compile" + ); + + if ( line_start.find( "...failed " ) != string::npos ) + { + mgr.stop_message( action, target_directory( line ), + "fail", timestamp(), content ); + } + else + { + string target_dir( target_directory( line ) ); + mgr.start_message( action, target_dir, + test_name( target_dir ), toolset( target_dir ), content ); + } + content = "\n"; + capture_lines = true; + } + + // these actions are only used to stop the previous action + else if ( line_start.find( "-Archive" ) != string::npos + || line_start.find( "MkDir" ) == 0 ) + { + mgr.stop_message( content ); + content.clear(); + capture_lines = false; + } + + else if ( line_start.find( "execute-test" ) != string::npos + || line_start.find( "capture-output" ) != string::npos ) + { + if ( line_start.find( "...failed " ) != string::npos ) + { + mgr.stop_message( "run", target_directory( line ), + "fail", timestamp(), content ); + content = "\n"; + capture_lines = true; + } + else + { + string target_dir( target_directory( line ) ); + mgr.start_message( "run", target_dir, + test_name( target_dir ), toolset( target_dir ), content ); + + // contents of .output file for content + capture_lines = false; + content = "\n"; + fs::ifstream file( locate_root / target_dir + / (test_name(target_dir) + ".output") ); + if ( file ) + { + string ln; + while ( std::getline( file, ln ) ) + { + if ( ln.find( "" ) != string::npos ) mgr.note( true ); + append_html( ln, content ); + content += "\n"; + } + } + } + } + + // bjam indicates some prior dependency failed by a "...skipped" message + else if ( line_start.find( "...skipped" ) != string::npos + && line.find( "" ) == string::npos + ) + { + mgr.stop_message( content ); + content.clear(); + capture_lines = false; + + if ( line.find( " for lack of " ) != string::npos ) + { + capture_lines = ( line.find( ".run for lack of " ) == string::npos ); + + string target_dir; + string lib_dir; + + parse_skipped_msg( line, target_dir, lib_dir ); + + if ( target_dir != lib_dir ) // it's a lib problem + { + mgr.start_message( "lib", target_dir, + test_name( target_dir ), toolset( target_dir ), content ); + content = lib_dir; + mgr.stop_message( "lib", target_dir, "fail", timestamp(), content ); + content = "\n"; + } + } + + } + + else if ( line_start.find( "**passed**" ) != string::npos + || line_start.find( "failed-test-file" ) != string::npos + || line_start.find( "command-file-dump" ) != string::npos ) + { + mgr.stop_message( content ); + content = "\n"; + capture_lines = true; + } + + else if ( capture_lines ) // hang onto lines for possible later use + { + append_html( line, content );; + content += "\n"; + } + } + + mgr.stop_message( content ); + if (input != &std::cin) + delete input; + return 0; +} diff --git a/tools/regression/regression-logs.pl b/tools/regression/regression-logs.pl new file mode 100644 index 0000000000..97cd4e9acd --- /dev/null +++ b/tools/regression/regression-logs.pl @@ -0,0 +1,197 @@ +#!/usr/bin/perl + +#~ Copyright 2003, Rene Rivera. +#~ Use, modification and distribution are subject to the Boost Software +#~ License Version 1.0. (See accompanying file LICENSE_1_0.txt or +#~ http://www.boost.org/LICENSE_1_0.txt) + +use FileHandle; +use Time::Local; + +# Get the whle percent value +# +sub percent_value +{ + my ($count,$total) = @_; + my $percent = int (($count/$total)*100+0.5); + if ($count > 0 && $percent == 0) { $percent = 1; } + if ($count < $total && $percent == 100) { $percent = 99; } + return $percent; +} + +# Generate item html for the pass column. +# +sub result_info_pass +{ + my ($color,$pass,$warn,$fail,$missing) = @_; + my $percent = 100-percent_value($fail+$missing,$pass+$warn+$fail+$missing); + return "$percent%
($warn warnings)"; +} + +# Generate item html for the fail column. +# +sub result_info_fail +{ + my ($color,$pass,$warn,$fail,$missing) = @_; + my $percent = percent_value($fail+$missing,$pass+$warn+$fail+$missing); + return "$percent%
($fail)"; +} + +# Generate an age highlighted run date string. +# Use as: data_info(run-date-html) +# +sub date_info +{ + my %m = ('January',0,'February',1,'March',2,'April',3,'May',4,'June',5, + 'July',6,'August',7,'September',8,'October',9,'November',10,'December',11); + my @d = split(/ |:/,$_[0]); + my ($hour,$min,$sec,$day,$month,$year) = ($d[0],$d[1],$d[2],$d[4],$m{$d[5]},$d[6]); + #print "\n"; + my $test_t = timegm($sec,$min,$hour,$day,$month,$year); + my $age = time-$test_t; + my $age_days = $age/(60*60*24); + #print "\n"; + my $age_html = ""; + if ($age_days <= 2) { } + elsif ($age_days <= 14) { $age_html = ""; } + else { $age_html = ""; } + return $age_html.$_[0].""; +} + +# Generate an age string based on the run date. +# Use as: age_info(run-date-html) +# +sub age_info +{ + my %m = ('January',0,'February',1,'March',2,'April',3,'May',4,'June',5, + 'July',6,'August',7,'September',8,'October',9,'November',10,'December',11); + my @d = split(/ |:/,$_[0]); + my ($hour,$min,$sec,$day,$month,$year) = ($d[0],$d[1],$d[2],$d[4],$m{$d[5]},$d[6]); + #print "\n"; + my $test_t = timegm($sec,$min,$hour,$day,$month,$year); + my $age = time-$test_t; + my $age_days = $age/(60*60*24); + #print "\n"; + my $age_html = ""; + if ($age_days <= 2) { } + elsif ($age_days <= 14) { $age_html = ""; } + else { $age_html = ""; } + if ($age_days <= 1) { $age_html = $age_html."today"; } + elsif ($age_days <= 2) { $age_html = $age_html."yesterday"; } + elsif ($age_days < 14) { my $days = int $age_days; $age_html = $age_html.$days." days"; } + elsif ($age_days < 7*8) { my $weeks = int $age_days/7; $age_html = $age_html.$weeks." weeks"; } + else { my $months = int $age_days/28; $age_html = $age_html.$months." months"; } + return $age_html.""; +} + +#~ foreach my $k (sort keys %ENV) +#~ { + #~ print "\n"; +#~ } +my $logdir = "$ENV{PWD}"; +#~ my $logdir = "C:\\CVSROOTs\\Boost\\boost\\status"; +opendir LOGS, "$logdir"; +my @logs = grep /.*links[^.]*\.html$/, readdir LOGS; +closedir LOGS; +my @bgcolor = ( "bgcolor=\"#EEEEFF\"", "" ); +my $row = 0; +print "\n"; +print "\n", + "\n", + "\n", + "\n", + "\n", + "\n", + "\n", + "\n"; +foreach $l (sort { lc($a) cmp lc($b) } @logs) +{ + my $log = $l; + $log =~ s/-links//s; + my ($spec) = ($log =~ /cs-([^\.]+)/); + my $fh = new FileHandle; + if ($fh->open("<$logdir/$log")) + { + my $content = join('',$fh->getlines()); + $fh->close; + my ($status) = ($content =~ /(

Compiler(.(?!<\/td>))+.)/si); + my ($platform) = ($status =~ /Status: ([^<]+)/si); + my ($run_date) = ($status =~ /Date:<\/b> ([^<]+)/si); + $run_date =~ s/, /
/g; + my ($compilers) = ($content =~ /Test Type<\/a><\/t[dh]>((.(?!<\/tr>))+.)/si); + if ($compilers eq "") { next; } + $compilers =~ s/-
//g; + $compilers =~ s/<\/td>//g; + my @compiler = ($compilers =~ /

\n", + "\n", + "\n", + "\n", + "\n", + "\n", + "\n", + "\n"; + $row = ($row+1)%2; + foreach my $c (1..($count-1)) + { + print + "\n", + "\n", + "\n", + "\n", + "\n"; + $row = ($row+1)%2; + } + print + "\n", + "\n", + "\n"; + } +} +print "
PlatformRun DateAgeCompilersPassFail
(.*)$/gim); + my $count = @compiler; + my @results = ($content =~ /(>Pass<|>Warn<|>Fail<|>Missing<)/gi); + my $test_count = (scalar @results)/$count; + my @pass = map { 0 } (1..$count); + my @warn = map { 0 } (1..$count); + my @fail = map { 0 } (1..$count); + my @missing = map { 0 } (1..$count); + my @total = map { 0 } (1..$count); + #~ print "\n"; + for my $t (1..$test_count) + { + my $r0 = (($t-1)*$count); + my $r1 = (($t-1)*$count+$count-1); + my @r = @results[(($t-1)*$count)..(($t-1)*$count+$count-1)]; + #~ print "\n"; + for my $c (1..$count) + { + if ($r[$c-1] =~ /Pass/i) { ++$pass[$c-1]; } + elsif ($r[$c-1] =~ /Warn/i) { ++$warn[$c-1]; } + elsif ($r[$c-1] =~ /Fail/i) { ++$fail[$c-1]; } + elsif ($r[$c-1] =~ /Missing/i) { ++$missing[$c-1]; } + ++$total[$c-1]; + } + } + #~ print "\n"; + for my $comp (1..(scalar @compiler)) + { + my @lines = split(/
/,$compiler[$comp-1]); + if (@lines > 2) { $compiler[$comp-1] = join(' ',@lines[0..(scalar @lines)-2])."
".$lines[(scalar @lines)-1]; } + } + print + "
$platform
($spec)		",$run_date,"",age_info($run_date),"",$compiler[0],"",result_info_pass("#000000",$pass[0],$warn[0],$fail[0],$missing[0]),"",result_info_fail("#FF0000",$pass[0],$warn[0],$fail[0],$missing[0]),"
",$compiler[$c],"",result_info_pass("#000000",$pass[$c],$warn[$c],$fail[$c],$missing[$c]),"",result_info_fail("#FF0000",$pass[$c],$warn[$c],$fail[$c],$missing[$c]),"
\n"; diff --git a/tools/regression/run_tests.sh b/tools/regression/run_tests.sh new file mode 100644 index 0000000000..04eaf833ba --- /dev/null +++ b/tools/regression/run_tests.sh @@ -0,0 +1,191 @@ +#!/bin/sh +# +# shell script for running the boost regression test suite and generating +# a html table of results. + +# Set the following variables to configure the operation. Variables you +# should set, i.e. usually required are listed first. Optional variables +# have reasonable defaults for most situations. + + +### THESE SHOULD BE CHANGED! + +# +# "boost_root" points to the root of you boost installation: +# This can be either a non-exitent directory or an already complete Boost +# source tree. +# +boost_root="$HOME/CVSROOTs/Boost/boost_regression" + +# +# Wether to fetch the most current Boost code from CVS (yes/no): +# There are two contexts to use this script in: on an active Boost CVS +# tree, and on a fresh Boost CVS tree. If "yes" is specified here an attempt +# to fetch the latest CVS Boost files is made. For an active Boost CVS +# the CVS connection information is used. If an empty tree is detected +# the code is fetched with the anonymous read only information. +# +cvs_update=no + +# +# "test_tools" are the Boost.Build toolsets to use for building and running the +# regression tests. Specify a space separated list, of the Boost.Build toolsets. +# Each will be built and tested in sequence. +# +test_tools=gcc + +# +# "toolset" is the Boost.Build toolset to use for building the helper programs. +# This is usually different than the toolsets one is testing. And this is +# normally a toolset that corresponds to the compiler built into your platform. +# +toolset=gcc + +# +# "comment_path" is the path to an html-file describing the test environment. +# The content of this file will be embedded in the status pages being produced. +# +comment_path="$boost_root/../regression_comment.html" +# +# "test_dir" is the relative path to the directory to run the tests in, +# defaults to "status" and runs all the tests, but could be a sub-directory +# for example "libs/regex/test" to run the regex tests alone. +# +test_dir="status" + + +### DEFAULTS ARE OK FOR THESE. + +# +# "exe_suffix" the suffix used by exectable files: +# In case your platform requires use of a special suffix for executables specify +# it here, including the "." if needed. This should not be needed even in Windows +# like platforms as they will execute without the suffix anyway. +# +exe_suffix= + +# +# "bjam" points to your built bjam executable: +# The location of the binary for running bjam. The default should work +# under most circumstances. +# +bjam="$boost_root/tools/jam/src/bin/bjam$exe_suffix" + +# +# "process_jam_log", and "compiler_status" paths to built helper programs: +# The location of the executables of the regression help programs. These +# are built locally so the default should work in most situations. +# +process_jam_log="$boost_root/dist/bin/process_jam_log$exe_suffix" +compiler_status="$boost_root/dist/bin/compiler_status$exe_suffix" + +# +# "boost_build_path" can point to additional locations to find toolset files. +# +boost_build_path="$HOME/.boost-build" + + +### NO MORE CONFIGURABLE PARTS. + +# +# Some setup. +# +boost_dir=`basename "$boost_root"` +if test -n "${BOOST_BUILD_PATH}" ; then + BOOST_BUILD_PATH="$boost_build_path:$BOOST_BUILD_PATH" +else + BOOST_BUILD_PATH="$boost_build_path" +fi +export BOOST_BUILD_PATH + +# +# STEP 0: +# +# Get the source code: +# +if test ! -d "$boost_root" ; then + mkdir -p "$boost_root" + if test $? -ne 0 ; then + echo "creation of $boost_root directory failed." + exit 256 + fi +fi +if test $cvs_update = yes ; then + echo fetching Boost: + echo "/1 :pserver:anonymous@cvs.sourceforge.net:2401/cvsroot/boost A" >> "$HOME/.cvspass" + cat "$HOME/.cvspass" | sort | uniq > "$HOME/.cvspass" + cd `dirname "$boost_root"` + if test -f boost/CVS/Root ; then + cvs -z3 -d `cat "$boost_dir/CVS/Root"` co -d "$boost_dir" boost + else + cvs -z3 -d :pserver:anonymous@cvs.sourceforge.net:2401/cvsroot/boost co -d "$boost_dir" boost + fi +fi + +# +# STEP 1: +# rebuild bjam if required: +# +echo building bjam: +cd "$boost_root/tools/jam/src" && \ +LOCATE_TARGET=bin sh ./build.sh +if test $? != 0 ; then + echo "bjam build failed." + exit 256 +fi + +# +# STEP 2: +# rebuild the regression test helper programs if required: +# +echo building regression test helper programs: +cd "$boost_root/tools/regression/build" && \ +"$bjam" $toolset release +if test $? != 0 ; then + echo "helper program build failed." + exit 256 +fi + +# +# STEP 5: +# repeat steps 3 and 4 for each additional toolset: +# +for tool in $test_tools ; do + +# +# STEP 3: +# run the regression tests: +# +echo running the $tool regression tests: +cd "$boost_root/$test_dir" +"$bjam" $tool --dump-tests 2>&1 | tee regress.log + +# +# STEP 4: +# post process the results: +# +echo processing the regression test results for $tool: +cat regress.log | "$process_jam_log" --v2 +if test $? != 0 ; then + echo "Failed regression log post processing." + exit 256 +fi + +done + +# +# STEP 6: +# create the html table: +# +uname=`uname` +echo generating html tables: +"$compiler_status" --v2 --comment "$comment_path" "$boost_root" cs-$uname.html cs-$uname-links.html +if test $? != 0 ; then + echo "Failed HTML result table generation." + exit 256 +fi + +echo "done!" + + + diff --git a/tools/regression/test/compile-fail~fail.cpp b/tools/regression/test/compile-fail~fail.cpp new file mode 100644 index 0000000000..76fc53b9d7 --- /dev/null +++ b/tools/regression/test/compile-fail~fail.cpp @@ -0,0 +1,10 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +int main() { return 0; } + diff --git a/tools/regression/test/compile-fail~pass.cpp b/tools/regression/test/compile-fail~pass.cpp new file mode 100644 index 0000000000..cacb17d133 --- /dev/null +++ b/tools/regression/test/compile-fail~pass.cpp @@ -0,0 +1,9 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +#error example of a compile failure diff --git a/tools/regression/test/compile~fail.cpp b/tools/regression/test/compile~fail.cpp new file mode 100644 index 0000000000..cacb17d133 --- /dev/null +++ b/tools/regression/test/compile~fail.cpp @@ -0,0 +1,9 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +#error example of a compile failure diff --git a/tools/regression/test/compile~pass.cpp b/tools/regression/test/compile~pass.cpp new file mode 100644 index 0000000000..384b51fa4a --- /dev/null +++ b/tools/regression/test/compile~pass.cpp @@ -0,0 +1,9 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +int main() { return 0; } diff --git a/tools/regression/test/compile~warn.cpp b/tools/regression/test/compile~warn.cpp new file mode 100644 index 0000000000..7895a229e7 --- /dev/null +++ b/tools/regression/test/compile~warn.cpp @@ -0,0 +1,18 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +// provoke one or more compiler warnings + +int main(int argc, char * argv[] ) +{ + short s; + unsigned long ul; + s = s & ul; // warning from many compilers + if ( s == ul ) {} // warning from GCC + return 0; +} diff --git a/tools/regression/test/run-fail~compile-fail.cpp b/tools/regression/test/run-fail~compile-fail.cpp new file mode 100644 index 0000000000..cacb17d133 --- /dev/null +++ b/tools/regression/test/run-fail~compile-fail.cpp @@ -0,0 +1,9 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +#error example of a compile failure diff --git a/tools/regression/test/run-fail~fail-warn.cpp b/tools/regression/test/run-fail~fail-warn.cpp new file mode 100644 index 0000000000..577d2bb890 --- /dev/null +++ b/tools/regression/test/run-fail~fail-warn.cpp @@ -0,0 +1,16 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +int main() +{ + short s; + unsigned long ul; + s = s & ul; // warning from many compilers + if ( s == ul ) {} // warning from GCC + return 0; +} diff --git a/tools/regression/test/run-fail~fail.cpp b/tools/regression/test/run-fail~fail.cpp new file mode 100644 index 0000000000..865b8eb3dd --- /dev/null +++ b/tools/regression/test/run-fail~fail.cpp @@ -0,0 +1,12 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +int main() +{ + return 0; +} diff --git a/tools/regression/test/run-fail~pass.cpp b/tools/regression/test/run-fail~pass.cpp new file mode 100644 index 0000000000..3e3ab13973 --- /dev/null +++ b/tools/regression/test/run-fail~pass.cpp @@ -0,0 +1,15 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +#include + +int main() +{ + std::cout << "example of output from a run-time failure\n"; + return 1; +} diff --git a/tools/regression/test/run-fail~warn.cpp b/tools/regression/test/run-fail~warn.cpp new file mode 100644 index 0000000000..8cc21a110a --- /dev/null +++ b/tools/regression/test/run-fail~warn.cpp @@ -0,0 +1,20 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +#include + +int main() +{ + short s; + unsigned long ul; + s = s & ul; // warning from many compilers + if ( s == ul ) {} // warning from GCC + + std::cout << "example of output from a run-time failure\n"; + return 1; +} diff --git a/tools/regression/test/run~compile-fail.cpp b/tools/regression/test/run~compile-fail.cpp new file mode 100644 index 0000000000..cacb17d133 --- /dev/null +++ b/tools/regression/test/run~compile-fail.cpp @@ -0,0 +1,9 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +#error example of a compile failure diff --git a/tools/regression/test/run~fail-note.cpp b/tools/regression/test/run~fail-note.cpp new file mode 100644 index 0000000000..b514da0938 --- /dev/null +++ b/tools/regression/test/run~fail-note.cpp @@ -0,0 +1,17 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +#include + +int main() +{ + std::cout << "example of output before a line\n"; + std::cout << "\n"; + std::cout << "example of output after a line\n"; + return 1; +} diff --git a/tools/regression/test/run~fail-warn.cpp b/tools/regression/test/run~fail-warn.cpp new file mode 100644 index 0000000000..8cc21a110a --- /dev/null +++ b/tools/regression/test/run~fail-warn.cpp @@ -0,0 +1,20 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +#include + +int main() +{ + short s; + unsigned long ul; + s = s & ul; // warning from many compilers + if ( s == ul ) {} // warning from GCC + + std::cout << "example of output from a run-time failure\n"; + return 1; +} diff --git a/tools/regression/test/run~fail.cpp b/tools/regression/test/run~fail.cpp new file mode 100644 index 0000000000..d6b8ffacf9 --- /dev/null +++ b/tools/regression/test/run~fail.cpp @@ -0,0 +1,14 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +#include + +int main() +{ + return 1; +} diff --git a/tools/regression/test/run~note.cpp b/tools/regression/test/run~note.cpp new file mode 100644 index 0000000000..2841618522 --- /dev/null +++ b/tools/regression/test/run~note.cpp @@ -0,0 +1,17 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +#include + +int main() +{ + std::cout << "example of output before a line\n"; + std::cout << "\n"; + std::cout << "example of output after a line\n"; + return 0; +} diff --git a/tools/regression/test/run~pass.cpp b/tools/regression/test/run~pass.cpp new file mode 100644 index 0000000000..865b8eb3dd --- /dev/null +++ b/tools/regression/test/run~pass.cpp @@ -0,0 +1,12 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +int main() +{ + return 0; +} diff --git a/tools/regression/test/run~warn-note.cpp b/tools/regression/test/run~warn-note.cpp new file mode 100644 index 0000000000..36e1c5faf3 --- /dev/null +++ b/tools/regression/test/run~warn-note.cpp @@ -0,0 +1,24 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +#include + +int main() +{ + std::cout << "example of output before a line\n"; + std::cout << "\n"; + std::cout << "example of output after a line\n"; + + // provoke a compiler warning to make sure takes priority over + // a warning, but neither is lost from status reporting links HTML. + short s; + unsigned long ul; + s = s & ul; // warning from many compilers + if ( s == ul ) {} // warning from GCC + return 0; +} diff --git a/tools/regression/test/run~warn.cpp b/tools/regression/test/run~warn.cpp new file mode 100644 index 0000000000..7895a229e7 --- /dev/null +++ b/tools/regression/test/run~warn.cpp @@ -0,0 +1,18 @@ +// (C) Copyright Beman Dawes 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) + +// Test naming convention: the portion of the name before the tilde ("~") +// identifies the bjam test type. The portion after the tilde +// identifies the correct result to be reported by compiler_status. + +// provoke one or more compiler warnings + +int main(int argc, char * argv[] ) +{ + short s; + unsigned long ul; + s = s & ul; // warning from many compilers + if ( s == ul ) {} // warning from GCC + return 0; +} diff --git a/tools/regression/test/test-cases/borland/bjam.log b/tools/regression/test/test-cases/borland/bjam.log new file mode 100644 index 0000000000..526c824b65 --- /dev/null +++ b/tools/regression/test/test-cases/borland/bjam.log @@ -0,0 +1,98 @@ +locate-root "g:\boost\rc-1-34\results\boost\bin.v2" +searching for python.exe in c:/local/python25/bin +boost-test(RUN) "config_link_test" : "libs/config/test/link/main.cpp" +...patience... +...patience... +...patience... +...patience... +...patience... +...found 84395 targets... +...updating 64629 targets... + +MkDir1 g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2 + + mkdir "g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2" + +MkDir1 g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug + + mkdir "g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug" + +borland.compile.c++ g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\main.obj + + "c:/progra~1/borland/bds/4.0/bin/bcc32.exe" -j5 -g255 -q -c -P -Ve -Vx -a8 -b- -v -Od -tWC -tWR -tWC -WM- -DBOOST_ALL_NO_LIB=1 -DBOOST_CONFIG_NO_LIB=1 -DBOOST_DYN_LINK=1 -I".." -I"c:/progra~1/borland/bds/4.0/include/" -o"g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\main.obj" "g:\boost\rc-1-34\boost\libs\config\test\link\main.cpp" + +g:\boost\rc-1-34\boost\libs\config\test\link\main.cpp: +MkDir1 g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2 + + mkdir "g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2" + +MkDir1 g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug + + mkdir "g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug" + +borland.compile.c++ g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug\link_test.obj + + "c:/progra~1/borland/bds/4.0/bin/bcc32.exe" -j5 -g255 -q -c -P -Ve -Vx -a8 -b- -v -Od -tWC -tWR -tWC -tWD -WM- -DBOOST_ALL_NO_LIB=1 -DBOOST_DYN_LINK=1 -I".." -I"c:/progra~1/borland/bds/4.0/include/" -o"g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug\link_test.obj" "..\libs\config\test\link\link_test.cpp" + +..\libs\config\test\link\link_test.cpp: + +file g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.dll.rsp + +"g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug\link_test.obj" + +borland.link.dll g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.dll g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.lib + + set "PATH=c:/progra~1/borland/bds/4.0/bin/;%PATH%" + "c:/progra~1/borland/bds/4.0/bin/bcc32.exe" -v -q -v -v -tWD -tWC -tWR -tWC -tWD -WM- -L"c:/progra~1/borland/bds/4.0/lib" -e"g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.dll" @"g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.dll.rsp" && "c:/progra~1/borland/bds/4.0/bin/implib" "g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.lib" "g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.dll" + + +Borland Implib Version 3.0.22 Copyright (c) 1991, 2000 Inprise Corporation + +file g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.exe.rsp + +"g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\main.obj" + +"g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.lib" + +borland.link g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.exe + + set "PATH=c:/progra~1/borland/bds/4.0/bin/;%PATH%" + "c:/progra~1/borland/bds/4.0/bin/bcc32.exe" -v -q -v -v -tWD -tWC -tWR -tWC -WM- -L"c:/progra~1/borland/bds/4.0/lib" -e"g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.exe" @"g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.exe.rsp" + +testing.capture-output g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.run + + set PATH=g:\boost\rc-1-34\results\boost\bin.v2\libs\config\test\link\borland-5.8.2\debug;c:\progra~1\borland\bds\4.0\bin;%PATH% + + "g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.exe" > "g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.output" 2>&1 + set status=%ERRORLEVEL% + echo. >> "g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.output" + echo EXIT STATUS: %status% >> "g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.output" + if %status% EQU 0 ( + copy "g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.output" "g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.run" + ) + set verbose=0 + if %status% NEQ 0 ( + set verbose=1 + ) + if %verbose% EQU 1 ( + echo ====== BEGIN OUTPUT ====== + type "g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.output" + echo ====== END OUTPUT ====== + ) + exit %status% + + 1 file(s) copied. +RmTemps g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.run + + del /f /q "g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.exe" + +**passed** g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.test + + echo passed > g:\boost\rc-1-34\results\boost\bin.v2\status\config_link_test.test\borland-5.8.2\debug\config_link_test.test + + + + +...failed updating 1716 targets... +...skipped 6455 targets... +...updated 56458 targets... diff --git a/tools/regression/test/test-cases/general/.cvsignore b/tools/regression/test/test-cases/general/.cvsignore new file mode 100644 index 0000000000..f8b8405036 --- /dev/null +++ b/tools/regression/test/test-cases/general/.cvsignore @@ -0,0 +1 @@ +actual \ No newline at end of file diff --git a/tools/regression/test/test-cases/general/bjam.log b/tools/regression/test/test-cases/general/bjam.log new file mode 100644 index 0000000000..71013f7458 --- /dev/null +++ b/tools/regression/test/test-cases/general/bjam.log @@ -0,0 +1,325 @@ +locate-root "..\..\..\bin.v2" +C:\Users\Misha\Stuff\boost\HEAD\boost\tools\regression\test>C:\Users\Misha\Stuff\boost\HEAD\bin\..\boost\tools\jam\src\bin.ntx86\bjam.exe --dump-tests --v2 msvc-7.1 "-sBOOST_BUILD_PATH=C:\Users\Misha\Stuff\boost\HEAD\bin\.." "-sBOOST_ROOT="C:\Users\Misha\Stuff\boost\HEAD\bin\..\boost" +warning: Python location is not configured +warning: the Boost.Python library won't be built +Building Boost.Regex with the optional Unicode/ICU support disabled. +Please refer to the Boost.Regex documentation for more information +(and if you don't know what ICU is then you probably don't need it). +boost-test(RUN) "testlib/run~warn" : "tools/regression/test/run~warn.cpp" +boost-test(RUN) "testlib/run~warn-note" : "tools/regression/test/run~warn-note.cpp" +boost-test(RUN) "testlib/run~pass" : "tools/regression/test/run~pass.cpp" +boost-test(RUN) "testlib/run~note" : "tools/regression/test/run~note.cpp" +boost-test(RUN) "testlib/run~fail" : "tools/regression/test/run~fail.cpp" +boost-test(RUN_FAIL) "testlib/run-fail~pass" : "tools/regression/test/run-fail~pass.cpp" +boost-test(RUN_FAIL) "testlib/run-fail~fail" : "tools/regression/test/run-fail~fail.cpp" +boost-test(RUN_FAIL) "testlib/run-fail~fail-warn" : "tools/regression/test/run-fail~fail-warn.cpp" +boost-test(RUN_FAIL) "testlib/run-fail~compile-fail" : "tools/regression/test/run-fail~compile-fail.cpp" +boost-test(LINK_FAIL) "testlib/link-fail~pass" : "tools/regression/test/link-fail~pass.cpp" +boost-test(LINK_FAIL) "testlib/link-fail~fail" : "tools/regression/test/link-fail~fail.cpp" +boost-test(LINK) "testlib/link~pass" : "tools/regression/test/link~pass.cpp" +boost-test(LINK) "testlib/link~fail" : "tools/regression/test/link~fail.cpp" +boost-test(COMPILE) "testlib/compile~warn" : "tools/regression/test/compile~warn.cpp" +boost-test(COMPILE) "testlib/compile~pass" : "tools/regression/test/compile~pass.cpp" +boost-test(COMPILE) "testlib/compile~fail" : "tools/regression/test/compile~fail.cpp" +boost-test(COMPILE_FAIL) "testlib/compile-fail~pass" : "tools/regression/test/compile-fail~pass.cpp" +boost-test(COMPILE_FAIL) "testlib/compile-fail~fail" : "tools/regression/test/compile-fail~fail.cpp" +...found 210 targets... +...updating 157 targets... +MkDir1 ..\..\..\bin.v2\tools\regression\test +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile-fail~fail.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile-fail~fail.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile-fail~fail.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile-fail~fail.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile-fail~fail.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\compile-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\compile-fail~fail.obj +compile-fail~fail.cpp + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +cl /Zm800 -nologo @"..\..\..\bin.v2\tools\regression\test\compile-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\compile-fail~fail.obj.rsp" + +...failed compile-c-c++ ..\..\..\bin.v2\tools\regression\test\compile-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\compile-fail~fail.obj... +...removing ..\..\..\bin.v2\tools\regression\test\compile-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\compile-fail~fail.obj +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile-fail~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile-fail~pass.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile-fail~pass.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile-fail~pass.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile-fail~pass.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\compile-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\compile-fail~pass.obj +compile-fail~pass.cpp +compile-fail~pass.cpp(9) : fatal error C1189: #error : example of a compile failure +(failed-as-expected) ..\..\..\bin.v2\tools\regression\test\compile-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\compile-fail~pass.obj +**passed** ..\..\..\bin.v2\tools\regression\test\compile-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\compile-fail~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~fail.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~fail.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~fail.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~fail.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~fail.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\compile~fail.test\msvc-7.1\debug\link-static\threading-multi\compile~fail.obj +compile~fail.cpp +compile~fail.cpp(9) : fatal error C1189: #error : example of a compile failure + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +cl /Zm800 -nologo @"..\..\..\bin.v2\tools\regression\test\compile~fail.test\msvc-7.1\debug\link-static\threading-multi\compile~fail.obj.rsp" + +...failed compile-c-c++ ..\..\..\bin.v2\tools\regression\test\compile~fail.test\msvc-7.1\debug\link-static\threading-multi\compile~fail.obj... +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~pass.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~pass.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~pass.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~pass.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\compile~pass.test\msvc-7.1\debug\link-static\threading-multi\compile~pass.obj +compile~pass.cpp +**passed** ..\..\..\bin.v2\tools\regression\test\compile~pass.test\msvc-7.1\debug\link-static\threading-multi\compile~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~warn.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~warn.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~warn.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~warn.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\compile~warn.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\compile~warn.test\msvc-7.1\debug\link-static\threading-multi\compile~warn.obj +compile~warn.cpp +compile~warn.cpp(15) : warning C4244: '=' : conversion from 'unsigned long' to 'short', possible loss of data +c:\users\misha\stuff\boost\head\boost\tools\regression\test\compile~warn.cpp(15) : warning C4700: local variable 'ul' used without having been initialized +**passed** ..\..\..\bin.v2\tools\regression\test\compile~warn.test\msvc-7.1\debug\link-static\threading-multi\compile~warn.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\link~fail.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.obj +link~fail.cpp +msvc.link ..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe +link~fail.obj : error LNK2019: unresolved external symbol "int __cdecl f(void)" (?f@@YAHXZ) referenced in function _main +..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe : fatal error LNK1120: 1 unresolved externals + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +link /NOLOGO /INCREMENTAL:NO /DEBUG /subsystem:console /out:"..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe" @"..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe.rsp" + if errorlevel 1 exit %errorlevel% + if exist "..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe.manifest" ( + mt -nologo -manifest "..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe.manifest" "-outputresource:..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe;1" + ) + +...failed msvc.link ..\..\..\bin.v2\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe... +MkDir1 ..\..\..\bin.v2\tools\regression\test\link~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\link~pass.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\link~pass.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\link~pass.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\link~pass.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\link~pass.test\msvc-7.1\debug\link-static\threading-multi\link~pass.obj +link~pass.cpp +msvc.link ..\..\..\bin.v2\tools\regression\test\link~pass.test\msvc-7.1\debug\link-static\threading-multi\link~pass.exe +**passed** ..\..\..\bin.v2\tools\regression\test\link~pass.test\msvc-7.1\debug\link-static\threading-multi\link~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\link-fail~fail.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.obj +link-fail~fail.cpp +msvc.link ..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +link /NOLOGO /INCREMENTAL:NO /DEBUG /subsystem:console /out:"..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe" @"..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe.rsp" + if errorlevel 1 exit %errorlevel% + if exist "..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe.manifest" ( + mt -nologo -manifest "..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe.manifest" "-outputresource:..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe;1" + ) + +...failed msvc.link ..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe... +...removing ..\..\..\bin.v2\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe +MkDir1 ..\..\..\bin.v2\tools\regression\test\link-fail~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\link-fail~pass.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\link-fail~pass.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\link-fail~pass.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\link-fail~pass.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\link-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\link-fail~pass.obj +link-fail~pass.cpp +msvc.link ..\..\..\bin.v2\tools\regression\test\link-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\link-fail~pass.exe +link-fail~pass.obj : error LNK2019: unresolved external symbol "int __cdecl f(void)" (?f@@YAHXZ) referenced in function _main +..\..\..\bin.v2\tools\regression\test\link-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\link-fail~pass.exe : fatal error LNK1120: 1 unresolved externals +(failed-as-expected) ..\..\..\bin.v2\tools\regression\test\link-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\link-fail~pass.exe +**passed** ..\..\..\bin.v2\tools\regression\test\link-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\link-fail~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~compile-fail.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~compile-fail.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~compile-fail.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~compile-fail.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~compile-fail.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run-fail~compile-fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~compile-fail.obj +run-fail~compile-fail.cpp +run-fail~compile-fail.cpp(9) : fatal error C1189: #error : example of a compile failure + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +cl /Zm800 -nologo @"..\..\..\bin.v2\tools\regression\test\run-fail~compile-fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~compile-fail.obj.rsp" + +...failed compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run-fail~compile-fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~compile-fail.obj... +...skipped run-fail~compile-fail.exe for lack of run-fail~compile-fail.obj... +...skipped run-fail~compile-fail.run for lack of run-fail~compile-fail.exe... +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.obj +run-fail~fail-warn.cpp +run-fail~fail-warn.cpp(13) : warning C4244: '=' : conversion from 'unsigned long' to 'short', possible loss of data +c:\users\misha\stuff\boost\head\boost\tools\regression\test\run-fail~fail-warn.cpp(13) : warning C4700: local variable 'ul' used without having been initialized +msvc.link ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.exe +testing.capture-output ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.run + 1 file(s) copied. + + + ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.exe > ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.output 2>&1 + set status=%ERRORLEVEL% + echo. >> ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.output + echo EXIT STATUS: %status% >> ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.output + if %status% EQU 0 ( + copy ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.output ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.run + ) + set verbose=0 + if %status% NEQ 0 ( + set verbose=1 + ) + if %verbose% EQU 1 ( + echo ====== BEGIN OUTPUT ====== + type ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.output + echo ====== END OUTPUT ====== + ) + exit %status% + +...failed testing.capture-output ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.run... +...removing ..\..\..\bin.v2\tools\regression\test\run-fail~fail-warn.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail-warn.run +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.obj +run-fail~fail.cpp +msvc.link ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.exe +testing.capture-output ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.run + 1 file(s) copied. + + + ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.exe > ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.output 2>&1 + set status=%ERRORLEVEL% + echo. >> ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.output + echo EXIT STATUS: %status% >> ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.output + if %status% EQU 0 ( + copy ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.output ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.run + ) + set verbose=0 + if %status% NEQ 0 ( + set verbose=1 + ) + if %verbose% EQU 1 ( + echo ====== BEGIN OUTPUT ====== + type ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.output + echo ====== END OUTPUT ====== + ) + exit %status% + +...failed testing.capture-output ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.run... +...removing ..\..\..\bin.v2\tools\regression\test\run-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~fail.run +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~pass.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~pass.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~pass.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run-fail~pass.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\run-fail~pass.obj +run-fail~pass.cpp +msvc.link ..\..\..\bin.v2\tools\regression\test\run-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\run-fail~pass.exe +testing.capture-output ..\..\..\bin.v2\tools\regression\test\run-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\run-fail~pass.run +====== BEGIN OUTPUT ====== +example of output from a run-time failure + +EXIT STATUS: 1 +====== END OUTPUT ====== + + del /f /q "..\..\..\bin.v2\tools\regression\test\run-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\run-fail~pass.exe" + +...failed RmTemps ..\..\..\bin.v2\tools\regression\test\run-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\run-fail~pass.run... +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~fail.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug +...on 100th target... +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi\run~fail.obj +run~fail.cpp +msvc.link ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi\run~fail.exe +testing.capture-output ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi\run~fail.run +====== BEGIN OUTPUT ====== + +EXIT STATUS: 1 +====== END OUTPUT ====== + + + ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi\run~fail.exe > ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi\run~fail.output 2>&1 + set status=%ERRORLEVEL% + echo. >> ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi\run~fail.output + echo EXIT STATUS: %status% >> ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi\run~fail.output + if %status% EQU 0 ( + copy ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi\run~fail.output ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi\run~fail.run + ) + set verbose=0 + if %status% NEQ 0 ( + set verbose=1 + ) + if %verbose% EQU 1 ( + echo ====== BEGIN OUTPUT ====== + type ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi\run~fail.output + echo ====== END OUTPUT ====== + ) + exit %status% + +...failed testing.capture-output ..\..\..\bin.v2\tools\regression\test\run~fail.test\msvc-7.1\debug\link-static\threading-multi\run~fail.run... +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~note.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~note.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~note.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~note.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~note.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run~note.test\msvc-7.1\debug\link-static\threading-multi\run~note.obj +run~note.cpp +msvc.link ..\..\..\bin.v2\tools\regression\test\run~note.test\msvc-7.1\debug\link-static\threading-multi\run~note.exe +testing.capture-output ..\..\..\bin.v2\tools\regression\test\run~note.test\msvc-7.1\debug\link-static\threading-multi\run~note.run + 1 file(s) copied. +**passed** ..\..\..\bin.v2\tools\regression\test\run~note.test\msvc-7.1\debug\link-static\threading-multi\run~note.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.obj +run~pass.cpp +msvc.link ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.exe +testing.capture-output ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.run + 1 file(s) copied. +**passed** ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~warn-note.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~warn-note.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~warn-note.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~warn-note.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~warn-note.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run~warn-note.test\msvc-7.1\debug\link-static\threading-multi\run~warn-note.obj +run~warn-note.cpp +run~warn-note.cpp(21) : warning C4244: '=' : conversion from 'unsigned long' to 'short', possible loss of data +c:\users\misha\stuff\boost\head\boost\tools\regression\test\run~warn-note.cpp(21) : warning C4700: local variable 'ul' used without having been initialized +msvc.link ..\..\..\bin.v2\tools\regression\test\run~warn-note.test\msvc-7.1\debug\link-static\threading-multi\run~warn-note.exe +testing.capture-output ..\..\..\bin.v2\tools\regression\test\run~warn-note.test\msvc-7.1\debug\link-static\threading-multi\run~warn-note.run + 1 file(s) copied. +**passed** ..\..\..\bin.v2\tools\regression\test\run~warn-note.test\msvc-7.1\debug\link-static\threading-multi\run~warn-note.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~warn.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~warn.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~warn.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~warn.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~warn.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run~warn.test\msvc-7.1\debug\link-static\threading-multi\run~warn.obj +run~warn.cpp +run~warn.cpp(15) : warning C4244: '=' : conversion from 'unsigned long' to 'short', possible loss of data +c:\users\misha\stuff\boost\head\boost\tools\regression\test\run~warn.cpp(15) : warning C4700: local variable 'ul' used without having been initialized +msvc.link ..\..\..\bin.v2\tools\regression\test\run~warn.test\msvc-7.1\debug\link-static\threading-multi\run~warn.exe +testing.capture-output ..\..\..\bin.v2\tools\regression\test\run~warn.test\msvc-7.1\debug\link-static\threading-multi\run~warn.run + 1 file(s) copied. +**passed** ..\..\..\bin.v2\tools\regression\test\run~warn.test\msvc-7.1\debug\link-static\threading-multi\run~warn.test +...failed updating 9 targets... +...skipped 17 targets... +...updated 131 targets... diff --git a/tools/regression/test/test-cases/general/expected/results.xml b/tools/regression/test/test-cases/general/expected/results.xml new file mode 100644 index 0000000000..13224e0113 --- /dev/null +++ b/tools/regression/test/test-cases/general/expected/results.xml @@ -0,0 +1,167 @@ + + +compile-fail~fail.cpp + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +cl /Zm800 -nologo @"C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\compile-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\compile-fail~fail.obj.rsp" + + + + + +compile-fail~pass.cpp +compile-fail~pass.cpp(9) : fatal error C1189: #error : example of a compile failure +(failed-as-expected) C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\compile-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\compile-fail~pass.obj + + + + +compile~fail.cpp +compile~fail.cpp(9) : fatal error C1189: #error : example of a compile failure + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +cl /Zm800 -nologo @"C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\compile~fail.test\msvc-7.1\debug\link-static\threading-multi\compile~fail.obj.rsp" + + + + + +compile~pass.cpp + + + + +compile~warn.cpp +compile~warn.cpp(15) : warning C4244: '=' : conversion from 'unsigned long' to 'short', possible loss of data +c:\users\misha\stuff\boost\head\boost\tools\regression\test\compile~warn.cpp(15) : warning C4700: local variable 'ul' used without having been initialized + + + + +link-fail~fail.cpp + + + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +link /NOLOGO /INCREMENTAL:NO /DEBUG /subsystem:console /out:"C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe" @"C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe.rsp" + if errorlevel 1 exit %errorlevel% + if exist "C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe.manifest" ( + mt -nologo -manifest "C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe.manifest" "-outputresource:C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link-fail~fail.test\msvc-7.1\debug\link-static\threading-multi\link-fail~fail.exe;1" + ) + + + + + +link-fail~pass.cpp + + +link-fail~pass.obj : error LNK2019: unresolved external symbol "int __cdecl f(void)" (?f@@YAHXZ) referenced in function _main +C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\link-fail~pass.exe : fatal error LNK1120: 1 unresolved externals +(failed-as-expected) C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link-fail~pass.test\msvc-7.1\debug\link-static\threading-multi\link-fail~pass.exe + + + + +link~fail.cpp + + +link~fail.obj : error LNK2019: unresolved external symbol "int __cdecl f(void)" (?f@@YAHXZ) referenced in function _main +C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe : fatal error LNK1120: 1 unresolved externals + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +link /NOLOGO /INCREMENTAL:NO /DEBUG /subsystem:console /out:"C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe" @"C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe.rsp" + if errorlevel 1 exit %errorlevel% + if exist "C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe.manifest" ( + mt -nologo -manifest "C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe.manifest" "-outputresource:C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\link~fail.test\msvc-7.1\debug\link-static\threading-multi\link~fail.exe;1" + ) + + + + + +link~pass.cpp + + + + + + +run-fail~compile-fail.cpp +run-fail~compile-fail.cpp(9) : fatal error C1189: #error : example of a compile failure + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +cl /Zm800 -nologo @"C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\general\actual\tools\regression\test\run-fail~compile-fail.test\msvc-7.1\debug\link-static\threading-multi\run-fail~compile-fail.obj.rsp" + + + + + +run-fail~fail-warn.cpp +run-fail~fail-warn.cpp(13) : warning C4244: '=' : conversion from 'unsigned long' to 'short', possible loss of data +c:\users\misha\stuff\boost\head\boost\tools\regression\test\run-fail~fail-warn.cpp(13) : warning C4700: local variable 'ul' used without having been initialized + + + + + + + +run-fail~fail.cpp + + + + + + + +run-fail~pass.cpp + + + + + + + +run~fail.cpp + + + + + + + +run~note.cpp + + + + + + + +run~pass.cpp + + + + + + + +run~warn-note.cpp +run~warn-note.cpp(21) : warning C4244: '=' : conversion from 'unsigned long' to 'short', possible loss of data +c:\users\misha\stuff\boost\head\boost\tools\regression\test\run~warn-note.cpp(21) : warning C4700: local variable 'ul' used without having been initialized + + + + + + + +run~warn.cpp +run~warn.cpp(15) : warning C4244: '=' : conversion from 'unsigned long' to 'short', possible loss of data +c:\users\misha\stuff\boost\head\boost\tools\regression\test\run~warn.cpp(15) : warning C4700: local variable 'ul' used without having been initialized + + + + + diff --git a/tools/regression/test/test-cases/incremental/bjam.log b/tools/regression/test/test-cases/incremental/bjam.log new file mode 100644 index 0000000000..65db0844c2 --- /dev/null +++ b/tools/regression/test/test-cases/incremental/bjam.log @@ -0,0 +1,33 @@ +locate-root "..\..\..\bin.v2" +C:\Users\Misha\Stuff\boost\HEAD\boost\tools\regression\test>C:\Users\Misha\Stuff\boost\HEAD\bin\..\boost\tools\jam\src\bin.ntx86\bjam.exe --dump-tests --v2 msvc-7.1 "-sBOOST_BUILD_PATH=C:\Users\Misha\Stuff\boost\HEAD\bin\.." "-sBOOST_ROOT="C:\Users\Misha\Stuff\boost\HEAD\bin\..\boost" + +boost-test(RUN) "testlib/run~pass" : "tools/regression/test/run~pass.cpp" +boost-test(RUN) "testlib/run~pass" : "tools/regression/test/run~pass2s.cpp" + +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.obj +run~pass.cpp +msvc.link ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.exe +testing.capture-output ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.run + 1 file(s) copied. +**passed** ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.test + +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass2.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.obj +run~pass2.cpp +msvc.link ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.exe +testing.capture-output ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.run + 1 file(s) copied. +**passed** ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.test + +...failed updating 9 targets... +...skipped 17 targets... +...updated 131 targets... diff --git a/tools/regression/test/test-cases/incremental/bjam.log.1 b/tools/regression/test/test-cases/incremental/bjam.log.1 new file mode 100644 index 0000000000..967ed9eb23 --- /dev/null +++ b/tools/regression/test/test-cases/incremental/bjam.log.1 @@ -0,0 +1,38 @@ +locate-root "..\..\..\bin.v2" +C:\Users\Misha\Stuff\boost\HEAD\boost\tools\regression\test>C:\Users\Misha\Stuff\boost\HEAD\bin\..\boost\tools\jam\src\bin.ntx86\bjam.exe --dump-tests --v2 msvc-7.1 "-sBOOST_BUILD_PATH=C:\Users\Misha\Stuff\boost\HEAD\bin\.." "-sBOOST_ROOT="C:\Users\Misha\Stuff\boost\HEAD\bin\..\boost" + +boost-test(RUN) "testlib/run~pass" : "tools/regression/test/run~pass.cpp" + +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.obj +run~pass.cpp + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +cl /Zm800 -nologo @"..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.obj.rsp" + +...failed compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.obj... + +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass2.test +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1 +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static +MkDir1 ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi +compile-c-c++ ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.obj +run~pass2.cpp + +msvc.link ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.exe + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +link /NOLOGO /INCREMENTAL:NO /DEBUG /subsystem:console /out:"..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.exe" @"..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.exe.rsp" + if errorlevel 1 exit %errorlevel% + if exist "..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.exe.manifest" ( + mt -nologo -manifest "..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.exe.manifest" "-outputresource:..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.exe;1" + ) + +...failed msvc.link ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.exe... +...removing ..\..\..\bin.v2\tools\regression\test\run~pass2.test\msvc-7.1\debug\link-static\threading-multi\run~pass2.exe + + +...failed updating 9 targets... +...skipped 17 targets... +...updated 131 targets... diff --git a/tools/regression/test/test-cases/incremental/expected/results.xml b/tools/regression/test/test-cases/incremental/expected/results.xml new file mode 100644 index 0000000000..0580bd588f --- /dev/null +++ b/tools/regression/test/test-cases/incremental/expected/results.xml @@ -0,0 +1,9 @@ + + +run~pass.cpp + + call "C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" >nul +cl /Zm800 -nologo @"C:\users\Misha\Stuff\boost\boost\tools\regression\test\test-cases\incremental\actual\tools\regression\test\run~pass.test\msvc-7.1\debug\link-static\threading-multi\run~pass.obj.rsp" + + + diff --git a/tools/regression/test/test-cases/libs/bjam.log b/tools/regression/test/test-cases/libs/bjam.log new file mode 100644 index 0000000000..41c903dcd4 --- /dev/null +++ b/tools/regression/test/test-cases/libs/bjam.log @@ -0,0 +1,2338 @@ +locate-root "/b/r/rc/results/boost/bin.v2" +boost-test(COMPILE_FAIL) "test_thread_fail2" : "libs/config/test/threads/test_thread_fail2.cpp" +boost-test(COMPILE_FAIL) "test_thread_fail1" : "libs/config/test/threads/test_thread_fail1.cpp" +boost-test(RUN) "config_link_test" : "libs/config/test/link/main.cpp" +boost-test(RUN) "limits_test" : "libs/config/test/limits_test.cpp" +boost-test(RUN) "abi_test" : "libs/config/test/abi/abi_test.cpp" "libs/config/test/abi/main.cpp" +boost-test(RUN) "math_info" ["always_show_run_output"] : "libs/config/test/math_info.cpp" +boost-test(RUN) "config_info" ["always_show_run_output"] : "libs/config/test/config_info.cpp" +boost-test(RUN) "config_test" : "libs/config/test/config_test.cpp" +boost-test(RUN) "array5" : "libs/array/array5.cpp" +boost-test(RUN) "array4" : "libs/array/array4.cpp" +boost-test(RUN) "array3" : "libs/array/array3.cpp" +boost-test(RUN) "array2" : "libs/array/array2.cpp" +boost-test(RUN) "array1" : "libs/array/array1.cpp" +boost-test(RUN) "array0" : "libs/array/array0.cpp" +boost-test(RUN) "crc_test" : "libs/crc/crc_test.cpp" +boost-test(RUN) "disjoint_set_test" : "libs/disjoint_sets/disjoint_set_test.cpp" +boost-test(RUN) "function_test" : "libs/functional/function_test.cpp" +boost-test(RUN) "integer_traits_test" : "libs/integer/integer_traits_test.cpp" +boost-test(RUN) "integer_test" : "libs/integer/integer_test.cpp" +boost-test(RUN) "cstdint_test" : "libs/integer/cstdint_test.cpp" +boost-test(RUN) "switch_construct" : "libs/lambda/test/switch_construct.cpp" +boost-test(RUN) "phoenix_control_structures" : "libs/lambda/test/phoenix_control_structures.cpp" +boost-test(RUN) "operator_tests_simple" : "libs/lambda/test/operator_tests_simple.cpp" +boost-test(RUN) "member_pointer_test" : "libs/lambda/test/member_pointer_test.cpp" +boost-test(RUN) "is_instance_of_test" : "libs/lambda/test/is_instance_of_test.cpp" +boost-test(RUN) "extending_rt_traits" : "libs/lambda/test/extending_rt_traits.cpp" +boost-test(RUN) "exception_test" : "libs/lambda/test/exception_test.cpp" +boost-test(RUN) "control_structures" : "libs/lambda/test/control_structures.cpp" +boost-test(RUN) "constructor_tests" : "libs/lambda/test/constructor_tests.cpp" +boost-test(RUN) "lambda_cast_test" : "libs/lambda/test/cast_test.cpp" +boost-test(RUN) "bll_and_function" : "libs/lambda/test/bll_and_function.cpp" +boost-test(RUN) "bind_tests_simple_f_refs" : "libs/lambda/test/bind_tests_simple_f_refs.cpp" +boost-test(RUN) "bind_tests_advanced" : "libs/lambda/test/bind_tests_advanced.cpp" +boost-test(RUN) "bind_tests_simple" : "libs/lambda/test/bind_tests_simple.cpp" +boost-test(RUN) "algorithm_test" : "libs/lambda/test/algorithm_test.cpp" +boost-test(RUN) "test_pool_alloc" : "libs/pool/test/test_pool_alloc.cpp" +boost-test(COMPILE) "tuple" : "libs/preprocessor/test/tuple.cpp" +boost-test(COMPILE) "slot" : "libs/preprocessor/test/slot.cpp" +boost-test(COMPILE) "seq" : "libs/preprocessor/test/seq.cpp" +boost-test(COMPILE) "selection" : "libs/preprocessor/test/selection.cpp" +boost-test(COMPILE) "repetition" : "libs/preprocessor/test/repetition.cpp" +boost-test(COMPILE) "logical" : "libs/preprocessor/test/logical.cpp" +boost-test(COMPILE) "list" : "libs/preprocessor/test/list.cpp" +boost-test(COMPILE) "iteration" : "libs/preprocessor/test/iteration.cpp" +boost-test(COMPILE) "facilities" : "libs/preprocessor/test/facilities.cpp" +boost-test(COMPILE) "debug" : "libs/preprocessor/test/debug.cpp" +boost-test(COMPILE) "control" : "libs/preprocessor/test/control.cpp" +boost-test(COMPILE) "comparison" : "libs/preprocessor/test/comparison.cpp" +boost-test(COMPILE) "array" : "libs/preprocessor/test/array.cpp" +boost-test(COMPILE) "arithmetic" : "libs/preprocessor/test/arithmetic.cpp" +boost-test(RUN) "rational_test" : "libs/rational/rational_test.cpp" +boost-test(RUN) "rational_example" : "libs/rational/rational_example.cpp" +boost-test(COMPILE) "timer_test" : "libs/timer/timer_test.cpp" +boost-test(RUN) "simple_example_5" : "libs/tokenizer/simple_example_5.cpp" +boost-test(RUN) "simple_example_4" : "libs/tokenizer/simple_example_4.cpp" +boost-test(RUN) "simple_example_3" : "libs/tokenizer/simple_example_3.cpp" +boost-test(RUN) "simple_example_2" : "libs/tokenizer/simple_example_2.cpp" +boost-test(RUN) "simple_example_1" : "libs/tokenizer/simple_example_1.cpp" +boost-test(RUN) "examples" : "libs/tokenizer/examples.cpp" +boost-test(RUN) "io_test" : "libs/tuple/test/io_test.cpp" +boost-test(RUN) "tuple_test_bench" : "libs/tuple/test/tuple_test_bench.cpp" +boost-test(RUN) "algorithm/minmax/minmax" : "libs/algorithm/minmax/test/minmax_test.cpp" +boost-test(RUN) "algorithm/minmax/minmax_element" : "libs/algorithm/minmax/test/minmax_element_test.cpp" +boost-test(RUN) "algorithm/string/regex" : "libs/algorithm/string/test/regex_test.cpp" +boost-test(RUN) "algorithm/string/replace" : "libs/algorithm/string/test/replace_test.cpp" +boost-test(RUN) "algorithm/string/join" : "libs/algorithm/string/test/join_test.cpp" +boost-test(RUN) "algorithm/string/split" : "libs/algorithm/string/test/split_test.cpp" +boost-test(RUN) "algorithm/string/find" : "libs/algorithm/string/test/find_test.cpp" +boost-test(RUN) "algorithm/string/predicate" : "libs/algorithm/string/test/predicate_test.cpp" +boost-test(RUN) "algorithm/string/conv" : "libs/algorithm/string/test/conv_test.cpp" +boost-test(RUN) "algorithm/string/trim" : "libs/algorithm/string/test/trim_test.cpp" +boost-test(RUN) "assign/multi_index_container" : "libs/assign/test/multi_index_container.cpp" +boost-test(RUN) "assign/my_vector_example" : "libs/assign/test/my_vector_example.cpp" +boost-test(RUN) "assign/email_example" : "libs/assign/test/email_example.cpp" +boost-test(RUN) "assign/list_of_workaround" : "libs/assign/test/list_of_workaround.cpp" +boost-test(RUN) "assign/ptr_map_inserter" : "libs/assign/test/ptr_map_inserter.cpp" +boost-test(RUN) "assign/ptr_list_inserter" : "libs/assign/test/ptr_list_inserter.cpp" +boost-test(RUN) "assign/list_inserter" : "libs/assign/test/list_inserter.cpp" +boost-test(RUN) "assign/tuple_list_of" : "libs/assign/test/tuple_list_of.cpp" +boost-test(RUN) "assign/static_list_of" : "libs/assign/test/static_list_of.cpp" +boost-test(RUN) "assign/ptr_list_of" : "libs/assign/test/ptr_list_of.cpp" +boost-test(RUN) "assign/list_of" : "libs/assign/test/list_of.cpp" +boost-test(RUN) "assign/std" : "libs/assign/test/std.cpp" +boost-test(RUN) "assign/basic" : "libs/assign/test/basic.cpp" +boost-test(RUN) "any/any_to_ref_test" : "libs/any/test/any_to_ref_test.cpp" +boost-test(RUN) "any/any_test" : "libs/any/any_test.cpp" +boost-test(RUN) "bind/mem_fn_rv_test" : "libs/bind/test/mem_fn_rv_test.cpp" +boost-test(RUN) "bind/mem_fn_dm_test" : "libs/bind/test/mem_fn_dm_test.cpp" +boost-test(RUN) "bind/mem_fn_eq_test" : "libs/bind/test/mem_fn_eq_test.cpp" +boost-test(RUN) "bind/mem_fn_derived_test" : "libs/bind/test/mem_fn_derived_test.cpp" +boost-test(RUN) "bind/mem_fn_void_test" : "libs/bind/test/mem_fn_void_test.cpp" +boost-test(RUN) "bind/mem_fn_test" : "libs/bind/test/mem_fn_test.cpp" +boost-test(RUN) "bind/bind_visit_test" : "libs/bind/test/bind_visit_test.cpp" +boost-test(RUN) "bind/bind_dm3_test" : "libs/bind/test/bind_dm3_test.cpp" +boost-test(COMPILE) "bind/bind_unary_addr" : "libs/bind/test/bind_unary_addr.cpp" +boost-test(RUN) "bind/bind_rv_sp_test" : "libs/bind/test/bind_rv_sp_test.cpp" +boost-test(RUN) "bind/bind_lookup_problem_test" : "libs/bind/test/bind_lookup_problem_test.cpp" +boost-test(RUN) "bind/bind_function_test" : "libs/bind/test/bind_function_test.cpp" +boost-test(RUN) "bind/bind_rel_test" : "libs/bind/test/bind_rel_test.cpp" +boost-test(RUN) "bind/bind_not_test" : "libs/bind/test/bind_not_test.cpp" +boost-test(RUN) "bind/bind_dm2_test" : "libs/bind/test/bind_dm2_test.cpp" +boost-test(RUN) "bind/bind_stateful_test" : "libs/bind/test/bind_stateful_test.cpp" +boost-test(RUN) "bind/bind_cv_test" : "libs/bind/test/bind_cv_test.cpp" +boost-test(RUN) "bind/bind_const_test" : "libs/bind/test/bind_const_test.cpp" +boost-test(RUN) "bind/bind_eq_test" : "libs/bind/test/bind_eq_test.cpp" +boost-test(RUN) "bind/bind_dm_test" : "libs/bind/test/bind_dm_test.cpp" +boost-test(RUN) "bind/bind_test" : "libs/bind/test/bind_test.cpp" +boost-test(COMPILE_FAIL) "concept_check/class_concept_fail_expected" : "libs/concept_check/class_concept_fail_expected.cpp" +boost-test(COMPILE_FAIL) "concept_check/concept_check_fail_expected" : "libs/concept_check/concept_check_fail_expected.cpp" +boost-test(RUN) "concept_check/class_concept_check_test" : "libs/concept_check/class_concept_check_test.cpp" +boost-test(RUN) "concept_check/concept_check_test" : "libs/concept_check/concept_check_test.cpp" +boost-test(RUN) "concept_check/stl_concept_covering" : "libs/concept_check/stl_concept_covering.cpp" +boost-test(RUN) "conversion/lexical_cast_test" : "libs/conversion/lexical_cast_test.cpp" +boost-test(RUN) "conversion/numeric_cast_test" : "libs/conversion/numeric_cast_test.cpp" +boost-test(RUN) "conversion/cast_test" : "libs/conversion/cast_test.cpp" +boost-test(COMPILE_FAIL) "conversion/implicit_cast_fail" : "libs/conversion/test/implicit_cast_fail.cpp" +boost-test(RUN) "conversion/implicit_cast" : "libs/conversion/test/implicit_cast.cpp" +boost-test(RUN) "date_time/testgeneric_period" : "libs/date_time/test/testgeneric_period.cpp" +boost-test(RUN) "date_time/testgregorian_calendar" : "libs/date_time/test/testgregorian_calendar.cpp" +boost-test(RUN) "date_time/testconstrained_value" : "libs/date_time/test/testconstrained_value.cpp" +boost-test(RUN) "date_time/testwrapping_int" : "libs/date_time/test/testwrapping_int.cpp" +boost-test(RUN) "date_time/testtime_resolution_traits" : "libs/date_time/test/testtime_resolution_traits.cpp" +boost-test(RUN) "date_time/testint_adapter" : "libs/date_time/test/testint_adapter.cpp" +boost-test(RUN) "date_time/testgreg_year" : "libs/date_time/test/gregorian/testgreg_year.cpp" +boost-test(RUN) "date_time/testgreg_month" : "libs/date_time/test/gregorian/testgreg_month.cpp" +boost-test(RUN) "date_time/testgreg_day" : "libs/date_time/test/gregorian/testgreg_day.cpp" +boost-test(RUN) "date_time/testgreg_cal" : "libs/date_time/test/gregorian/testgreg_cal.cpp" +boost-test(RUN) "date_time/testgenerators" : "libs/date_time/test/gregorian/testgenerators.cpp" +boost-test(RUN) "date_time/testdate_input_facet" : "libs/date_time/test/gregorian/testdate_input_facet.cpp" +boost-test(RUN) "date_time/testdate_facet_new" : "libs/date_time/test/gregorian/testdate_facet_new.cpp" +boost-test(RUN) "date_time/testformatters" : "libs/date_time/test/gregorian/testformatters.cpp" +boost-test(RUN) "date_time/testdate_iterator" : "libs/date_time/test/gregorian/testdate_iterator.cpp" +boost-test(RUN) "date_time/testperiod" : "libs/date_time/test/gregorian/testperiod.cpp" +boost-test(RUN) "date_time/testgreg_durations" : "libs/date_time/test/gregorian/testgreg_durations.cpp" +boost-test(RUN) "date_time/testdate_duration" : "libs/date_time/test/gregorian/testdate_duration.cpp" +boost-test(RUN) "date_time/testdate" : "libs/date_time/test/gregorian/testdate.cpp" +boost-test(RUN) "date_time/testgreg_durations_dll" : "libs/date_time/test/gregorian/testgreg_durations.cpp" +boost-test(RUN) "date_time/testgreg_year_dll" : "libs/date_time/test/gregorian/testgreg_year.cpp" +boost-test(RUN) "date_time/testgreg_month_dll" : "libs/date_time/test/gregorian/testgreg_month.cpp" +boost-test(RUN) "date_time/testgreg_day_dll" : "libs/date_time/test/gregorian/testgreg_day.cpp" +boost-test(RUN) "date_time/testgreg_cal_dll" : "libs/date_time/test/gregorian/testgreg_cal.cpp" +boost-test(RUN) "date_time/testgenerators_dll" : "libs/date_time/test/gregorian/testgenerators.cpp" +boost-test(RUN) "date_time/testdate_input_facet_dll" : "libs/date_time/test/gregorian/testdate_input_facet.cpp" +boost-test(RUN) "date_time/testdate_facet_new_dll" : "libs/date_time/test/gregorian/testdate_facet_new.cpp" +boost-test(RUN) "date_time/testformatters_dll" : "libs/date_time/test/gregorian/testformatters.cpp" +boost-test(RUN) "date_time/testdate_iterator_dll" : "libs/date_time/test/gregorian/testdate_iterator.cpp" +boost-test(RUN) "date_time/testperiod_dll" : "libs/date_time/test/gregorian/testperiod.cpp" +boost-test(RUN) "date_time/testdate_duration_dll" : "libs/date_time/test/gregorian/testdate_duration.cpp" +boost-test(RUN) "date_time/testdate_dll" : "libs/date_time/test/gregorian/testdate.cpp" +boost-test(RUN) "date_time/testtime_input_facet" : "libs/date_time/test/posix_time/testtime_input_facet.cpp" +boost-test(RUN) "date_time/testtime_facet" : "libs/date_time/test/posix_time/testtime_facet.cpp" +boost-test(RUN) "date_time/testgreg_duration_operators" : "libs/date_time/test/posix_time/testgreg_duration_operators.cpp" +boost-test(RUN) "date_time/testtime_formatters" : "libs/date_time/test/posix_time/testtime_formatters.cpp" +boost-test(RUN) "date_time/testmicrosec_time_clock" : "libs/date_time/test/posix_time/testmicrosec_time_clock.cpp" +boost-test(RUN) "date_time/testtime" : "libs/date_time/test/posix_time/testtime.cpp" +boost-test(RUN) "date_time/testtime_period" : "libs/date_time/test/posix_time/testtime_period.cpp" +boost-test(RUN) "date_time/testparse_time" : "libs/date_time/test/posix_time/testparse_time.cpp" +boost-test(RUN) "date_time/testiterator" : "libs/date_time/test/posix_time/testiterator.cpp" +boost-test(RUN) "date_time/testduration" : "libs/date_time/test/posix_time/testduration.cpp" +boost-test(RUN) "date_time/testdst_rules" : "libs/date_time/test/posix_time/testdst_rules.cpp" +boost-test(RUN) "date_time/testclock" : "libs/date_time/test/posix_time/testclock.cpp" +boost-test(RUN) "date_time/testc_local_adjustor" : "libs/date_time/test/posix_time/testc_local_adjustor.cpp" +boost-test(RUN) "date_time/testlocal_adjustor" : "libs/date_time/test/posix_time/testlocal_adjustor.cpp" +boost-test(RUN) "date_time/testfiletime_functions" : "libs/date_time/test/posix_time/testfiletime_functions.cpp" +boost-test(RUN) "date_time/testtime_wstream" : "libs/date_time/test/posix_time/testtime_wstream.cpp" +boost-test(RUN) "date_time/testgreg_wstream" : "libs/date_time/test/gregorian/testgreg_wstream.cpp" +boost-test(RUN) "date_time/teststreams" : "libs/date_time/test/posix_time/teststreams.cpp" +boost-test(RUN) "date_time/testparse_date" : "libs/date_time/test/gregorian/testparse_date.cpp" +boost-test(RUN) "date_time/testfacet" : "libs/date_time/test/gregorian/testfacet.cpp" +boost-test(RUN) "date_time/testfacet_dll" : "libs/date_time/test/gregorian/testfacet.cpp" +boost-test(RUN) "date_time/testclocks" : "libs/date_time/test/local_time/testclocks.cpp" +boost-test(RUN) "date_time/testlocal_time_input_facet" : "libs/date_time/test/local_time/testlocal_time_input_facet.cpp" +boost-test(RUN) "date_time/testlocal_time_facet" : "libs/date_time/test/local_time/testlocal_time_facet.cpp" +boost-test(RUN) "date_time/testlocal_time_period" : "libs/date_time/test/local_time/testlocal_time_period.cpp" +boost-test(RUN) "date_time/testlocal_time_iterator" : "libs/date_time/test/local_time/testlocal_time_iterator.cpp" +boost-test(RUN) "date_time/testlocal_time" : "libs/date_time/test/local_time/testlocal_time.cpp" +boost-test(RUN) "date_time/testtz_database" : "libs/date_time/test/local_time/testtz_database.cpp" +boost-test(RUN) "date_time/testwposix_time_zone" : "libs/date_time/test/local_time/testwposix_time_zone.cpp" +boost-test(RUN) "date_time/testwcustom_time_zone" : "libs/date_time/test/local_time/testwcustom_time_zone.cpp" +boost-test(RUN) "date_time/testposix_time_zone" : "libs/date_time/test/local_time/testposix_time_zone.cpp" +boost-test(RUN) "date_time/testcustom_time_zone" : "libs/date_time/test/local_time/testcustom_time_zone.cpp" +boost-test(RUN) "date_time/testdst_transition_day_rule" : "libs/date_time/test/local_time/testdst_transition_day_rule.cpp" +boost-test(RUN) "date_time/testtime_serialize" : "libs/date_time/test/posix_time/testtime_serialize.cpp" +boost-test(RUN) "date_time/testtime_serialize_std_config" : "libs/date_time/test/posix_time/testtime_serialize.cpp" +boost-test(RUN) "date_time/testgreg_serialize_dll" : "libs/date_time/test/gregorian/testgreg_serialize.cpp" +boost-test(RUN) "date_time/testgreg_serialize" : "libs/date_time/test/gregorian/testgreg_serialize.cpp" +boost-test(RUN) "date_time/testtime_serialize_xml" : "libs/date_time/test/posix_time/testtime_serialize.cpp" +boost-test(RUN) "date_time/testtime_serialize_xml_std_config" : "libs/date_time/test/posix_time/testtime_serialize.cpp" +boost-test(RUN) "date_time/testgreg_serialize_xml" : "libs/date_time/test/gregorian/testgreg_serialize.cpp" +boost-test(RUN) "dynamic_bitset/dyn_bitset_unit_tests4" : "libs/dynamic_bitset/dyn_bitset_unit_tests4.cpp" +boost-test(RUN) "dynamic_bitset/dyn_bitset_unit_tests3" : "libs/dynamic_bitset/dyn_bitset_unit_tests3.cpp" +boost-test(RUN) "dynamic_bitset/dyn_bitset_unit_tests2" : "libs/dynamic_bitset/dyn_bitset_unit_tests2.cpp" +boost-test(RUN) "dynamic_bitset/dyn_bitset_unit_tests1" : "libs/dynamic_bitset/dyn_bitset_unit_tests1.cpp" +boost-test(COMPILE) "filesystem/simple_ls" : "libs/filesystem/example/simple_ls.cpp" +boost-test(COMPILE) "filesystem/mbpath" : "libs/filesystem/example/mbpath.cpp" +boost-test(COMPILE) "filesystem/mbcopy" : "libs/filesystem/example/mbcopy.cpp" +boost-test(RUN) "filesystem/wide_test" : "libs/filesystem/test/wide_test.cpp" +boost-test(RUN) "filesystem/large_file_support_test" : "libs/filesystem/test/large_file_support_test.cpp" +boost-test(RUN) "filesystem/convenience_test" : "libs/filesystem/test/convenience_test.cpp" +boost-test(RUN) "filesystem/fstream_test" : "libs/filesystem/test/fstream_test.cpp" +boost-test(RUN) "filesystem/operations_test_dll" : "libs/filesystem/test/operations_test.cpp" +boost-test(RUN) "filesystem/operations_test" : "libs/filesystem/test/operations_test.cpp" +boost-test(RUN) "filesystem/path_test_dll" : "libs/filesystem/test/path_test.cpp" +boost-test(RUN) "filesystem/path_test" : "libs/filesystem/test/path_test.cpp" +boost-test(COMPILE) "foreach/noncopyable" : "libs/foreach/test/noncopyable.cpp" +boost-test(RUN) "foreach/dependent_type" : "libs/foreach/test/dependent_type.cpp" +boost-test(RUN) "foreach/rvalue_nonconst" : "libs/foreach/test/rvalue_nonconst.cpp" +boost-test(RUN) "foreach/rvalue_const" : "libs/foreach/test/rvalue_const.cpp" +boost-test(RUN) "foreach/call_once" : "libs/foreach/test/call_once.cpp" +boost-test(RUN) "foreach/user_defined" : "libs/foreach/test/user_defined.cpp" +boost-test(RUN) "foreach/pair_byref" : "libs/foreach/test/pair_byref.cpp" +boost-test(RUN) "foreach/pair_byval" : "libs/foreach/test/pair_byval.cpp" +boost-test(RUN) "foreach/cstr_byref" : "libs/foreach/test/cstr_byref.cpp" +boost-test(RUN) "foreach/cstr_byval" : "libs/foreach/test/cstr_byval.cpp" +boost-test(RUN) "foreach/array_byref" : "libs/foreach/test/array_byref.cpp" +boost-test(RUN) "foreach/array_byval" : "libs/foreach/test/array_byval.cpp" +boost-test(RUN) "foreach/stl_byref" : "libs/foreach/test/stl_byref.cpp" +boost-test(RUN) "foreach/stl_byval" : "libs/foreach/test/stl_byval.cpp" +boost-test(RUN) "format/format_test_wstring" : "libs/format/test/format_test_wstring.cpp" +boost-test(RUN) "format/format_test3" : "libs/format/test/format_test3.cpp" +boost-test(RUN) "format/format_test2" : "libs/format/test/format_test2.cpp" +boost-test(RUN) "format/format_test1" : "libs/format/test/format_test1.cpp" +boost-test(RUN) "function/contains2_test" : "libs/function/test/contains2_test.cpp" +boost-test(RUN) "function/contains_test" : "libs/function/test/contains_test.cpp" +boost-test(RUN) "function/function_ref_portable" : "libs/function/test/function_ref_portable.cpp" +boost-test(RUN) "function/function_ref_cxx98" : "libs/function/test/function_ref_cxx98.cpp" +boost-test(RUN) "function/std_bind_portable" : "libs/function/test/std_bind_portable.cpp" +boost-test(RUN) "function/std_bind_cxx98" : "libs/function/test/std_bind_cxx98.cpp" +boost-test(RUN) "function/mem_fun_portable" : "libs/function/test/mem_fun_portable.cpp" +boost-test(RUN) "function/mem_fun_cxx98" : "libs/function/test/mem_fun_cxx98.cpp" +boost-test(RUN) "function/sum_avg_portable" : "libs/function/test/sum_avg_portable.cpp" +boost-test(RUN) "function/sum_avg_cxx98" : "libs/function/test/sum_avg_cxx98.cpp" +boost-test(RUN) "function/function_arith_portable" : "libs/function/test/function_arith_portable.cpp" +boost-test(RUN) "function/function_arith_cxx98" : "libs/function/test/function_arith_cxx98.cpp" +boost-test(COMPILE) "function/function_30" : "libs/function/test/function_30.cpp" +boost-test(COMPILE_FAIL) "function/function_test_fail2" : "libs/function/test/function_test_fail2.cpp" +boost-test(COMPILE_FAIL) "function/function_test_fail1" : "libs/function/test/function_test_fail1.cpp" +boost-test(RUN) "function/lambda_test" : "libs/function/test/lambda_test.cpp" +boost-test(RUN) "function/stateless_test" : "libs/function/test/stateless_test.cpp" +boost-test(RUN) "function/allocator_test" : "libs/function/test/allocator_test.cpp" +boost-test(RUN) "function/function_n_test" : "libs/function/test/function_n_test.cpp" +boost-test(RUN) "function/lib_function_test" : "libs/function/test/function_test.cpp" +boost-test(RUN) "functional/hash/hash_no_ext_macro_2" : "libs/functional/hash/test/hash_no_ext_macro_2.cpp" +boost-test(RUN) "functional/hash/hash_no_ext_macro_1" : "libs/functional/hash/test/hash_no_ext_macro_1.cpp" +boost-test(COMPILE_FAIL) "functional/hash/hash_no_ext_fail_test" : "libs/functional/hash/test/hash_no_ext_fail_test.cpp" +boost-test(RUN) "functional/hash/container_fwd_test" : "libs/functional/hash/test/container_fwd_test.cpp" +boost-test(RUN) "functional/hash/link_ext_test" : "libs/functional/hash/test/link_ext_test.cpp" "libs/functional/hash/test/link_no_ext_test.cpp" +boost-test(RUN) "functional/hash/link_test" : "libs/functional/hash/test/link_test.cpp" "libs/functional/hash/test/link_test_2.cpp" +boost-test(RUN) "functional/hash/hash_map_test" : "libs/functional/hash/test/hash_map_test.cpp" +boost-test(RUN) "functional/hash/hash_set_test" : "libs/functional/hash/test/hash_set_test.cpp" +boost-test(RUN) "functional/hash/hash_deque_test" : "libs/functional/hash/test/hash_deque_test.cpp" +boost-test(RUN) "functional/hash/hash_list_test" : "libs/functional/hash/test/hash_list_test.cpp" +boost-test(RUN) "functional/hash/hash_vector_test" : "libs/functional/hash/test/hash_vector_test.cpp" +boost-test(RUN) "functional/hash/hash_value_array_test" : "libs/functional/hash/test/hash_value_array_test.cpp" +boost-test(RUN) "functional/hash/hash_built_in_array_test" : "libs/functional/hash/test/hash_built_in_array_test.cpp" +boost-test(RUN) "functional/hash/hash_friend_test" : "libs/functional/hash/test/hash_friend_test.cpp" +boost-test(RUN) "functional/hash/hash_global_namespace_test" : "libs/functional/hash/test/hash_global_namespace_test.cpp" +boost-test(RUN) "functional/hash/hash_custom_test" : "libs/functional/hash/test/hash_custom_test.cpp" +boost-test(RUN) "functional/hash/hash_range_test" : "libs/functional/hash/test/hash_range_test.cpp" +boost-test(RUN) "functional/hash/hash_string_test" : "libs/functional/hash/test/hash_string_test.cpp" +boost-test(RUN) "functional/hash/hash_float_test" ["always_show_run_output"] : "libs/functional/hash/test/hash_float_test.cpp" +boost-test(RUN) "functional/hash/hash_function_pointer_test" : "libs/functional/hash/test/hash_function_pointer_test.cpp" +boost-test(RUN) "functional/hash/hash_pointer_test" : "libs/functional/hash/test/hash_pointer_test.cpp" +boost-test(RUN) "functional/hash/hash_number_test" : "libs/functional/hash/test/hash_number_test.cpp" +boost-test(RUN) "functional/hash/hash_fwd_test_2" : "libs/functional/hash/test/hash_fwd_test_2.cpp" +boost-test(RUN) "functional/hash/hash_fwd_test_1" : "libs/functional/hash/test/hash_fwd_test_1.cpp" +boost-test(RUN) "graph/matching_test" : "libs/graph/test/matching_test.cpp" +boost-test(RUN) "graph/king_ordering" : "libs/graph/test/king_ordering.cpp" +boost-test(RUN) "graph/cuthill_mckee_ordering" : "libs/graph/test/cuthill_mckee_ordering.cpp" +boost-test(RUN) "graph/biconnected_components_test" : "libs/graph/test/biconnected_components_test.cpp" +boost-test(RUN) "graph/astar_search_test" : "libs/graph/test/astar_search_test.cpp" +boost-test(RUN) "graph/floyd_warshall_test" : "libs/graph/test/floyd_warshall_test.cpp" +boost-test(RUN) "graph/bundled_properties" : "libs/graph/test/bundled_properties.cpp" +boost-test(COMPILE) "graph/property_iter" : "libs/graph/test/property_iter.cpp" +boost-test(COMPILE) "graph/copy" : "libs/graph/test/copy.cpp" +boost-test(COMPILE) "graph/vector_graph_cc" : "libs/graph/test/vector_graph_cc.cpp" +boost-test(RUN) "graph/adjacency_matrix_test" : "libs/graph/test/adjacency_matrix_test.cpp" +boost-test(RUN) "graph/isomorphism" : "libs/graph/test/isomorphism.cpp" +boost-test(RUN) "graph/subgraph" : "libs/graph/test/subgraph.cpp" +boost-test(RUN) "graph/sequential_vertex_coloring" : "libs/graph/test/sequential_vertex_coloring.cpp" +boost-test(COMPILE) "graph/reverse_graph_cc" : "libs/graph/test/reverse_graph_cc.cpp" +boost-test(RUN) "graph/serialize" : "libs/graph/test/serialize.cpp" +boost-test(RUN) "graph/layout_test" ["always_show_run_output"] : "libs/graph/test/layout_test.cpp" +boost-test(RUN) "graph/gursoy_atun_layout_test" : "libs/graph/test/gursoy_atun_layout_test.cpp" +boost-test(RUN) "graph/graphviz_test" : "libs/graph/test/graphviz_test.cpp" +boost-test(COMPILE) "graph/graph_concepts" : "libs/graph/test/graph_concepts.cpp" +boost-test(RUN) "graph/graph" : "libs/graph/test/graph.cpp" +boost-test(COMPILE) "graph/filtered_graph_cc" : "libs/graph/test/filtered_graph_cc.cpp" +boost-test(COMPILE) "graph/edge_list_cc" : "libs/graph/test/edge_list_cc.cpp" +boost-test(RUN) "graph/relaxed_heap_test" : "libs/graph/test/relaxed_heap_test.cpp" +boost-test(RUN) "graph/dominator_tree_test" : "libs/graph/test/dominator_tree_test.cpp" +boost-test(RUN) "graph/dijkstra_heap_performance" : "libs/graph/test/dijkstra_heap_performance.cpp" +boost-test(COMPILE) "graph/dijkstra_cc" : "libs/graph/test/dijkstra_cc.cpp" +boost-test(COMPILE) "graph/dfs_cc" : "libs/graph/test/dfs_cc.cpp" +boost-test(RUN) "graph/dfs" : "libs/graph/test/dfs.cpp" +boost-test(RUN) "graph/dag_longest_paths" : "libs/graph/test/dag_longest_paths.cpp" +boost-test(RUN) "graph/csr_graph_test" : "libs/graph/test/csr_graph_test.cpp" +boost-test(RUN) "graph/bidir_remove_edge" : "libs/graph/test/bidir_remove_edge.cpp" +boost-test(RUN) "graph/betweenness_centrality_test" : "libs/graph/test/betweenness_centrality_test.cpp" +boost-test(RUN) "graph/bellman-test" : "libs/graph/test/bellman-test.cpp" +boost-test(COMPILE) "graph/bfs_cc" : "libs/graph/test/bfs_cc.cpp" +boost-test(RUN) "graph/bfs" : "libs/graph/test/bfs.cpp" +boost-test(COMPILE) "graph/adj_matrix_cc" : "libs/graph/test/adj_matrix_cc.cpp" +boost-test(RUN) "graph/adj_list_edge_list_set" : "libs/graph/test/adj_list_edge_list_set.cpp" +boost-test(COMPILE) "graph/adj_list_cc" : "libs/graph/test/adj_list_cc.cpp" +boost-test(RUN) "graph/transitive_closure_test" : "libs/graph/test/transitive_closure_test.cpp" +boost-test(RUN) "io/ios_state_test" : "libs/io/test/ios_state_test.cpp" +boost-test(RUN) "io/ios_state_unit_test" : "libs/io/test/ios_state_unit_test.cpp" +boost-test(RUN) "iostreams/wide_stream_test" : "libs/iostreams/test/wide_stream_test.cpp" +boost-test(RUN) "iostreams/tee_test" : "libs/iostreams/test/tee_test.cpp" +boost-test(RUN) "iostreams/symmetric_filter_test" : "libs/iostreams/test/symmetric_filter_test.cpp" +boost-test(RUN) "iostreams/stdio_filter_test" : "libs/iostreams/test/stdio_filter_test.cpp" +boost-test(RUN) "iostreams/seekable_filter_test" : "libs/iostreams/test/seekable_filter_test.cpp" +boost-test(RUN) "iostreams/seekable_file_test" : "libs/iostreams/test/seekable_file_test.cpp" +boost-test(RUN) "iostreams/restrict_test" : "libs/iostreams/test/restrict_test.cpp" +boost-test(RUN) "iostreams/regex_filter_test" : "libs/iostreams/test/regex_filter_test.cpp" +boost-test(RUN) "iostreams/positioning_test" : "libs/iostreams/test/positioning_test.cpp" +boost-test(RUN) "iostreams/pipeline_test" : "libs/iostreams/test/pipeline_test.cpp" +boost-test(RUN) "iostreams/null_test" : "libs/iostreams/test/null_test.cpp" +boost-test(RUN) "iostreams/newline_test" : "libs/iostreams/test/newline_test.cpp" +boost-test(RUN) "iostreams/mapped_file_test" : "libs/iostreams/test/mapped_file_test.cpp" "libs/iostreams/src/mapped_file.cpp" +boost-test(RUN) "iostreams/line_filter_test" : "libs/iostreams/test/line_filter_test.cpp" +boost-test(RUN) "iostreams/invert_test" : "libs/iostreams/test/invert_test.cpp" +boost-test(RUN) "iostreams/flush_test" : "libs/iostreams/test/flush_test.cpp" +boost-test(RUN) "iostreams/finite_state_filter_test" : "libs/iostreams/test/finite_state_filter_test.cpp" +boost-test(RUN) "iostreams/filtering_stream_test" : "libs/iostreams/test/filtering_stream_test.cpp" +boost-test(RUN) "iostreams/file_descriptor_test" : "libs/iostreams/test/file_descriptor_test.cpp" "libs/iostreams/src/file_descriptor.cpp" +boost-test(RUN) "iostreams/file_test" : "libs/iostreams/test/file_test.cpp" +boost-test(RUN) "iostreams/example_test" : "libs/iostreams/test/example_test.cpp" +boost-test(RUN) "iostreams/direct_adapter_test" : "libs/iostreams/test/direct_adapter_test.cpp" +boost-test(RUN) "iostreams/counter_test" : "libs/iostreams/test/counter_test.cpp" +boost-test(RUN) "iostreams/copy_test" : "libs/iostreams/test/copy_test.cpp" +boost-test(RUN) "iostreams/component_access_test" : "libs/iostreams/test/component_access_test.cpp" +boost-test(RUN) "iostreams/compose_test" : "libs/iostreams/test/compose_test.cpp" +boost-test(RUN) "iostreams/code_converter_test" : "libs/iostreams/test/code_converter_test.cpp" "libs/iostreams/test/detail/utf8_codecvt_facet.cpp" +boost-test(RUN) "iostreams/buffer_size_test" : "libs/iostreams/test/buffer_size_test.cpp" +boost-test(RUN) "iostreams/auto_close_test" : "libs/iostreams/test/auto_close_test.cpp" +boost-test(RUN) "iostreams/array_test" : "libs/iostreams/test/array_test.cpp" +boost-test(RUN) "iostreams/bzip2_test" : "libs/iostreams/test/bzip2_test.cpp" +boost-test(RUN) "iostreams/zlib_test" : "libs/iostreams/test/zlib_test.cpp" +boost-test(RUN) "iostreams/gzip_test" : "libs/iostreams/test/gzip_test.cpp" +boost-test(RUN) "iterator/permutation_iterator_test" : "libs/iterator/test/permutation_iterator_test.cpp" +boost-test(RUN) "iterator/iterator_traits_test" : "libs/iterator/test/iterator_traits_test.cpp" +boost-test(RUN) "iterator/interoperable" : "libs/iterator/test/interoperable.cpp" +boost-test(RUN) "iterator/counting_iterator_test" : "libs/iterator/test/counting_iterator_test.cpp" +boost-test(RUN) "iterator/reverse_iterator_test" : "libs/iterator/test/reverse_iterator_test.cpp" +boost-test(RUN) "iterator/iterator_facade" : "libs/iterator/test/iterator_facade.cpp" +boost-test(RUN) "iterator/filter_iterator_test" : "libs/iterator/test/filter_iterator_test.cpp" +boost-test(COMPILE) "iterator/indirect_iter_member_types" : "libs/iterator/test/indirect_iter_member_types.cpp" +boost-test(RUN) "iterator/indirect_iterator_test" : "libs/iterator/test/indirect_iterator_test.cpp" +boost-test(RUN) "iterator/transform_iterator_test" : "libs/iterator/test/transform_iterator_test.cpp" +boost-test(COMPILE_FAIL) "iterator/lvalue_concept_fail" : "libs/iterator/test/lvalue_concept_fail.cpp" +boost-test(COMPILE_FAIL) "iterator/iter_archetype_default_ctor" : "libs/iterator/test/iter_archetype_default_ctor.cpp" +boost-test(COMPILE) "iterator/iterator_archetype_cc" : "libs/iterator/test/iterator_archetype_cc.cpp" +boost-test(RUN) "iterator/iterator_adaptor_test" : "libs/iterator/test/iterator_adaptor_test.cpp" +boost-test(RUN) "iterator/iterator_adaptor_cc" : "libs/iterator/test/iterator_adaptor_cc.cpp" +boost-test(RUN) "iterator/concept_tests" : "libs/iterator/test/concept_tests.cpp" +boost-test(RUN) "iterator/unit_tests" : "libs/iterator/test/unit_tests.cpp" +boost-test(COMPILE) "iterator/pointee" : "libs/iterator/test/pointee.cpp" +boost-test(COMPILE) "iterator/is_readable_iterator" : "libs/iterator/test/is_readable_iterator.cpp" +boost-test(COMPILE) "iterator/is_lvalue_iterator" : "libs/iterator/test/is_lvalue_iterator.cpp" +boost-test(RUN) "iterator/zip_iterator_test" : "libs/iterator/test/zip_iterator_test.cpp" +boost-test(RUN) "iterator/is_convertible_fail" : "libs/iterator/test/is_convertible_fail.cpp" +boost-test(COMPILE_FAIL) "iterator/interoperable_fail" : "libs/iterator/test/interoperable_fail.cpp" +boost-test(RUN) "logic/tribool_io_test" : "libs/logic/test/tribool_io_test.cpp" +boost-test(RUN) "logic/tribool_rename_test" : "libs/logic/test/tribool_rename_test.cpp" +boost-test(RUN) "logic/tribool_test" : "libs/logic/test/tribool_test.cpp" +boost-test(RUN) "math/common_factor_test" : "libs/math/test/common_factor_test.cpp" +boost-test(RUN) "math/octonion_test" : "libs/math/octonion/octonion_test.cpp" +boost-test(RUN) "math/quaternion_test" : "libs/math/quaternion/quaternion_test.cpp" +boost-test(RUN) "math/special_functions_test" : "libs/math/special_functions/special_functions_test.cpp" +boost-test(RUN) "math/quaternion_mult_incl_test" : "libs/math/quaternion/quaternion_mult_incl_test.cpp" "libs/math/quaternion/quaternion_mi1.cpp" "libs/math/quaternion/quaternion_mi2.cpp" +boost-test(RUN) "math/complex_test" : "libs/math/test/complex_test.cpp" +boost-test(RUN) "math/hypot_test" : "libs/math/test/hypot_test.cpp" +boost-test(RUN) "math/log1p_expm1_test" : "libs/math/test/log1p_expm1_test.cpp" +boost-test(COMPILE) "mpl/largest_int" : "libs/mpl/test/aux_/largest_int.cpp" +boost-test(COMPILE) "mpl/msvc_is_class" : "libs/mpl/test/aux_/msvc_is_class.cpp" +boost-test(COMPILE) "mpl/template_arity" : "libs/mpl/test/aux_/template_arity.cpp" +boost-test(COMPILE) "mpl/advance" : "libs/mpl/test/advance.cpp" +boost-test(COMPILE) "mpl/always" : "libs/mpl/test/always.cpp" +boost-test(COMPILE) "mpl/apply" : "libs/mpl/test/apply.cpp" +boost-test(COMPILE) "mpl/apply_wrap" : "libs/mpl/test/apply_wrap.cpp" +boost-test(COMPILE) "mpl/arithmetic" : "libs/mpl/test/arithmetic.cpp" +boost-test(COMPILE) "mpl/as_sequence" : "libs/mpl/test/as_sequence.cpp" +boost-test(COMPILE) "mpl/assert" : "libs/mpl/test/assert.cpp" +boost-test(COMPILE) "mpl/at" : "libs/mpl/test/at.cpp" +boost-test(COMPILE) "mpl/back" : "libs/mpl/test/back.cpp" +boost-test(COMPILE) "mpl/bind" : "libs/mpl/test/bind.cpp" +boost-test(COMPILE) "mpl/bitwise" : "libs/mpl/test/bitwise.cpp" +boost-test(RUN) "mpl/bool" : "libs/mpl/test/bool.cpp" +boost-test(COMPILE) "mpl/comparison" : "libs/mpl/test/comparison.cpp" +boost-test(COMPILE) "mpl/contains" : "libs/mpl/test/contains.cpp" +boost-test(COMPILE) "mpl/copy" : "libs/mpl/test/copy.cpp" +boost-test(COMPILE) "mpl/copy_if" : "libs/mpl/test/copy_if.cpp" +boost-test(COMPILE) "mpl/count" : "libs/mpl/test/count.cpp" +boost-test(COMPILE) "mpl/count_if" : "libs/mpl/test/count_if.cpp" +boost-test(COMPILE) "mpl/deque" : "libs/mpl/test/deque.cpp" +boost-test(COMPILE) "mpl/distance" : "libs/mpl/test/distance.cpp" +boost-test(COMPILE) "mpl/empty" : "libs/mpl/test/empty.cpp" +boost-test(COMPILE) "mpl/equal" : "libs/mpl/test/equal.cpp" +boost-test(COMPILE) "mpl/erase" : "libs/mpl/test/erase.cpp" +boost-test(COMPILE) "mpl/erase_range" : "libs/mpl/test/erase_range.cpp" +boost-test(COMPILE) "mpl/eval_if" : "libs/mpl/test/eval_if.cpp" +boost-test(COMPILE) "mpl/filter_view" : "libs/mpl/test/filter_view.cpp" +boost-test(COMPILE) "mpl/find" : "libs/mpl/test/find.cpp" +boost-test(COMPILE) "mpl/find_if" : "libs/mpl/test/find_if.cpp" +boost-test(COMPILE) "mpl/fold" : "libs/mpl/test/fold.cpp" +boost-test(RUN) "mpl/for_each" : "libs/mpl/test/for_each.cpp" +boost-test(COMPILE) "mpl/front" : "libs/mpl/test/front.cpp" +boost-test(COMPILE) "mpl/has_xxx" : "libs/mpl/test/has_xxx.cpp" +boost-test(COMPILE) "mpl/identity" : "libs/mpl/test/identity.cpp" +boost-test(COMPILE) "mpl/if" : "libs/mpl/test/if.cpp" +boost-test(COMPILE) "mpl/index_of" : "libs/mpl/test/index_of.cpp" +boost-test(COMPILE) "mpl/inherit" : "libs/mpl/test/inherit.cpp" +boost-test(COMPILE) "mpl/insert" : "libs/mpl/test/insert.cpp" +boost-test(COMPILE) "mpl/insert_range" : "libs/mpl/test/insert_range.cpp" +boost-test(RUN) "mpl/int" : "libs/mpl/test/int.cpp" +boost-test(RUN) "mpl/integral_c" : "libs/mpl/test/integral_c.cpp" +boost-test(COMPILE) "mpl/is_placeholder" : "libs/mpl/test/is_placeholder.cpp" +boost-test(COMPILE) "mpl/is_sequence" : "libs/mpl/test/is_sequence.cpp" +boost-test(COMPILE) "mpl/iterator_tags" : "libs/mpl/test/iterator_tags.cpp" +boost-test(COMPILE) "mpl/joint_view" : "libs/mpl/test/joint_view.cpp" +boost-test(COMPILE) "mpl/lambda" : "libs/mpl/test/lambda.cpp" +boost-test(COMPILE) "mpl/lambda_args" : "libs/mpl/test/lambda_args.cpp" +boost-test(COMPILE) "mpl/list" : "libs/mpl/test/list.cpp" +boost-test(COMPILE) "mpl/list_c" : "libs/mpl/test/list_c.cpp" +boost-test(COMPILE) "mpl/logical" : "libs/mpl/test/logical.cpp" +boost-test(COMPILE) "mpl/lower_bound" : "libs/mpl/test/lower_bound.cpp" +boost-test(COMPILE) "mpl/map" : "libs/mpl/test/map.cpp" +boost-test(COMPILE) "mpl/max_element" : "libs/mpl/test/max_element.cpp" +boost-test(COMPILE) "mpl/min_max" : "libs/mpl/test/min_max.cpp" +boost-test(COMPILE) "mpl/multiset" : "libs/mpl/test/multiset.cpp" +boost-test(COMPILE) "mpl/next" : "libs/mpl/test/next.cpp" +boost-test(COMPILE) "mpl/no_has_xxx" : "libs/mpl/test/no_has_xxx.cpp" +boost-test(COMPILE) "mpl/numeric_ops" : "libs/mpl/test/numeric_ops.cpp" +boost-test(COMPILE) "mpl/pair_view" : "libs/mpl/test/pair_view.cpp" +boost-test(COMPILE) "mpl/partition" : "libs/mpl/test/partition.cpp" +boost-test(COMPILE) "mpl/pop_front" : "libs/mpl/test/pop_front.cpp" +boost-test(COMPILE) "mpl/push_front" : "libs/mpl/test/push_front.cpp" +boost-test(COMPILE) "mpl/quote" : "libs/mpl/test/quote.cpp" +boost-test(COMPILE) "mpl/range_c" : "libs/mpl/test/range_c.cpp" +boost-test(COMPILE) "mpl/remove" : "libs/mpl/test/remove.cpp" +boost-test(COMPILE) "mpl/remove_if" : "libs/mpl/test/remove_if.cpp" +boost-test(COMPILE) "mpl/replace" : "libs/mpl/test/replace.cpp" +boost-test(COMPILE) "mpl/replace_if" : "libs/mpl/test/replace_if.cpp" +boost-test(COMPILE) "mpl/reverse" : "libs/mpl/test/reverse.cpp" +boost-test(COMPILE) "mpl/same_as" : "libs/mpl/test/same_as.cpp" +boost-test(COMPILE) "mpl/set" : "libs/mpl/test/set.cpp" +boost-test(COMPILE) "mpl/set_c" : "libs/mpl/test/set_c.cpp" +boost-test(COMPILE) "mpl/single_view" : "libs/mpl/test/single_view.cpp" +boost-test(COMPILE) "mpl/size" : "libs/mpl/test/size.cpp" +boost-test(RUN) "mpl/size_t" : "libs/mpl/test/size_t.cpp" +boost-test(COMPILE) "mpl/sizeof" : "libs/mpl/test/sizeof.cpp" +boost-test(COMPILE) "mpl/sort" : "libs/mpl/test/sort.cpp" +boost-test(COMPILE) "mpl/stable_partition" : "libs/mpl/test/stable_partition.cpp" +boost-test(COMPILE) "mpl/transform" : "libs/mpl/test/transform.cpp" +boost-test(COMPILE) "mpl/transform_view" : "libs/mpl/test/transform_view.cpp" +boost-test(COMPILE) "mpl/unique" : "libs/mpl/test/unique.cpp" +boost-test(COMPILE) "mpl/unpack_args" : "libs/mpl/test/unpack_args.cpp" +boost-test(COMPILE) "mpl/upper_bound" : "libs/mpl/test/upper_bound.cpp" +boost-test(COMPILE) "mpl/vector" : "libs/mpl/test/vector.cpp" +boost-test(COMPILE) "mpl/vector_c" : "libs/mpl/test/vector_c.cpp" +boost-test(COMPILE) "mpl/zip_view" : "libs/mpl/test/zip_view.cpp" +boost-test(RUN) "numeric/conversion/udt_example_0" : "libs/numeric/conversion/test/udt_example_0.cpp" +boost-test(RUN) "numeric/conversion/numeric_cast_test" : "libs/numeric/conversion/test/numeric_cast_test.cpp" +boost-test(RUN) "numeric/conversion/udt_support_test" : "libs/numeric/conversion/test/udt_support_test.cpp" +boost-test(RUN) "numeric/conversion/converter_test" : "libs/numeric/conversion/test/converter_test.cpp" +boost-test(RUN) "numeric/conversion/traits_test" : "libs/numeric/conversion/test/traits_test.cpp" +boost-test(RUN) "numeric/conversion/bounds_test" : "libs/numeric/conversion/test/bounds_test.cpp" +boost-test(RUN) "numeric/interval/test_float" : "libs/numeric/interval/test/test_float.cpp" +boost-test(RUN) "numeric/interval/cmp_tribool" : "libs/numeric/interval/test/cmp_tribool.cpp" +boost-test(RUN) "numeric/interval/cmp_set" : "libs/numeric/interval/test/cmp_set.cpp" +boost-test(RUN) "numeric/interval/cmp_lex" : "libs/numeric/interval/test/cmp_lex.cpp" +boost-test(RUN) "numeric/interval/cmp_exp" : "libs/numeric/interval/test/cmp_exp.cpp" +boost-test(RUN) "numeric/interval/cmp_exn" : "libs/numeric/interval/test/cmp_exn.cpp" +boost-test(RUN) "numeric/interval/cmp" : "libs/numeric/interval/test/cmp.cpp" +boost-test(RUN) "numeric/interval/pow" : "libs/numeric/interval/test/pow.cpp" +boost-test(RUN) "numeric/interval/pi" : "libs/numeric/interval/test/pi.cpp" +boost-test(RUN) "numeric/interval/overflow" : "libs/numeric/interval/test/overflow.cpp" +boost-test(RUN) "numeric/interval/mul" : "libs/numeric/interval/test/mul.cpp" +boost-test(RUN) "numeric/interval/fmod" : "libs/numeric/interval/test/fmod.cpp" +boost-test(RUN) "numeric/interval/det" : "libs/numeric/interval/test/det.cpp" +boost-test(RUN) "numeric/interval/add" : "libs/numeric/interval/test/add.cpp" +boost-test(COMPILE) "numeric/interval/integer" : "libs/numeric/interval/test/integer.cpp" +boost-test(COMPILE) "numeric/ublas/concepts" : "libs/numeric/ublas/test/concepts.cpp" +boost-test(RUN) "numeric/ublas/placement_new" : "libs/numeric/ublas/test/placement_new.cpp" +boost-test(RUN) "numeric/ublas/test6" : "libs/numeric/ublas/test/test6.cpp" "libs/numeric/ublas/test/test62.cpp" "libs/numeric/ublas/test/test63.cpp" +boost-test(RUN) "numeric/ublas/test5" : "libs/numeric/ublas/test/test5.cpp" "libs/numeric/ublas/test/test52.cpp" "libs/numeric/ublas/test/test53.cpp" +boost-test(RUN) "numeric/ublas/test4" : "libs/numeric/ublas/test/test4.cpp" "libs/numeric/ublas/test/test42.cpp" "libs/numeric/ublas/test/test43.cpp" +boost-test(RUN) "numeric/ublas/test3" : "libs/numeric/ublas/test/test3.cpp" "libs/numeric/ublas/test/test31.cpp" "libs/numeric/ublas/test/test32.cpp" "libs/numeric/ublas/test/test33.cpp" +boost-test(RUN) "numeric/ublas/test2" : "libs/numeric/ublas/test/test2.cpp" "libs/numeric/ublas/test/test21.cpp" "libs/numeric/ublas/test/test22.cpp" "libs/numeric/ublas/test/test23.cpp" +boost-test(RUN) "numeric/ublas/test1" : "libs/numeric/ublas/test/test1.cpp" "libs/numeric/ublas/test/test11.cpp" "libs/numeric/ublas/test/test12.cpp" "libs/numeric/ublas/test/test13.cpp" +boost-test(COMPILE) "multi_array/concept_checks" : "libs/multi_array/test/concept_checks.cpp" +boost-test(RUN) "multi_array/resize" : "libs/multi_array/test/resize.cpp" +boost-test(RUN) "multi_array/stl_interaction" : "libs/multi_array/test/stl_interaction.cpp" +boost-test(RUN) "multi_array/idxgen1" : "libs/multi_array/test/idxgen1.cpp" +boost-test(RUN) "multi_array/range1" : "libs/multi_array/test/range1.cpp" +boost-test(RUN) "multi_array/reshape" : "libs/multi_array/test/reshape.cpp" +boost-test(RUN) "multi_array/storage_order" : "libs/multi_array/test/storage_order.cpp" +boost-test(RUN) "multi_array/index_bases" : "libs/multi_array/test/index_bases.cpp" +boost-test(RUN) "multi_array/assign_to_array" : "libs/multi_array/test/assign_to_array.cpp" +boost-test(RUN) "multi_array/assign" : "libs/multi_array/test/assign.cpp" +boost-test(RUN) "multi_array/slice" : "libs/multi_array/test/slice.cpp" +boost-test(RUN) "multi_array/iterators" : "libs/multi_array/test/iterators.cpp" +boost-test(RUN) "multi_array/compare" : "libs/multi_array/test/compare.cpp" +boost-test(RUN) "multi_array/access" : "libs/multi_array/test/access.cpp" +boost-test(RUN) "multi_array/constructors" : "libs/multi_array/test/constructors.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_ref_cview3" : "libs/multi_array/test/fail_ref_cview3.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_ref_cview2" : "libs/multi_array/test/fail_ref_cview2.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_ref_cview" : "libs/multi_array/test/fail_ref_cview.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_ref_csubarray3" : "libs/multi_array/test/fail_ref_csubarray3.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_ref_csubarray2" : "libs/multi_array/test/fail_ref_csubarray2.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_ref_csubarray" : "libs/multi_array/test/fail_ref_csubarray.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_ref_criterator" : "libs/multi_array/test/fail_ref_criterator.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_ref_cparen" : "libs/multi_array/test/fail_ref_cparen.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_ref_citerator" : "libs/multi_array/test/fail_ref_citerator.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_ref_cdata" : "libs/multi_array/test/fail_ref_cdata.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_ref_cbracket" : "libs/multi_array/test/fail_ref_cbracket.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_cview3" : "libs/multi_array/test/fail_cview3.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_cview2" : "libs/multi_array/test/fail_cview2.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_cview" : "libs/multi_array/test/fail_cview.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_csubarray3" : "libs/multi_array/test/fail_csubarray3.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_csubarray2" : "libs/multi_array/test/fail_csubarray2.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_csubarray" : "libs/multi_array/test/fail_csubarray.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_criterator" : "libs/multi_array/test/fail_criterator.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_cparen" : "libs/multi_array/test/fail_cparen.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_citerator" : "libs/multi_array/test/fail_citerator.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_cdata" : "libs/multi_array/test/fail_cdata.cpp" +boost-test(COMPILE_FAIL) "multi_array/fail_cbracket" : "libs/multi_array/test/fail_cbracket.cpp" +boost-test(RUN) "multi_index/test_update" : "libs/multi_index/test/test_update.cpp" "libs/multi_index/test/test_update_main.cpp" +boost-test(RUN) "multi_index/test_special_set_ops" : "libs/multi_index/test/test_special_set_ops.cpp" "libs/multi_index/test/test_special_set_ops_main.cpp" +boost-test(RUN) "multi_index/test_set_ops" : "libs/multi_index/test/test_set_ops.cpp" "libs/multi_index/test/test_set_ops_main.cpp" +boost-test(RUN) "multi_index/test_serialization" : "libs/multi_index/test/test_serialization.cpp" "libs/multi_index/test/test_serialization1.cpp" "libs/multi_index/test/test_serialization2.cpp" "libs/multi_index/test/test_serialization_main.cpp" +boost-test(RUN) "multi_index/test_safe_mode" : "libs/multi_index/test/test_safe_mode.cpp" "libs/multi_index/test/test_safe_mode_main.cpp" +boost-test(RUN) "multi_index/test_rearrange" : "libs/multi_index/test/test_rearrange.cpp" "libs/multi_index/test/test_rearrange_main.cpp" +boost-test(RUN) "multi_index/test_range" : "libs/multi_index/test/test_range.cpp" "libs/multi_index/test/test_range_main.cpp" +boost-test(RUN) "multi_index/test_projection" : "libs/multi_index/test/test_projection.cpp" "libs/multi_index/test/test_projection_main.cpp" +boost-test(RUN) "multi_index/test_observers" : "libs/multi_index/test/test_observers.cpp" "libs/multi_index/test/test_observers_main.cpp" +boost-test(RUN) "multi_index/test_mpl_ops" : "libs/multi_index/test/test_mpl_ops.cpp" "libs/multi_index/test/test_mpl_ops_main.cpp" +boost-test(RUN) "multi_index/test_modifiers" : "libs/multi_index/test/test_modifiers.cpp" "libs/multi_index/test/test_modifiers_main.cpp" +boost-test(RUN) "multi_index/test_list_ops" : "libs/multi_index/test/test_list_ops.cpp" "libs/multi_index/test/test_list_ops_main.cpp" +boost-test(RUN) "multi_index/test_key_extractors" : "libs/multi_index/test/test_key_extractors.cpp" "libs/multi_index/test/test_key_extractors_main.cpp" +boost-test(RUN) "multi_index/test_iterators" : "libs/multi_index/test/test_iterators.cpp" "libs/multi_index/test/test_iterators_main.cpp" +boost-test(RUN) "multi_index/test_hash_ops" : "libs/multi_index/test/test_hash_ops.cpp" "libs/multi_index/test/test_hash_ops_main.cpp" +boost-test(RUN) "multi_index/test_copy_assignment" : "libs/multi_index/test/test_copy_assignment.cpp" "libs/multi_index/test/test_copy_assignment_main.cpp" +boost-test(RUN) "multi_index/test_conv_iterators" : "libs/multi_index/test/test_conv_iterators.cpp" "libs/multi_index/test/test_conv_iterators_main.cpp" +boost-test(RUN) "multi_index/test_composite_key" : "libs/multi_index/test/test_composite_key.cpp" "libs/multi_index/test/test_composite_key_main.cpp" +boost-test(RUN) "multi_index/test_comparison" : "libs/multi_index/test/test_comparison.cpp" "libs/multi_index/test/test_comparison_main.cpp" +boost-test(RUN) "multi_index/test_capacity" : "libs/multi_index/test/test_capacity.cpp" "libs/multi_index/test/test_capacity_main.cpp" +boost-test(RUN) "multi_index/test_basic" : "libs/multi_index/test/test_basic.cpp" "libs/multi_index/test/test_basic_main.cpp" +boost-test(COMPILE_FAIL) "optional/optional_test_inplace_fail2" : "libs/optional/test/optional_test_inplace_fail2.cpp" +boost-test(COMPILE_FAIL) "optional/optional_test_inplace_fail" : "libs/optional/test/optional_test_inplace_fail.cpp" +boost-test(COMPILE_FAIL) "optional/optional_test_ref_fail4" : "libs/optional/test/optional_test_ref_fail4.cpp" +boost-test(COMPILE_FAIL) "optional/optional_test_ref_fail3" : "libs/optional/test/optional_test_ref_fail3.cpp" +boost-test(COMPILE_FAIL) "optional/optional_test_ref_fail2" : "libs/optional/test/optional_test_ref_fail2.cpp" +boost-test(COMPILE_FAIL) "optional/optional_test_ref_fail1" : "libs/optional/test/optional_test_ref_fail1.cpp" +boost-test(COMPILE_FAIL) "optional/optional_test_fail3b" : "libs/optional/test/optional_test_fail3b.cpp" +boost-test(COMPILE_FAIL) "optional/optional_test_fail3a" : "libs/optional/test/optional_test_fail3a.cpp" +boost-test(COMPILE_FAIL) "optional/optional_test_fail2" : "libs/optional/test/optional_test_fail2.cpp" +boost-test(COMPILE_FAIL) "optional/optional_test_fail1" : "libs/optional/test/optional_test_fail1.cpp" +boost-test(RUN) "optional/optional_test_io" : "libs/optional/test/optional_test_io.cpp" +boost-test(RUN) "optional/optional_test_inplace" : "libs/optional/test/optional_test_inplace.cpp" +boost-test(RUN) "optional/optional_test_ref" : "libs/optional/test/optional_test_ref.cpp" +boost-test(RUN) "optional/optional_test_tie" : "libs/optional/test/optional_test_tie.cpp" +boost-test(RUN) "optional/optional_test" : "libs/optional/test/optional_test.cpp" +boost-test(RUN_PYD) "parameter/python_test" : "libs/parameter/test/python_test.py" "libs/parameter/test/python_test.cpp" +boost-test(COMPILE) "parameter/compose" : "libs/parameter/test/compose.cpp" +boost-test(COMPILE_FAIL) "parameter/deduced_unmatched_arg" : "libs/parameter/test/deduced_unmatched_arg.cpp" +boost-test(COMPILE_FAIL) "parameter/duplicates" : "libs/parameter/test/duplicates.cpp" +boost-test(COMPILE) "parameter/unwrap_cv_reference" : "libs/parameter/test/unwrap_cv_reference.cpp" +boost-test(COMPILE) "parameter/ntp" : "libs/parameter/test/ntp.cpp" +boost-test(RUN) "parameter/normalized_argument_types" : "libs/parameter/test/normalized_argument_types.cpp" +boost-test(RUN) "parameter/deduced_dependent_predicate" : "libs/parameter/test/deduced_dependent_predicate.cpp" +boost-test(RUN) "parameter/optional_deduced_sfinae" : "libs/parameter/test/optional_deduced_sfinae.cpp" +boost-test(RUN) "parameter/deduced" : "libs/parameter/test/deduced.cpp" +boost-test(RUN) "parameter/maybe" : "libs/parameter/test/maybe.cpp" +boost-test(RUN) "parameter/efficiency" : "libs/parameter/test/efficiency.cpp" +boost-test(RUN) "parameter/preprocessor_deduced" : "libs/parameter/test/preprocessor_deduced.cpp" +boost-test(RUN) "parameter/preprocessor" : "libs/parameter/test/preprocessor.cpp" +boost-test(RUN) "parameter/mpl" : "libs/parameter/test/mpl.cpp" +boost-test(RUN) "parameter/singular" : "libs/parameter/test/singular.cpp" +boost-test(RUN) "parameter/tutorial" : "libs/parameter/test/tutorial.cpp" +boost-test(RUN) "parameter/earwicker" : "libs/parameter/test/earwicker.cpp" +boost-test(RUN) "parameter/macros" : "libs/parameter/test/macros.cpp" +boost-test(RUN) "parameter/sfinae" : "libs/parameter/test/sfinae.cpp" +boost-test(RUN) "parameter/basics" : "libs/parameter/test/basics.cpp" +boost-test(RUN) "program_options/winmain_dll" : "libs/program_options/test/winmain.cpp" +boost-test(RUN) "program_options/winmain" : "libs/program_options/test/winmain.cpp" +boost-test(RUN) "program_options/unicode_test_dll" : "libs/program_options/test/unicode_test.cpp" +boost-test(RUN) "program_options/unicode_test" : "libs/program_options/test/unicode_test.cpp" +boost-test(RUN) "program_options/positional_options_test_dll" : "libs/program_options/test/positional_options_test.cpp" +boost-test(RUN) "program_options/positional_options_test" : "libs/program_options/test/positional_options_test.cpp" +boost-test(RUN) "program_options/cmdline_test_dll" : "libs/program_options/test/cmdline_test.cpp" +boost-test(RUN) "program_options/cmdline_test" : "libs/program_options/test/cmdline_test.cpp" +boost-test(RUN) "program_options/variable_map_test_dll" : "libs/program_options/test/variable_map_test.cpp" +boost-test(RUN) "program_options/variable_map_test" : "libs/program_options/test/variable_map_test.cpp" +boost-test(RUN) "program_options/parsers_test_dll" : "libs/program_options/test/parsers_test.cpp" +boost-test(RUN) "program_options/parsers_test" : "libs/program_options/test/parsers_test.cpp" +boost-test(RUN) "program_options/options_description_test_dll" : "libs/program_options/test/options_description_test.cpp" +boost-test(RUN) "program_options/options_description_test" : "libs/program_options/test/options_description_test.cpp" +boost-test(RUN) "property_map/dynamic_properties_test" : "libs/property_map/test/dynamic_properties_test.cpp" +boost-test(COMPILE) "property_map/property_map_cc" : "libs/property_map/test/property_map_cc.cpp" +boost-test(RUN) "ptr_container/no_exceptions" : "libs/ptr_container/test/no_exceptions.cpp" +boost-test(RUN) "ptr_container/serialization" : "libs/ptr_container/test/serialization.cpp" +boost-test(RUN) "ptr_container/indirect_fun" : "libs/ptr_container/test/indirect_fun.cpp" +boost-test(RUN) "ptr_container/tut1" : "libs/ptr_container/test/tut1.cpp" +boost-test(RUN) "ptr_container/iterator_test" : "libs/ptr_container/test/iterator_test.cpp" +boost-test(RUN) "ptr_container/view_example" : "libs/ptr_container/test/view_example.cpp" +boost-test(RUN) "ptr_container/incomplete_type_test" : "libs/ptr_container/test/incomplete_type_test.cpp" +boost-test(RUN) "ptr_container/tree_test" : "libs/ptr_container/test/tree_test.cpp" +boost-test(RUN) "ptr_container/ptr_array" : "libs/ptr_container/test/ptr_array.cpp" +boost-test(RUN) "ptr_container/ptr_map" : "libs/ptr_container/test/ptr_map.cpp" +boost-test(RUN) "ptr_container/ptr_set" : "libs/ptr_container/test/ptr_set.cpp" +boost-test(RUN) "ptr_container/ptr_deque" : "libs/ptr_container/test/ptr_deque.cpp" +boost-test(RUN) "ptr_container/ptr_list" : "libs/ptr_container/test/ptr_list.cpp" +boost-test(RUN) "ptr_container/ptr_vector" : "libs/ptr_container/test/ptr_vector.cpp" +boost-test(COMPILE_FAIL) "python/object_fail1" : "libs/python/test/object_fail1.cpp" +boost-test(COMPILE_FAIL) "python/as_to_python_function" : "libs/python/test/as_to_python_function.cpp" +boost-test(COMPILE_FAIL) "python/raw_pyobject_fail2" : "libs/python/test/raw_pyobject_fail2.cpp" +boost-test(COMPILE_FAIL) "python/raw_pyobject_fail1" : "libs/python/test/raw_pyobject_fail1.cpp" +boost-test(COMPILE) "python/select_arg_to_python_test" : "libs/python/test/select_arg_to_python_test.cpp" +boost-test(RUN) "python/select_from_python_test" : "libs/python/test/select_from_python_test.cpp" "libs/python/src/converter/type_id.cpp" +boost-test(COMPILE) "python/select_holder" : "libs/python/test/select_holder.cpp" +boost-test(RUN) "python/upcast" : "libs/python/test/upcast.cpp" +boost-test(COMPILE) "python/copy_ctor_mutates_rhs" : "libs/python/test/copy_ctor_mutates_rhs.cpp" +boost-test(COMPILE) "python/object_manager" : "libs/python/test/object_manager.cpp" +boost-test(COMPILE) "python/borrowed" : "libs/python/test/borrowed.cpp" +boost-test(COMPILE) "python/string_literal" : "libs/python/test/string_literal.cpp" +boost-test(RUN) "python/result" : "libs/python/test/result.cpp" +boost-test(RUN) "python/pointee" : "libs/python/test/pointee.cpp" +boost-test(RUN) "python/if_else" : "libs/python/test/if_else.cpp" +boost-test(RUN) "python/bases" : "libs/python/test/bases.cpp" +boost-test(RUN) "python/pointer_type_id_test" : "libs/python/test/pointer_type_id_test.cpp" +boost-test(RUN) "python/destroy_test" : "libs/python/test/destroy_test.cpp" +boost-test(COMPILE) "python/indirect_traits_test" : "libs/python/test/indirect_traits_test.cpp" +boost-test(RUN_PYD) "python/map_indexing_suite" : "libs/python/test/map_indexing_suite.py" +boost-test(RUN_PYD) "python/pointer_vector" : "libs/python/test/pointer_vector.py" "libs/python/test/pointer_vector.cpp" +boost-test(RUN_PYD) "python/vector_indexing_suite" : "libs/python/test/vector_indexing_suite.py" "libs/python/test/vector_indexing_suite.cpp" +boost-test(RUN_PYD) "python/docstring" : "libs/python/test/docstring.py" "libs/python/test/docstring.cpp" +boost-test(RUN_PYD) "python/nested" : "libs/python/test/nested.py" "libs/python/test/nested.cpp" +boost-test(RUN_PYD) "python/pickle4" : "libs/python/test/pickle4.py" "libs/python/test/pickle4.cpp" +boost-test(RUN_PYD) "python/pickle3" : "libs/python/test/pickle3.py" "libs/python/test/pickle3.cpp" +boost-test(RUN_PYD) "python/pickle2" : "libs/python/test/pickle2.py" "libs/python/test/pickle2.cpp" +boost-test(RUN_PYD) "python/pickle1" : "libs/python/test/pickle1.py" "libs/python/test/pickle1.cpp" +boost-test(RUN_PYD) "python/voidptr" : "libs/python/test/voidptr.py" "libs/python/test/voidptr.cpp" +boost-test(RUN_PYD) "python/opaque" : "libs/python/test/opaque.py" "libs/python/test/opaque.cpp" +boost-test(RUN_PYD) "python/crossmod_opaque" : "libs/python/test/crossmod_opaque.py" "libs/python/test/crossmod_opaque_a.cpp" "libs/python/test/crossmod_opaque_b.cpp" +boost-test(RUN_PYD) "python/extract" : "libs/python/test/extract.py" "libs/python/test/extract.cpp" +boost-test(RUN_PYD) "python/stl_iterator" : "libs/python/test/stl_iterator.py" "libs/python/test/stl_iterator.cpp" +boost-test(RUN_PYD) "python/iterator" : "libs/python/test/iterator.py" "libs/python/test/iterator.cpp" "libs/python/test/input_iterator.cpp" +boost-test(RUN_PYD) "python/multi_arg_constructor" : "libs/python/test/multi_arg_constructor.py" "libs/python/test/multi_arg_constructor.cpp" +boost-test(RUN_PYD) "python/bienstman3" : "libs/python/test/bienstman3.py" "libs/python/test/bienstman3.cpp" +boost-test(RUN_PYD) "python/bienstman2" : "libs/python/test/bienstman2.py" "libs/python/test/bienstman2.cpp" +boost-test(RUN_PYD) "python/bienstman1" : "libs/python/test/bienstman1.py" "libs/python/test/bienstman1.cpp" +boost-test(RUN_PYD) "python/ben_scott1" : "libs/python/test/ben_scott1.py" "libs/python/test/ben_scott1.cpp" +boost-test(RUN_PYD) "python/data_members" : "libs/python/test/data_members.py" "libs/python/test/data_members.cpp" +boost-test(RUN_PYD) "python/implicit" : "libs/python/test/implicit.py" "libs/python/test/implicit.cpp" +boost-test(RUN_PYD) "python/back_reference" : "libs/python/test/back_reference.py" "libs/python/test/back_reference.cpp" +boost-test(RUN_PYD) "python/virtual_functions" : "libs/python/test/virtual_functions.py" "libs/python/test/virtual_functions.cpp" +boost-test(RUN_PYD) "python/slice" : "libs/python/test/slice.py" "libs/python/test/slice.cpp" +boost-test(RUN_PYD) "python/str" : "libs/python/test/str.py" "libs/python/test/str.cpp" +boost-test(RUN_PYD) "python/tuple" : "libs/python/test/tuple.py" "libs/python/test/tuple.cpp" +boost-test(RUN_PYD) "python/dict" : "libs/python/test/dict.py" "libs/python/test/dict.cpp" +boost-test(RUN_PYD) "python/long" : "libs/python/test/long.py" "libs/python/test/long.cpp" +boost-test(RUN_PYD) "python/list" : "libs/python/test/list.py" "libs/python/test/list.cpp" +boost-test(RUN_PYD) "python/object" : "libs/python/test/object.py" "libs/python/test/object.cpp" +boost-test(RUN_PYD) "python/defaults" : "libs/python/test/defaults.py" "libs/python/test/defaults.cpp" +boost-test(RUN_PYD) "python/callbacks" : "libs/python/test/callbacks.py" "libs/python/test/callbacks.cpp" +boost-test(RUN_PYD) "python/operators" : "libs/python/test/operators.py" "libs/python/test/operators.cpp" +boost-test(RUN_PYD) "python/test_pointer_adoption" : "libs/python/test/test_pointer_adoption.py" "libs/python/test/test_pointer_adoption.cpp" +boost-test(RUN_PYD) "python/builtin_converters" : "libs/python/test/test_builtin_converters.py" +boost-test(RUN_PYD) "python/keywords" : "libs/python/test/keywords.cpp" "libs/python/test/keywords_test.py" +boost-test(RUN_PYD) "python/const_argument" : "libs/python/test/const_argument.py" "libs/python/test/const_argument.cpp" +boost-test(RUN_PYD) "python/try" : "libs/python/test/newtest.py" "libs/python/test/m1.cpp" "libs/python/test/m2.cpp" +boost-test(RUN_PYD) "python/pearu1" : "libs/python/test/test_cltree.py" "libs/python/test/cltree.cpp" +boost-test(RUN_PYD) "python/exception_translator" : "libs/python/test/exception_translator.py" "libs/python/test/exception_translator.cpp" +boost-test(RUN_PYD) "python/enum" : "libs/python/test/enum.py" "libs/python/test/enum.cpp" +boost-test(RUN_PYD) "python/numpy" : "libs/python/test/numpy.py" "libs/python/test/printer.py" "libs/python/test/numeric_tests.py" "libs/python/test/numarray_tests.py" "libs/python/test/numpy.cpp" +boost-test(RUN_PYD) "python/raw_ctor" : "libs/python/test/raw_ctor.py" "libs/python/test/raw_ctor.cpp" +boost-test(RUN_PYD) "python/args" : "libs/python/test/args.py" "libs/python/test/args.cpp" +boost-test(RUN_PYD) "python/minimal" : "libs/python/test/minimal.py" "libs/python/test/minimal.cpp" +boost-test(RUN_PYD) "python/auto_ptr" : "libs/python/test/auto_ptr.py" "libs/python/test/auto_ptr.cpp" +boost-test(RUN_PYD) "python/polymorphism2_auto_ptr" : "libs/python/test/polymorphism2_auto_ptr.py" "libs/python/test/polymorphism2_auto_ptr.cpp" +boost-test(RUN_PYD) "python/wrapper_held_type" : "libs/python/test/wrapper_held_type.py" "libs/python/test/wrapper_held_type.cpp" +boost-test(RUN_PYD) "python/polymorphism2" : "libs/python/test/polymorphism2.py" "libs/python/test/polymorphism2.cpp" +boost-test(RUN_PYD) "python/polymorphism" : "libs/python/test/polymorphism.py" "libs/python/test/polymorphism.cpp" +boost-test(RUN_PYD) "python/andreas_beyer" : "libs/python/test/andreas_beyer.py" "libs/python/test/andreas_beyer.cpp" +boost-test(RUN_PYD) "python/shared_ptr" : "libs/python/test/shared_ptr.py" "libs/python/test/shared_ptr.cpp" +boost-test(RUN_PYD) "python/staticmethod" : "libs/python/test/staticmethod.py" "libs/python/test/staticmethod.cpp" +boost-test(RUN_PYD) "python/return_arg" : "libs/python/test/return_arg.py" "libs/python/test/return_arg.cpp" +boost-test(RUN_PYD) "python/properties" : "libs/python/test/properties.py" "libs/python/test/properties.cpp" +boost-test(RUN_PYD) "python/injected" : "libs/python/test/injected.py" "libs/python/test/injected.cpp" +boost-test(RUN_PYD) "python/crossmod_exception" : "libs/python/test/crossmod_exception.py" "libs/python/test/crossmod_exception_a.cpp" "libs/python/test/crossmod_exception_b.cpp" +boost-test(RUN) "python/exec" : "libs/python/test/exec.cpp" +boost-test(RUN) "random/random_demo" : "libs/random/random_demo.cpp" +boost-test(RUN) "random/random_test" : "libs/random/random_test.cpp" +boost-test(RUN) "range/extension_mechanism" : "libs/range/test/extension_mechanism.cpp" +boost-test(RUN) "range/const_ranges" : "libs/range/test/const_ranges.cpp" +boost-test(RUN) "range/reversible_range" : "libs/range/test/reversible_range.cpp" +boost-test(RUN) "range/algorithm_example" : "libs/range/test/algorithm_example.cpp" +boost-test(RUN) "range/partial_workaround" : "libs/range/test/partial_workaround.cpp" +boost-test(RUN) "range/sub_range" : "libs/range/test/sub_range.cpp" +boost-test(RUN) "range/iterator_range" : "libs/range/test/iterator_range.cpp" +boost-test(RUN) "range/string" : "libs/range/test/string.cpp" +boost-test(RUN) "range/std_container" : "libs/range/test/std_container.cpp" +boost-test(RUN) "range/iterator_pair" : "libs/range/test/iterator_pair.cpp" +boost-test(RUN) "range/array" : "libs/range/test/array.cpp" +boost-test(RUN) "regex/captures_test" : "libs/regex/test/captures/captures_test.cpp" +boost-test(COMPILE) "regex/icu_concept_check" : "libs/regex/test/concepts/icu_concept_check.cpp" +boost-test(COMPILE) "regex/concept_check" : "libs/regex/test/concepts/concept_check.cpp" +boost-test(RUN) "regex/test_collate_info" ["always_show_run_output"] : "libs/regex/test/collate_info/collate_info.cpp" +boost-test(RUN) "regex/regex_dll_config_info" ["always_show_run_output"] : "libs/regex/test/config_info/regex_config_info.cpp" +boost-test(RUN) "regex/regex_config_info" ["always_show_run_output"] : "libs/regex/test/config_info/regex_config_info.cpp" +boost-test(RUN) "regex/object_cache_test" : "libs/regex/test/object_cache/object_cache_test.cpp" +boost-test(RUN) "regex/static_mutex_test" : "libs/regex/test/static_mutex/static_mutex_test.cpp" +boost-test(RUN) "regex/unicode_iterator_test" : "libs/regex/test/unicode/unicode_iterator_test.cpp" +boost-test(RUN) "regex/recursion_test" : "libs/regex/test/pathology/recursion_test.cpp" +boost-test(RUN) "regex/bad_expression_test" : "libs/regex/test/pathology/bad_expression_test.cpp" +boost-test(RUN) "regex/wide_posix_api_check_cpp" : "libs/regex/test/c_compiler_checks/wide_posix_api_check.cpp" +boost-test(RUN) "regex/posix_api_check_cpp" : "libs/regex/test/c_compiler_checks/posix_api_check.cpp" +boost-test(COMPILE) "regex/wide_posix_api_check_c" : "libs/regex/test/c_compiler_checks/wide_posix_api_check.c" +boost-test(RUN) "regex/posix_api_check" : "libs/regex/test/c_compiler_checks/posix_api_check.c" +boost-test(RUN) "regex/regex_regress_threaded" : "libs/regex/test/regress/basic_tests.cpp" "libs/regex/test/regress/main.cpp" "libs/regex/test/regress/test_alt.cpp" "libs/regex/test/regress/test_anchors.cpp" "libs/regex/test/regress/test_asserts.cpp" "libs/regex/test/regress/test_backrefs.cpp" "libs/regex/test/regress/test_deprecated.cpp" "libs/regex/test/regress/test_emacs.cpp" "libs/regex/test/regress/test_escapes.cpp" "libs/regex/test/regress/test_grep.cpp" "libs/regex/test/regress/test_locale.cpp" "libs/regex/test/regress/test_mfc.cpp" "libs/regex/test/regress/test_non_greedy_repeats.cpp" "libs/regex/test/regress/test_perl_ex.cpp" "libs/regex/test/regress/test_replace.cpp" "libs/regex/test/regress/test_sets.cpp" "libs/regex/test/regress/test_simple_repeats.cpp" "libs/regex/test/regress/test_tricky_cases.cpp" "libs/regex/test/regress/test_icu.cpp" "libs/regex/test/regress/test_unicode.cpp" "libs/regex/test/regress/test_overloads.cpp" "libs/regex/test/regress/test_operators.cpp" +boost-test(RUN) "regex/regex_regress_dll" : "libs/regex/test/regress/basic_tests.cpp" "libs/regex/test/regress/main.cpp" "libs/regex/test/regress/test_alt.cpp" "libs/regex/test/regress/test_anchors.cpp" "libs/regex/test/regress/test_asserts.cpp" "libs/regex/test/regress/test_backrefs.cpp" "libs/regex/test/regress/test_deprecated.cpp" "libs/regex/test/regress/test_emacs.cpp" "libs/regex/test/regress/test_escapes.cpp" "libs/regex/test/regress/test_grep.cpp" "libs/regex/test/regress/test_locale.cpp" "libs/regex/test/regress/test_mfc.cpp" "libs/regex/test/regress/test_non_greedy_repeats.cpp" "libs/regex/test/regress/test_perl_ex.cpp" "libs/regex/test/regress/test_replace.cpp" "libs/regex/test/regress/test_sets.cpp" "libs/regex/test/regress/test_simple_repeats.cpp" "libs/regex/test/regress/test_tricky_cases.cpp" "libs/regex/test/regress/test_icu.cpp" "libs/regex/test/regress/test_unicode.cpp" "libs/regex/test/regress/test_overloads.cpp" "libs/regex/test/regress/test_operators.cpp" +boost-test(RUN) "regex/regex_regress" : "libs/regex/test/regress/basic_tests.cpp" "libs/regex/test/regress/main.cpp" "libs/regex/test/regress/test_alt.cpp" "libs/regex/test/regress/test_anchors.cpp" "libs/regex/test/regress/test_asserts.cpp" "libs/regex/test/regress/test_backrefs.cpp" "libs/regex/test/regress/test_deprecated.cpp" "libs/regex/test/regress/test_emacs.cpp" "libs/regex/test/regress/test_escapes.cpp" "libs/regex/test/regress/test_grep.cpp" "libs/regex/test/regress/test_locale.cpp" "libs/regex/test/regress/test_mfc.cpp" "libs/regex/test/regress/test_non_greedy_repeats.cpp" "libs/regex/test/regress/test_perl_ex.cpp" "libs/regex/test/regress/test_replace.cpp" "libs/regex/test/regress/test_sets.cpp" "libs/regex/test/regress/test_simple_repeats.cpp" "libs/regex/test/regress/test_tricky_cases.cpp" "libs/regex/test/regress/test_icu.cpp" "libs/regex/test/regress/test_unicode.cpp" "libs/regex/test/regress/test_overloads.cpp" "libs/regex/test/regress/test_operators.cpp" +boost-test(RUN) "regex/captures_example" : "libs/regex/example/snippets/captures_example.cpp" +boost-test(RUN) "regex/regex_iterator_example" : "libs/regex/example/snippets/regex_iterator_example.cpp" +boost-test(RUN) "regex/regex_token_iterator_eg_2" : "libs/regex/example/snippets/regex_token_iterator_eg_2.cpp" +boost-test(RUN) "regex/regex_token_iterator_eg_1" : "libs/regex/example/snippets/regex_token_iterator_eg_1.cpp" +boost-test(RUN) "regex/regex_split_example_2" : "libs/regex/example/snippets/regex_split_example_2.cpp" +boost-test(RUN) "regex/regex_split_example_1" : "libs/regex/example/snippets/regex_split_example_1.cpp" +boost-test(RUN) "regex/regex_search_example" : "libs/regex/example/snippets/regex_search_example.cpp" +boost-test(RUN) "regex/regex_replace_example" : "libs/regex/example/snippets/regex_replace_example.cpp" +boost-test(RUN) "regex/regex_merge_example" : "libs/regex/example/snippets/regex_merge_example.cpp" +boost-test(RUN) "regex/regex_match_example" : "libs/regex/example/snippets/regex_match_example.cpp" +boost-test(RUN) "regex/regex_grep_example_4" : "libs/regex/example/snippets/regex_grep_example_4.cpp" +boost-test(RUN) "regex/regex_grep_example_3" : "libs/regex/example/snippets/regex_grep_example_3.cpp" +boost-test(RUN) "regex/regex_grep_example_2" : "libs/regex/example/snippets/regex_grep_example_2.cpp" +boost-test(RUN) "regex/regex_grep_example_1" : "libs/regex/example/snippets/regex_grep_example_1.cpp" +boost-test(RUN) "regex/partial_regex_match" : "libs/regex/example/snippets/partial_regex_match.cpp" +boost-test(RUN) "regex/partial_regex_grep" : "libs/regex/example/snippets/partial_regex_grep.cpp" +boost-test(RUN) "regex/icu_example" : "libs/regex/example/snippets/icu_example.cpp" +boost-test(RUN) "regex/mfc_example" : "libs/regex/example/snippets/mfc_example.cpp" +boost-test(RUN) "regex/credit_card_example" : "libs/regex/example/snippets/credit_card_example.cpp" +boost-test(RUN) "regex/test_grep" : "libs/regex/example/grep/grep.cpp" +boost-test(RUN) "regex/regex_timer" : "libs/regex/example/timer/regex_timer.cpp" +boost-test(RUN) "serialization/test_polymorphic_text_archive" : "libs/serialization/test/test_polymorphic.cpp" "libs/serialization/test/test_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_polymorphic_text_archive_dll" : "libs/serialization/test/test_polymorphic.cpp" "libs/serialization/test/test_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_polymorphic_text_warchive" : "libs/serialization/test/test_polymorphic.cpp" "libs/serialization/test/test_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_polymorphic_text_warchive_dll" : "libs/serialization/test/test_polymorphic.cpp" "libs/serialization/test/test_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_polymorphic_binary_archive" : "libs/serialization/test/test_polymorphic.cpp" "libs/serialization/test/test_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_polymorphic_binary_archive_dll" : "libs/serialization/test/test_polymorphic.cpp" "libs/serialization/test/test_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_polymorphic_xml_archive" : "libs/serialization/test/test_polymorphic.cpp" "libs/serialization/test/test_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_polymorphic_xml_archive_dll" : "libs/serialization/test/test_polymorphic.cpp" "libs/serialization/test/test_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_polymorphic_xml_warchive" : "libs/serialization/test/test_polymorphic.cpp" "libs/serialization/test/test_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_polymorphic_xml_warchive_dll" : "libs/serialization/test/test_polymorphic.cpp" "libs/serialization/test/test_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_shared_ptr_132_text_archive" : "libs/serialization/test/test_shared_ptr_132.cpp" +boost-test(RUN) "serialization/test_shared_ptr_132_text_archive_dll" : "libs/serialization/test/test_shared_ptr_132.cpp" +boost-test(RUN) "serialization/test_shared_ptr_132_text_warchive" : "libs/serialization/test/test_shared_ptr_132.cpp" +boost-test(RUN) "serialization/test_shared_ptr_132_text_warchive_dll" : "libs/serialization/test/test_shared_ptr_132.cpp" +boost-test(RUN) "serialization/test_shared_ptr_132_binary_archive" : "libs/serialization/test/test_shared_ptr_132.cpp" +boost-test(RUN) "serialization/test_shared_ptr_132_binary_archive_dll" : "libs/serialization/test/test_shared_ptr_132.cpp" +boost-test(RUN) "serialization/test_shared_ptr_132_xml_archive" : "libs/serialization/test/test_shared_ptr_132.cpp" +boost-test(RUN) "serialization/test_shared_ptr_132_xml_archive_dll" : "libs/serialization/test/test_shared_ptr_132.cpp" +boost-test(RUN) "serialization/test_shared_ptr_132_xml_warchive" : "libs/serialization/test/test_shared_ptr_132.cpp" +boost-test(RUN) "serialization/test_shared_ptr_132_xml_warchive_dll" : "libs/serialization/test/test_shared_ptr_132.cpp" +boost-test(RUN) "serialization/test_shared_ptr_text_archive" : "libs/serialization/test/test_shared_ptr.cpp" +boost-test(RUN) "serialization/test_shared_ptr_text_archive_dll" : "libs/serialization/test/test_shared_ptr.cpp" +boost-test(RUN) "serialization/test_shared_ptr_text_warchive" : "libs/serialization/test/test_shared_ptr.cpp" +boost-test(RUN) "serialization/test_shared_ptr_text_warchive_dll" : "libs/serialization/test/test_shared_ptr.cpp" +boost-test(RUN) "serialization/test_shared_ptr_binary_archive" : "libs/serialization/test/test_shared_ptr.cpp" +boost-test(RUN) "serialization/test_shared_ptr_binary_archive_dll" : "libs/serialization/test/test_shared_ptr.cpp" +boost-test(RUN) "serialization/test_shared_ptr_xml_archive" : "libs/serialization/test/test_shared_ptr.cpp" +boost-test(RUN) "serialization/test_shared_ptr_xml_archive_dll" : "libs/serialization/test/test_shared_ptr.cpp" +boost-test(RUN) "serialization/test_shared_ptr_xml_warchive" : "libs/serialization/test/test_shared_ptr.cpp" +boost-test(RUN) "serialization/test_shared_ptr_xml_warchive_dll" : "libs/serialization/test/test_shared_ptr.cpp" +boost-test(RUN) "serialization/test_optional_text_archive" : "libs/serialization/test/test_optional.cpp" +boost-test(RUN) "serialization/test_optional_text_archive_dll" : "libs/serialization/test/test_optional.cpp" +boost-test(RUN) "serialization/test_optional_text_warchive" : "libs/serialization/test/test_optional.cpp" +boost-test(RUN) "serialization/test_optional_text_warchive_dll" : "libs/serialization/test/test_optional.cpp" +boost-test(RUN) "serialization/test_optional_binary_archive" : "libs/serialization/test/test_optional.cpp" +boost-test(RUN) "serialization/test_optional_binary_archive_dll" : "libs/serialization/test/test_optional.cpp" +boost-test(RUN) "serialization/test_optional_xml_archive" : "libs/serialization/test/test_optional.cpp" +boost-test(RUN) "serialization/test_optional_xml_archive_dll" : "libs/serialization/test/test_optional.cpp" +boost-test(RUN) "serialization/test_optional_xml_warchive" : "libs/serialization/test/test_optional.cpp" +boost-test(RUN) "serialization/test_optional_xml_warchive_dll" : "libs/serialization/test/test_optional.cpp" +boost-test(RUN) "serialization/test_vector_text_archive" : "libs/serialization/test/test_vector.cpp" +boost-test(RUN) "serialization/test_vector_text_archive_dll" : "libs/serialization/test/test_vector.cpp" +boost-test(RUN) "serialization/test_vector_text_warchive" : "libs/serialization/test/test_vector.cpp" +boost-test(RUN) "serialization/test_vector_text_warchive_dll" : "libs/serialization/test/test_vector.cpp" +boost-test(RUN) "serialization/test_vector_binary_archive" : "libs/serialization/test/test_vector.cpp" +boost-test(RUN) "serialization/test_vector_binary_archive_dll" : "libs/serialization/test/test_vector.cpp" +boost-test(RUN) "serialization/test_vector_xml_archive" : "libs/serialization/test/test_vector.cpp" +boost-test(RUN) "serialization/test_vector_xml_archive_dll" : "libs/serialization/test/test_vector.cpp" +boost-test(RUN) "serialization/test_vector_xml_warchive" : "libs/serialization/test/test_vector.cpp" +boost-test(RUN) "serialization/test_vector_xml_warchive_dll" : "libs/serialization/test/test_vector.cpp" +boost-test(RUN) "serialization/test_variant_text_archive" : "libs/serialization/test/test_variant.cpp" +boost-test(RUN) "serialization/test_variant_text_archive_dll" : "libs/serialization/test/test_variant.cpp" +boost-test(RUN) "serialization/test_variant_text_warchive" : "libs/serialization/test/test_variant.cpp" +boost-test(RUN) "serialization/test_variant_text_warchive_dll" : "libs/serialization/test/test_variant.cpp" +boost-test(RUN) "serialization/test_variant_binary_archive" : "libs/serialization/test/test_variant.cpp" +boost-test(RUN) "serialization/test_variant_binary_archive_dll" : "libs/serialization/test/test_variant.cpp" +boost-test(RUN) "serialization/test_variant_xml_archive" : "libs/serialization/test/test_variant.cpp" +boost-test(RUN) "serialization/test_variant_xml_archive_dll" : "libs/serialization/test/test_variant.cpp" +boost-test(RUN) "serialization/test_variant_xml_warchive" : "libs/serialization/test/test_variant.cpp" +boost-test(RUN) "serialization/test_variant_xml_warchive_dll" : "libs/serialization/test/test_variant.cpp" +boost-test(RUN) "serialization/test_unregistered_text_archive" : "libs/serialization/test/test_unregistered.cpp" +boost-test(RUN) "serialization/test_unregistered_text_archive_dll" : "libs/serialization/test/test_unregistered.cpp" +boost-test(RUN) "serialization/test_unregistered_text_warchive" : "libs/serialization/test/test_unregistered.cpp" +boost-test(RUN) "serialization/test_unregistered_text_warchive_dll" : "libs/serialization/test/test_unregistered.cpp" +boost-test(RUN) "serialization/test_unregistered_binary_archive" : "libs/serialization/test/test_unregistered.cpp" +boost-test(RUN) "serialization/test_unregistered_binary_archive_dll" : "libs/serialization/test/test_unregistered.cpp" +boost-test(RUN) "serialization/test_unregistered_xml_archive" : "libs/serialization/test/test_unregistered.cpp" +boost-test(RUN) "serialization/test_unregistered_xml_archive_dll" : "libs/serialization/test/test_unregistered.cpp" +boost-test(RUN) "serialization/test_unregistered_xml_warchive" : "libs/serialization/test/test_unregistered.cpp" +boost-test(RUN) "serialization/test_unregistered_xml_warchive_dll" : "libs/serialization/test/test_unregistered.cpp" +boost-test(RUN) "serialization/test_tracking_text_archive" : "libs/serialization/test/test_tracking.cpp" +boost-test(RUN) "serialization/test_tracking_text_archive_dll" : "libs/serialization/test/test_tracking.cpp" +boost-test(RUN) "serialization/test_tracking_text_warchive" : "libs/serialization/test/test_tracking.cpp" +boost-test(RUN) "serialization/test_tracking_text_warchive_dll" : "libs/serialization/test/test_tracking.cpp" +boost-test(RUN) "serialization/test_tracking_binary_archive" : "libs/serialization/test/test_tracking.cpp" +boost-test(RUN) "serialization/test_tracking_binary_archive_dll" : "libs/serialization/test/test_tracking.cpp" +boost-test(RUN) "serialization/test_tracking_xml_archive" : "libs/serialization/test/test_tracking.cpp" +boost-test(RUN) "serialization/test_tracking_xml_archive_dll" : "libs/serialization/test/test_tracking.cpp" +boost-test(RUN) "serialization/test_tracking_xml_warchive" : "libs/serialization/test/test_tracking.cpp" +boost-test(RUN) "serialization/test_tracking_xml_warchive_dll" : "libs/serialization/test/test_tracking.cpp" +boost-test(RUN) "serialization/test_split_text_archive" : "libs/serialization/test/test_split.cpp" +boost-test(RUN) "serialization/test_split_text_archive_dll" : "libs/serialization/test/test_split.cpp" +boost-test(RUN) "serialization/test_split_text_warchive" : "libs/serialization/test/test_split.cpp" +boost-test(RUN) "serialization/test_split_text_warchive_dll" : "libs/serialization/test/test_split.cpp" +boost-test(RUN) "serialization/test_split_binary_archive" : "libs/serialization/test/test_split.cpp" +boost-test(RUN) "serialization/test_split_binary_archive_dll" : "libs/serialization/test/test_split.cpp" +boost-test(RUN) "serialization/test_split_xml_archive" : "libs/serialization/test/test_split.cpp" +boost-test(RUN) "serialization/test_split_xml_archive_dll" : "libs/serialization/test/test_split.cpp" +boost-test(RUN) "serialization/test_split_xml_warchive" : "libs/serialization/test/test_split.cpp" +boost-test(RUN) "serialization/test_split_xml_warchive_dll" : "libs/serialization/test/test_split.cpp" +boost-test(RUN) "serialization/test_simple_class_ptr_text_archive" : "libs/serialization/test/test_simple_class_ptr.cpp" +boost-test(RUN) "serialization/test_simple_class_ptr_text_archive_dll" : "libs/serialization/test/test_simple_class_ptr.cpp" +boost-test(RUN) "serialization/test_simple_class_ptr_text_warchive" : "libs/serialization/test/test_simple_class_ptr.cpp" +boost-test(RUN) "serialization/test_simple_class_ptr_text_warchive_dll" : "libs/serialization/test/test_simple_class_ptr.cpp" +boost-test(RUN) "serialization/test_simple_class_ptr_binary_archive" : "libs/serialization/test/test_simple_class_ptr.cpp" +boost-test(RUN) "serialization/test_simple_class_ptr_binary_archive_dll" : "libs/serialization/test/test_simple_class_ptr.cpp" +boost-test(RUN) "serialization/test_simple_class_ptr_xml_archive" : "libs/serialization/test/test_simple_class_ptr.cpp" +boost-test(RUN) "serialization/test_simple_class_ptr_xml_archive_dll" : "libs/serialization/test/test_simple_class_ptr.cpp" +boost-test(RUN) "serialization/test_simple_class_ptr_xml_warchive" : "libs/serialization/test/test_simple_class_ptr.cpp" +boost-test(RUN) "serialization/test_simple_class_ptr_xml_warchive_dll" : "libs/serialization/test/test_simple_class_ptr.cpp" +boost-test(RUN) "serialization/test_simple_class_text_archive" : "libs/serialization/test/test_simple_class.cpp" +boost-test(RUN) "serialization/test_simple_class_text_archive_dll" : "libs/serialization/test/test_simple_class.cpp" +boost-test(RUN) "serialization/test_simple_class_text_warchive" : "libs/serialization/test/test_simple_class.cpp" +boost-test(RUN) "serialization/test_simple_class_text_warchive_dll" : "libs/serialization/test/test_simple_class.cpp" +boost-test(RUN) "serialization/test_simple_class_binary_archive" : "libs/serialization/test/test_simple_class.cpp" +boost-test(RUN) "serialization/test_simple_class_binary_archive_dll" : "libs/serialization/test/test_simple_class.cpp" +boost-test(RUN) "serialization/test_simple_class_xml_archive" : "libs/serialization/test/test_simple_class.cpp" +boost-test(RUN) "serialization/test_simple_class_xml_archive_dll" : "libs/serialization/test/test_simple_class.cpp" +boost-test(RUN) "serialization/test_simple_class_xml_warchive" : "libs/serialization/test/test_simple_class.cpp" +boost-test(RUN) "serialization/test_simple_class_xml_warchive_dll" : "libs/serialization/test/test_simple_class.cpp" +boost-test(RUN) "serialization/test_set_text_archive" : "libs/serialization/test/test_set.cpp" +boost-test(RUN) "serialization/test_set_text_archive_dll" : "libs/serialization/test/test_set.cpp" +boost-test(RUN) "serialization/test_set_text_warchive" : "libs/serialization/test/test_set.cpp" +boost-test(RUN) "serialization/test_set_text_warchive_dll" : "libs/serialization/test/test_set.cpp" +boost-test(RUN) "serialization/test_set_binary_archive" : "libs/serialization/test/test_set.cpp" +boost-test(RUN) "serialization/test_set_binary_archive_dll" : "libs/serialization/test/test_set.cpp" +boost-test(RUN) "serialization/test_set_xml_archive" : "libs/serialization/test/test_set.cpp" +boost-test(RUN) "serialization/test_set_xml_archive_dll" : "libs/serialization/test/test_set.cpp" +boost-test(RUN) "serialization/test_set_xml_warchive" : "libs/serialization/test/test_set.cpp" +boost-test(RUN) "serialization/test_set_xml_warchive_dll" : "libs/serialization/test/test_set.cpp" +boost-test(RUN) "serialization/test_registered_text_archive" : "libs/serialization/test/test_registered.cpp" +boost-test(RUN) "serialization/test_registered_text_archive_dll" : "libs/serialization/test/test_registered.cpp" +boost-test(RUN) "serialization/test_registered_text_warchive" : "libs/serialization/test/test_registered.cpp" +boost-test(RUN) "serialization/test_registered_text_warchive_dll" : "libs/serialization/test/test_registered.cpp" +boost-test(RUN) "serialization/test_registered_binary_archive" : "libs/serialization/test/test_registered.cpp" +boost-test(RUN) "serialization/test_registered_binary_archive_dll" : "libs/serialization/test/test_registered.cpp" +boost-test(RUN) "serialization/test_registered_xml_archive" : "libs/serialization/test/test_registered.cpp" +boost-test(RUN) "serialization/test_registered_xml_archive_dll" : "libs/serialization/test/test_registered.cpp" +boost-test(RUN) "serialization/test_registered_xml_warchive" : "libs/serialization/test/test_registered.cpp" +boost-test(RUN) "serialization/test_registered_xml_warchive_dll" : "libs/serialization/test/test_registered.cpp" +boost-test(RUN) "serialization/test_recursion_text_archive" : "libs/serialization/test/test_recursion.cpp" +boost-test(RUN) "serialization/test_recursion_text_archive_dll" : "libs/serialization/test/test_recursion.cpp" +boost-test(RUN) "serialization/test_recursion_text_warchive" : "libs/serialization/test/test_recursion.cpp" +boost-test(RUN) "serialization/test_recursion_text_warchive_dll" : "libs/serialization/test/test_recursion.cpp" +boost-test(RUN) "serialization/test_recursion_binary_archive" : "libs/serialization/test/test_recursion.cpp" +boost-test(RUN) "serialization/test_recursion_binary_archive_dll" : "libs/serialization/test/test_recursion.cpp" +boost-test(RUN) "serialization/test_recursion_xml_archive" : "libs/serialization/test/test_recursion.cpp" +boost-test(RUN) "serialization/test_recursion_xml_archive_dll" : "libs/serialization/test/test_recursion.cpp" +boost-test(RUN) "serialization/test_recursion_xml_warchive" : "libs/serialization/test/test_recursion.cpp" +boost-test(RUN) "serialization/test_recursion_xml_warchive_dll" : "libs/serialization/test/test_recursion.cpp" +boost-test(RUN) "serialization/test_nvp_text_archive" : "libs/serialization/test/test_nvp.cpp" +boost-test(RUN) "serialization/test_nvp_text_archive_dll" : "libs/serialization/test/test_nvp.cpp" +boost-test(RUN) "serialization/test_nvp_text_warchive" : "libs/serialization/test/test_nvp.cpp" +boost-test(RUN) "serialization/test_nvp_text_warchive_dll" : "libs/serialization/test/test_nvp.cpp" +boost-test(RUN) "serialization/test_nvp_binary_archive" : "libs/serialization/test/test_nvp.cpp" +boost-test(RUN) "serialization/test_nvp_binary_archive_dll" : "libs/serialization/test/test_nvp.cpp" +boost-test(RUN) "serialization/test_nvp_xml_archive" : "libs/serialization/test/test_nvp.cpp" +boost-test(RUN) "serialization/test_nvp_xml_archive_dll" : "libs/serialization/test/test_nvp.cpp" +boost-test(RUN) "serialization/test_nvp_xml_warchive" : "libs/serialization/test/test_nvp.cpp" +boost-test(RUN) "serialization/test_nvp_xml_warchive_dll" : "libs/serialization/test/test_nvp.cpp" +boost-test(RUN) "serialization/test_null_ptr_text_archive" : "libs/serialization/test/test_null_ptr.cpp" +boost-test(RUN) "serialization/test_null_ptr_text_archive_dll" : "libs/serialization/test/test_null_ptr.cpp" +boost-test(RUN) "serialization/test_null_ptr_text_warchive" : "libs/serialization/test/test_null_ptr.cpp" +boost-test(RUN) "serialization/test_null_ptr_text_warchive_dll" : "libs/serialization/test/test_null_ptr.cpp" +boost-test(RUN) "serialization/test_null_ptr_binary_archive" : "libs/serialization/test/test_null_ptr.cpp" +boost-test(RUN) "serialization/test_null_ptr_binary_archive_dll" : "libs/serialization/test/test_null_ptr.cpp" +boost-test(RUN) "serialization/test_null_ptr_xml_archive" : "libs/serialization/test/test_null_ptr.cpp" +boost-test(RUN) "serialization/test_null_ptr_xml_archive_dll" : "libs/serialization/test/test_null_ptr.cpp" +boost-test(RUN) "serialization/test_null_ptr_xml_warchive" : "libs/serialization/test/test_null_ptr.cpp" +boost-test(RUN) "serialization/test_null_ptr_xml_warchive_dll" : "libs/serialization/test/test_null_ptr.cpp" +boost-test(RUN) "serialization/test_non_default_ctor2_text_archive" : "libs/serialization/test/test_non_default_ctor2.cpp" +boost-test(RUN) "serialization/test_non_default_ctor2_text_archive_dll" : "libs/serialization/test/test_non_default_ctor2.cpp" +boost-test(RUN) "serialization/test_non_default_ctor2_text_warchive" : "libs/serialization/test/test_non_default_ctor2.cpp" +boost-test(RUN) "serialization/test_non_default_ctor2_text_warchive_dll" : "libs/serialization/test/test_non_default_ctor2.cpp" +boost-test(RUN) "serialization/test_non_default_ctor2_binary_archive" : "libs/serialization/test/test_non_default_ctor2.cpp" +boost-test(RUN) "serialization/test_non_default_ctor2_binary_archive_dll" : "libs/serialization/test/test_non_default_ctor2.cpp" +boost-test(RUN) "serialization/test_non_default_ctor2_xml_archive" : "libs/serialization/test/test_non_default_ctor2.cpp" +boost-test(RUN) "serialization/test_non_default_ctor2_xml_archive_dll" : "libs/serialization/test/test_non_default_ctor2.cpp" +boost-test(RUN) "serialization/test_non_default_ctor2_xml_warchive" : "libs/serialization/test/test_non_default_ctor2.cpp" +boost-test(RUN) "serialization/test_non_default_ctor2_xml_warchive_dll" : "libs/serialization/test/test_non_default_ctor2.cpp" +boost-test(RUN) "serialization/test_non_default_ctor_text_archive" : "libs/serialization/test/test_non_default_ctor.cpp" +boost-test(RUN) "serialization/test_non_default_ctor_text_archive_dll" : "libs/serialization/test/test_non_default_ctor.cpp" +boost-test(RUN) "serialization/test_non_default_ctor_text_warchive" : "libs/serialization/test/test_non_default_ctor.cpp" +boost-test(RUN) "serialization/test_non_default_ctor_text_warchive_dll" : "libs/serialization/test/test_non_default_ctor.cpp" +boost-test(RUN) "serialization/test_non_default_ctor_binary_archive" : "libs/serialization/test/test_non_default_ctor.cpp" +boost-test(RUN) "serialization/test_non_default_ctor_binary_archive_dll" : "libs/serialization/test/test_non_default_ctor.cpp" +boost-test(RUN) "serialization/test_non_default_ctor_xml_archive" : "libs/serialization/test/test_non_default_ctor.cpp" +boost-test(RUN) "serialization/test_non_default_ctor_xml_archive_dll" : "libs/serialization/test/test_non_default_ctor.cpp" +boost-test(RUN) "serialization/test_non_default_ctor_xml_warchive" : "libs/serialization/test/test_non_default_ctor.cpp" +boost-test(RUN) "serialization/test_non_default_ctor_xml_warchive_dll" : "libs/serialization/test/test_non_default_ctor.cpp" +boost-test(RUN) "serialization/test_non_intrusive_text_archive" : "libs/serialization/test/test_non_intrusive.cpp" +boost-test(RUN) "serialization/test_non_intrusive_text_archive_dll" : "libs/serialization/test/test_non_intrusive.cpp" +boost-test(RUN) "serialization/test_non_intrusive_text_warchive" : "libs/serialization/test/test_non_intrusive.cpp" +boost-test(RUN) "serialization/test_non_intrusive_text_warchive_dll" : "libs/serialization/test/test_non_intrusive.cpp" +boost-test(RUN) "serialization/test_non_intrusive_binary_archive" : "libs/serialization/test/test_non_intrusive.cpp" +boost-test(RUN) "serialization/test_non_intrusive_binary_archive_dll" : "libs/serialization/test/test_non_intrusive.cpp" +boost-test(RUN) "serialization/test_non_intrusive_xml_archive" : "libs/serialization/test/test_non_intrusive.cpp" +boost-test(RUN) "serialization/test_non_intrusive_xml_archive_dll" : "libs/serialization/test/test_non_intrusive.cpp" +boost-test(RUN) "serialization/test_non_intrusive_xml_warchive" : "libs/serialization/test/test_non_intrusive.cpp" +boost-test(RUN) "serialization/test_non_intrusive_xml_warchive_dll" : "libs/serialization/test/test_non_intrusive.cpp" +boost-test(RUN) "serialization/test_no_rtti_text_archive" : "libs/serialization/test/test_no_rtti.cpp" +boost-test(RUN) "serialization/test_no_rtti_text_archive_dll" : "libs/serialization/test/test_no_rtti.cpp" +boost-test(RUN) "serialization/test_no_rtti_text_warchive" : "libs/serialization/test/test_no_rtti.cpp" +boost-test(RUN) "serialization/test_no_rtti_text_warchive_dll" : "libs/serialization/test/test_no_rtti.cpp" +boost-test(RUN) "serialization/test_no_rtti_binary_archive" : "libs/serialization/test/test_no_rtti.cpp" +boost-test(RUN) "serialization/test_no_rtti_binary_archive_dll" : "libs/serialization/test/test_no_rtti.cpp" +boost-test(RUN) "serialization/test_no_rtti_xml_archive" : "libs/serialization/test/test_no_rtti.cpp" +boost-test(RUN) "serialization/test_no_rtti_xml_archive_dll" : "libs/serialization/test/test_no_rtti.cpp" +boost-test(RUN) "serialization/test_no_rtti_xml_warchive" : "libs/serialization/test/test_no_rtti.cpp" +boost-test(RUN) "serialization/test_no_rtti_xml_warchive_dll" : "libs/serialization/test/test_no_rtti.cpp" +boost-test(RUN) "serialization/test_multiple_ptrs_text_archive" : "libs/serialization/test/test_multiple_ptrs.cpp" +boost-test(RUN) "serialization/test_multiple_ptrs_text_archive_dll" : "libs/serialization/test/test_multiple_ptrs.cpp" +boost-test(RUN) "serialization/test_multiple_ptrs_text_warchive" : "libs/serialization/test/test_multiple_ptrs.cpp" +boost-test(RUN) "serialization/test_multiple_ptrs_text_warchive_dll" : "libs/serialization/test/test_multiple_ptrs.cpp" +boost-test(RUN) "serialization/test_multiple_ptrs_binary_archive" : "libs/serialization/test/test_multiple_ptrs.cpp" +boost-test(RUN) "serialization/test_multiple_ptrs_binary_archive_dll" : "libs/serialization/test/test_multiple_ptrs.cpp" +boost-test(RUN) "serialization/test_multiple_ptrs_xml_archive" : "libs/serialization/test/test_multiple_ptrs.cpp" +boost-test(RUN) "serialization/test_multiple_ptrs_xml_archive_dll" : "libs/serialization/test/test_multiple_ptrs.cpp" +boost-test(RUN) "serialization/test_multiple_ptrs_xml_warchive" : "libs/serialization/test/test_multiple_ptrs.cpp" +boost-test(RUN) "serialization/test_multiple_ptrs_xml_warchive_dll" : "libs/serialization/test/test_multiple_ptrs.cpp" +boost-test(RUN) "serialization/test_mi_text_archive" : "libs/serialization/test/test_mi.cpp" +boost-test(RUN) "serialization/test_mi_text_archive_dll" : "libs/serialization/test/test_mi.cpp" +boost-test(RUN) "serialization/test_mi_text_warchive" : "libs/serialization/test/test_mi.cpp" +boost-test(RUN) "serialization/test_mi_text_warchive_dll" : "libs/serialization/test/test_mi.cpp" +boost-test(RUN) "serialization/test_mi_binary_archive" : "libs/serialization/test/test_mi.cpp" +boost-test(RUN) "serialization/test_mi_binary_archive_dll" : "libs/serialization/test/test_mi.cpp" +boost-test(RUN) "serialization/test_mi_xml_archive" : "libs/serialization/test/test_mi.cpp" +boost-test(RUN) "serialization/test_mi_xml_archive_dll" : "libs/serialization/test/test_mi.cpp" +boost-test(RUN) "serialization/test_mi_xml_warchive" : "libs/serialization/test/test_mi.cpp" +boost-test(RUN) "serialization/test_mi_xml_warchive_dll" : "libs/serialization/test/test_mi.cpp" +boost-test(RUN) "serialization/test_map_text_archive" : "libs/serialization/test/test_map.cpp" +boost-test(RUN) "serialization/test_map_text_archive_dll" : "libs/serialization/test/test_map.cpp" +boost-test(RUN) "serialization/test_map_text_warchive" : "libs/serialization/test/test_map.cpp" +boost-test(RUN) "serialization/test_map_text_warchive_dll" : "libs/serialization/test/test_map.cpp" +boost-test(RUN) "serialization/test_map_binary_archive" : "libs/serialization/test/test_map.cpp" +boost-test(RUN) "serialization/test_map_binary_archive_dll" : "libs/serialization/test/test_map.cpp" +boost-test(RUN) "serialization/test_map_xml_archive" : "libs/serialization/test/test_map.cpp" +boost-test(RUN) "serialization/test_map_xml_archive_dll" : "libs/serialization/test/test_map.cpp" +boost-test(RUN) "serialization/test_map_xml_warchive" : "libs/serialization/test/test_map.cpp" +boost-test(RUN) "serialization/test_map_xml_warchive_dll" : "libs/serialization/test/test_map.cpp" +boost-test(RUN) "serialization/test_list_ptrs_text_archive" : "libs/serialization/test/test_list_ptrs.cpp" +boost-test(RUN) "serialization/test_list_ptrs_text_archive_dll" : "libs/serialization/test/test_list_ptrs.cpp" +boost-test(RUN) "serialization/test_list_ptrs_text_warchive" : "libs/serialization/test/test_list_ptrs.cpp" +boost-test(RUN) "serialization/test_list_ptrs_text_warchive_dll" : "libs/serialization/test/test_list_ptrs.cpp" +boost-test(RUN) "serialization/test_list_ptrs_binary_archive" : "libs/serialization/test/test_list_ptrs.cpp" +boost-test(RUN) "serialization/test_list_ptrs_binary_archive_dll" : "libs/serialization/test/test_list_ptrs.cpp" +boost-test(RUN) "serialization/test_list_ptrs_xml_archive" : "libs/serialization/test/test_list_ptrs.cpp" +boost-test(RUN) "serialization/test_list_ptrs_xml_archive_dll" : "libs/serialization/test/test_list_ptrs.cpp" +boost-test(RUN) "serialization/test_list_ptrs_xml_warchive" : "libs/serialization/test/test_list_ptrs.cpp" +boost-test(RUN) "serialization/test_list_ptrs_xml_warchive_dll" : "libs/serialization/test/test_list_ptrs.cpp" +boost-test(RUN) "serialization/test_list_text_archive" : "libs/serialization/test/test_list.cpp" +boost-test(RUN) "serialization/test_list_text_archive_dll" : "libs/serialization/test/test_list.cpp" +boost-test(RUN) "serialization/test_list_text_warchive" : "libs/serialization/test/test_list.cpp" +boost-test(RUN) "serialization/test_list_text_warchive_dll" : "libs/serialization/test/test_list.cpp" +boost-test(RUN) "serialization/test_list_binary_archive" : "libs/serialization/test/test_list.cpp" +boost-test(RUN) "serialization/test_list_binary_archive_dll" : "libs/serialization/test/test_list.cpp" +boost-test(RUN) "serialization/test_list_xml_archive" : "libs/serialization/test/test_list.cpp" +boost-test(RUN) "serialization/test_list_xml_archive_dll" : "libs/serialization/test/test_list.cpp" +boost-test(RUN) "serialization/test_list_xml_warchive" : "libs/serialization/test/test_list.cpp" +boost-test(RUN) "serialization/test_list_xml_warchive_dll" : "libs/serialization/test/test_list.cpp" +boost-test(RUN) "serialization/test_primitive_text_archive" : "libs/serialization/test/test_primitive.cpp" +boost-test(RUN) "serialization/test_primitive_text_archive_dll" : "libs/serialization/test/test_primitive.cpp" +boost-test(RUN) "serialization/test_primitive_text_warchive" : "libs/serialization/test/test_primitive.cpp" +boost-test(RUN) "serialization/test_primitive_text_warchive_dll" : "libs/serialization/test/test_primitive.cpp" +boost-test(RUN) "serialization/test_primitive_binary_archive" : "libs/serialization/test/test_primitive.cpp" +boost-test(RUN) "serialization/test_primitive_binary_archive_dll" : "libs/serialization/test/test_primitive.cpp" +boost-test(RUN) "serialization/test_primitive_xml_archive" : "libs/serialization/test/test_primitive.cpp" +boost-test(RUN) "serialization/test_primitive_xml_archive_dll" : "libs/serialization/test/test_primitive.cpp" +boost-test(RUN) "serialization/test_primitive_xml_warchive" : "libs/serialization/test/test_primitive.cpp" +boost-test(RUN) "serialization/test_primitive_xml_warchive_dll" : "libs/serialization/test/test_primitive.cpp" +boost-test(RUN) "serialization/test_object_text_archive" : "libs/serialization/test/test_object.cpp" +boost-test(RUN) "serialization/test_object_text_archive_dll" : "libs/serialization/test/test_object.cpp" +boost-test(RUN) "serialization/test_object_text_warchive" : "libs/serialization/test/test_object.cpp" +boost-test(RUN) "serialization/test_object_text_warchive_dll" : "libs/serialization/test/test_object.cpp" +boost-test(RUN) "serialization/test_object_binary_archive" : "libs/serialization/test/test_object.cpp" +boost-test(RUN) "serialization/test_object_binary_archive_dll" : "libs/serialization/test/test_object.cpp" +boost-test(RUN) "serialization/test_object_xml_archive" : "libs/serialization/test/test_object.cpp" +boost-test(RUN) "serialization/test_object_xml_archive_dll" : "libs/serialization/test/test_object.cpp" +boost-test(RUN) "serialization/test_object_xml_warchive" : "libs/serialization/test/test_object.cpp" +boost-test(RUN) "serialization/test_object_xml_warchive_dll" : "libs/serialization/test/test_object.cpp" +boost-test(RUN) "serialization/test_class_info_save_text_archive" : "libs/serialization/test/test_class_info_save.cpp" +boost-test(RUN) "serialization/test_class_info_save_text_archive_dll" : "libs/serialization/test/test_class_info_save.cpp" +boost-test(RUN) "serialization/test_class_info_save_text_warchive" : "libs/serialization/test/test_class_info_save.cpp" +boost-test(RUN) "serialization/test_class_info_save_text_warchive_dll" : "libs/serialization/test/test_class_info_save.cpp" +boost-test(RUN) "serialization/test_class_info_save_binary_archive" : "libs/serialization/test/test_class_info_save.cpp" +boost-test(RUN) "serialization/test_class_info_save_binary_archive_dll" : "libs/serialization/test/test_class_info_save.cpp" +boost-test(RUN) "serialization/test_class_info_save_xml_archive" : "libs/serialization/test/test_class_info_save.cpp" +boost-test(RUN) "serialization/test_class_info_save_xml_archive_dll" : "libs/serialization/test/test_class_info_save.cpp" +boost-test(RUN) "serialization/test_class_info_save_xml_warchive" : "libs/serialization/test/test_class_info_save.cpp" +boost-test(RUN) "serialization/test_class_info_save_xml_warchive_dll" : "libs/serialization/test/test_class_info_save.cpp" +boost-test(RUN) "serialization/test_class_info_load_text_archive" : "libs/serialization/test/test_class_info_load.cpp" +boost-test(RUN) "serialization/test_class_info_load_text_archive_dll" : "libs/serialization/test/test_class_info_load.cpp" +boost-test(RUN) "serialization/test_class_info_load_text_warchive" : "libs/serialization/test/test_class_info_load.cpp" +boost-test(RUN) "serialization/test_class_info_load_text_warchive_dll" : "libs/serialization/test/test_class_info_load.cpp" +boost-test(RUN) "serialization/test_class_info_load_binary_archive" : "libs/serialization/test/test_class_info_load.cpp" +boost-test(RUN) "serialization/test_class_info_load_binary_archive_dll" : "libs/serialization/test/test_class_info_load.cpp" +boost-test(RUN) "serialization/test_class_info_load_xml_archive" : "libs/serialization/test/test_class_info_load.cpp" +boost-test(RUN) "serialization/test_class_info_load_xml_archive_dll" : "libs/serialization/test/test_class_info_load.cpp" +boost-test(RUN) "serialization/test_class_info_load_xml_warchive" : "libs/serialization/test/test_class_info_load.cpp" +boost-test(RUN) "serialization/test_class_info_load_xml_warchive_dll" : "libs/serialization/test/test_class_info_load.cpp" +boost-test(RUN) "serialization/test_exported_text_archive" : "libs/serialization/test/test_exported.cpp" +boost-test(RUN) "serialization/test_exported_text_archive_dll" : "libs/serialization/test/test_exported.cpp" +boost-test(RUN) "serialization/test_exported_text_warchive" : "libs/serialization/test/test_exported.cpp" +boost-test(RUN) "serialization/test_exported_text_warchive_dll" : "libs/serialization/test/test_exported.cpp" +boost-test(RUN) "serialization/test_exported_binary_archive" : "libs/serialization/test/test_exported.cpp" +boost-test(RUN) "serialization/test_exported_binary_archive_dll" : "libs/serialization/test/test_exported.cpp" +boost-test(RUN) "serialization/test_exported_xml_archive" : "libs/serialization/test/test_exported.cpp" +boost-test(RUN) "serialization/test_exported_xml_archive_dll" : "libs/serialization/test/test_exported.cpp" +boost-test(RUN) "serialization/test_exported_xml_warchive" : "libs/serialization/test/test_exported.cpp" +boost-test(RUN) "serialization/test_exported_xml_warchive_dll" : "libs/serialization/test/test_exported.cpp" +boost-test(RUN) "serialization/test_diamond_text_archive" : "libs/serialization/test/test_diamond.cpp" +boost-test(RUN) "serialization/test_diamond_text_archive_dll" : "libs/serialization/test/test_diamond.cpp" +boost-test(RUN) "serialization/test_diamond_text_warchive" : "libs/serialization/test/test_diamond.cpp" +boost-test(RUN) "serialization/test_diamond_text_warchive_dll" : "libs/serialization/test/test_diamond.cpp" +boost-test(RUN) "serialization/test_diamond_binary_archive" : "libs/serialization/test/test_diamond.cpp" +boost-test(RUN) "serialization/test_diamond_binary_archive_dll" : "libs/serialization/test/test_diamond.cpp" +boost-test(RUN) "serialization/test_diamond_xml_archive" : "libs/serialization/test/test_diamond.cpp" +boost-test(RUN) "serialization/test_diamond_xml_archive_dll" : "libs/serialization/test/test_diamond.cpp" +boost-test(RUN) "serialization/test_diamond_xml_warchive" : "libs/serialization/test/test_diamond.cpp" +boost-test(RUN) "serialization/test_diamond_xml_warchive_dll" : "libs/serialization/test/test_diamond.cpp" +boost-test(RUN) "serialization/test_derived_class_ptr_text_archive" : "libs/serialization/test/test_derived_class_ptr.cpp" +boost-test(RUN) "serialization/test_derived_class_ptr_text_archive_dll" : "libs/serialization/test/test_derived_class_ptr.cpp" +boost-test(RUN) "serialization/test_derived_class_ptr_text_warchive" : "libs/serialization/test/test_derived_class_ptr.cpp" +boost-test(RUN) "serialization/test_derived_class_ptr_text_warchive_dll" : "libs/serialization/test/test_derived_class_ptr.cpp" +boost-test(RUN) "serialization/test_derived_class_ptr_binary_archive" : "libs/serialization/test/test_derived_class_ptr.cpp" +boost-test(RUN) "serialization/test_derived_class_ptr_binary_archive_dll" : "libs/serialization/test/test_derived_class_ptr.cpp" +boost-test(RUN) "serialization/test_derived_class_ptr_xml_archive" : "libs/serialization/test/test_derived_class_ptr.cpp" +boost-test(RUN) "serialization/test_derived_class_ptr_xml_archive_dll" : "libs/serialization/test/test_derived_class_ptr.cpp" +boost-test(RUN) "serialization/test_derived_class_ptr_xml_warchive" : "libs/serialization/test/test_derived_class_ptr.cpp" +boost-test(RUN) "serialization/test_derived_class_ptr_xml_warchive_dll" : "libs/serialization/test/test_derived_class_ptr.cpp" +boost-test(RUN) "serialization/test_derived_class_text_archive" : "libs/serialization/test/test_derived_class.cpp" +boost-test(RUN) "serialization/test_derived_class_text_archive_dll" : "libs/serialization/test/test_derived_class.cpp" +boost-test(RUN) "serialization/test_derived_class_text_warchive" : "libs/serialization/test/test_derived_class.cpp" +boost-test(RUN) "serialization/test_derived_class_text_warchive_dll" : "libs/serialization/test/test_derived_class.cpp" +boost-test(RUN) "serialization/test_derived_class_binary_archive" : "libs/serialization/test/test_derived_class.cpp" +boost-test(RUN) "serialization/test_derived_class_binary_archive_dll" : "libs/serialization/test/test_derived_class.cpp" +boost-test(RUN) "serialization/test_derived_class_xml_archive" : "libs/serialization/test/test_derived_class.cpp" +boost-test(RUN) "serialization/test_derived_class_xml_archive_dll" : "libs/serialization/test/test_derived_class.cpp" +boost-test(RUN) "serialization/test_derived_class_xml_warchive" : "libs/serialization/test/test_derived_class.cpp" +boost-test(RUN) "serialization/test_derived_class_xml_warchive_dll" : "libs/serialization/test/test_derived_class.cpp" +boost-test(RUN) "serialization/test_derived_text_archive" : "libs/serialization/test/test_derived.cpp" +boost-test(RUN) "serialization/test_derived_text_archive_dll" : "libs/serialization/test/test_derived.cpp" +boost-test(RUN) "serialization/test_derived_text_warchive" : "libs/serialization/test/test_derived.cpp" +boost-test(RUN) "serialization/test_derived_text_warchive_dll" : "libs/serialization/test/test_derived.cpp" +boost-test(RUN) "serialization/test_derived_binary_archive" : "libs/serialization/test/test_derived.cpp" +boost-test(RUN) "serialization/test_derived_binary_archive_dll" : "libs/serialization/test/test_derived.cpp" +boost-test(RUN) "serialization/test_derived_xml_archive" : "libs/serialization/test/test_derived.cpp" +boost-test(RUN) "serialization/test_derived_xml_archive_dll" : "libs/serialization/test/test_derived.cpp" +boost-test(RUN) "serialization/test_derived_xml_warchive" : "libs/serialization/test/test_derived.cpp" +boost-test(RUN) "serialization/test_derived_xml_warchive_dll" : "libs/serialization/test/test_derived.cpp" +boost-test(RUN) "serialization/test_deque_text_archive" : "libs/serialization/test/test_deque.cpp" +boost-test(RUN) "serialization/test_deque_text_archive_dll" : "libs/serialization/test/test_deque.cpp" +boost-test(RUN) "serialization/test_deque_text_warchive" : "libs/serialization/test/test_deque.cpp" +boost-test(RUN) "serialization/test_deque_text_warchive_dll" : "libs/serialization/test/test_deque.cpp" +boost-test(RUN) "serialization/test_deque_binary_archive" : "libs/serialization/test/test_deque.cpp" +boost-test(RUN) "serialization/test_deque_binary_archive_dll" : "libs/serialization/test/test_deque.cpp" +boost-test(RUN) "serialization/test_deque_xml_archive" : "libs/serialization/test/test_deque.cpp" +boost-test(RUN) "serialization/test_deque_xml_archive_dll" : "libs/serialization/test/test_deque.cpp" +boost-test(RUN) "serialization/test_deque_xml_warchive" : "libs/serialization/test/test_deque.cpp" +boost-test(RUN) "serialization/test_deque_xml_warchive_dll" : "libs/serialization/test/test_deque.cpp" +boost-test(RUN) "serialization/test_delete_pointer_text_archive" : "libs/serialization/test/test_delete_pointer.cpp" +boost-test(RUN) "serialization/test_delete_pointer_text_archive_dll" : "libs/serialization/test/test_delete_pointer.cpp" +boost-test(RUN) "serialization/test_delete_pointer_text_warchive" : "libs/serialization/test/test_delete_pointer.cpp" +boost-test(RUN) "serialization/test_delete_pointer_text_warchive_dll" : "libs/serialization/test/test_delete_pointer.cpp" +boost-test(RUN) "serialization/test_delete_pointer_binary_archive" : "libs/serialization/test/test_delete_pointer.cpp" +boost-test(RUN) "serialization/test_delete_pointer_binary_archive_dll" : "libs/serialization/test/test_delete_pointer.cpp" +boost-test(RUN) "serialization/test_delete_pointer_xml_archive" : "libs/serialization/test/test_delete_pointer.cpp" +boost-test(RUN) "serialization/test_delete_pointer_xml_archive_dll" : "libs/serialization/test/test_delete_pointer.cpp" +boost-test(RUN) "serialization/test_delete_pointer_xml_warchive" : "libs/serialization/test/test_delete_pointer.cpp" +boost-test(RUN) "serialization/test_delete_pointer_xml_warchive_dll" : "libs/serialization/test/test_delete_pointer.cpp" +boost-test(RUN) "serialization/test_cyclic_ptrs_text_archive" : "libs/serialization/test/test_cyclic_ptrs.cpp" +boost-test(RUN) "serialization/test_cyclic_ptrs_text_archive_dll" : "libs/serialization/test/test_cyclic_ptrs.cpp" +boost-test(RUN) "serialization/test_cyclic_ptrs_text_warchive" : "libs/serialization/test/test_cyclic_ptrs.cpp" +boost-test(RUN) "serialization/test_cyclic_ptrs_text_warchive_dll" : "libs/serialization/test/test_cyclic_ptrs.cpp" +boost-test(RUN) "serialization/test_cyclic_ptrs_binary_archive" : "libs/serialization/test/test_cyclic_ptrs.cpp" +boost-test(RUN) "serialization/test_cyclic_ptrs_binary_archive_dll" : "libs/serialization/test/test_cyclic_ptrs.cpp" +boost-test(RUN) "serialization/test_cyclic_ptrs_xml_archive" : "libs/serialization/test/test_cyclic_ptrs.cpp" +boost-test(RUN) "serialization/test_cyclic_ptrs_xml_archive_dll" : "libs/serialization/test/test_cyclic_ptrs.cpp" +boost-test(RUN) "serialization/test_cyclic_ptrs_xml_warchive" : "libs/serialization/test/test_cyclic_ptrs.cpp" +boost-test(RUN) "serialization/test_cyclic_ptrs_xml_warchive_dll" : "libs/serialization/test/test_cyclic_ptrs.cpp" +boost-test(RUN) "serialization/test_contained_class_text_archive" : "libs/serialization/test/test_contained_class.cpp" +boost-test(RUN) "serialization/test_contained_class_text_archive_dll" : "libs/serialization/test/test_contained_class.cpp" +boost-test(RUN) "serialization/test_contained_class_text_warchive" : "libs/serialization/test/test_contained_class.cpp" +boost-test(RUN) "serialization/test_contained_class_text_warchive_dll" : "libs/serialization/test/test_contained_class.cpp" +boost-test(RUN) "serialization/test_contained_class_binary_archive" : "libs/serialization/test/test_contained_class.cpp" +boost-test(RUN) "serialization/test_contained_class_binary_archive_dll" : "libs/serialization/test/test_contained_class.cpp" +boost-test(RUN) "serialization/test_contained_class_xml_archive" : "libs/serialization/test/test_contained_class.cpp" +boost-test(RUN) "serialization/test_contained_class_xml_archive_dll" : "libs/serialization/test/test_contained_class.cpp" +boost-test(RUN) "serialization/test_contained_class_xml_warchive" : "libs/serialization/test/test_contained_class.cpp" +boost-test(RUN) "serialization/test_contained_class_xml_warchive_dll" : "libs/serialization/test/test_contained_class.cpp" +boost-test(RUN) "serialization/test_binary_text_archive" : "libs/serialization/test/test_binary.cpp" +boost-test(RUN) "serialization/test_binary_text_archive_dll" : "libs/serialization/test/test_binary.cpp" +boost-test(RUN) "serialization/test_binary_text_warchive" : "libs/serialization/test/test_binary.cpp" +boost-test(RUN) "serialization/test_binary_text_warchive_dll" : "libs/serialization/test/test_binary.cpp" +boost-test(RUN) "serialization/test_binary_binary_archive" : "libs/serialization/test/test_binary.cpp" +boost-test(RUN) "serialization/test_binary_binary_archive_dll" : "libs/serialization/test/test_binary.cpp" +boost-test(RUN) "serialization/test_binary_xml_archive" : "libs/serialization/test/test_binary.cpp" +boost-test(RUN) "serialization/test_binary_xml_archive_dll" : "libs/serialization/test/test_binary.cpp" +boost-test(RUN) "serialization/test_binary_xml_warchive" : "libs/serialization/test/test_binary.cpp" +boost-test(RUN) "serialization/test_binary_xml_warchive_dll" : "libs/serialization/test/test_binary.cpp" +boost-test(RUN) "serialization/test_array_text_archive" : "libs/serialization/test/test_array.cpp" +boost-test(RUN) "serialization/test_array_text_archive_dll" : "libs/serialization/test/test_array.cpp" +boost-test(RUN) "serialization/test_array_text_warchive" : "libs/serialization/test/test_array.cpp" +boost-test(RUN) "serialization/test_array_text_warchive_dll" : "libs/serialization/test/test_array.cpp" +boost-test(RUN) "serialization/test_array_binary_archive" : "libs/serialization/test/test_array.cpp" +boost-test(RUN) "serialization/test_array_binary_archive_dll" : "libs/serialization/test/test_array.cpp" +boost-test(RUN) "serialization/test_array_xml_archive" : "libs/serialization/test/test_array.cpp" +boost-test(RUN) "serialization/test_array_xml_archive_dll" : "libs/serialization/test/test_array.cpp" +boost-test(RUN) "serialization/test_array_xml_warchive" : "libs/serialization/test/test_array.cpp" +boost-test(RUN) "serialization/test_array_xml_warchive_dll" : "libs/serialization/test/test_array.cpp" +boost-test(COMPILE) "serialization/test_const_pass" : "libs/serialization/test/test_const_pass.cpp" +boost-test(COMPILE) "serialization/test_traits_pass" : "libs/serialization/test/test_traits_pass.cpp" +boost-test(COMPILE_FAIL) "serialization/test_const_load_fail3_nvp" : "libs/serialization/test/test_const_load_fail3_nvp.cpp" +boost-test(COMPILE_FAIL) "serialization/test_const_load_fail2_nvp" : "libs/serialization/test/test_const_load_fail2_nvp.cpp" +boost-test(COMPILE_FAIL) "serialization/test_const_load_fail1_nvp" : "libs/serialization/test/test_const_load_fail1_nvp.cpp" +boost-test(COMPILE_FAIL) "serialization/test_const_load_fail3" : "libs/serialization/test/test_const_load_fail3.cpp" +boost-test(COMPILE_FAIL) "serialization/test_const_load_fail2" : "libs/serialization/test/test_const_load_fail2.cpp" +boost-test(COMPILE_FAIL) "serialization/test_const_load_fail1" : "libs/serialization/test/test_const_load_fail1.cpp" +boost-test(COMPILE_FAIL) "serialization/test_const_save_fail3" : "libs/serialization/test/test_const_save_fail3.cpp" +boost-test(COMPILE_FAIL) "serialization/test_const_save_fail2" : "libs/serialization/test/test_const_save_fail2.cpp" +boost-test(COMPILE_FAIL) "serialization/test_const_save_fail1" : "libs/serialization/test/test_const_save_fail1.cpp" +boost-test(COMPILE_FAIL) "serialization/test_traits_fail" : "libs/serialization/test/test_traits_fail.cpp" +boost-test(COMPILE_FAIL) "serialization/test_not_serializable" : "libs/serialization/test/test_not_serializable.cpp" +boost-test(RUN) "serialization/test_demo_xml_save" : "libs/serialization/test/test_demo_xml_save.cpp" +boost-test(RUN) "serialization/test_demo_xml_save_dll" : "libs/serialization/test/test_demo_xml_save.cpp" +boost-test(RUN) "serialization/test_demo_xml_load" : "libs/serialization/test/test_demo_xml_load.cpp" +boost-test(RUN) "serialization/test_demo_xml_load_dll" : "libs/serialization/test/test_demo_xml_load.cpp" +boost-test(RUN) "serialization/test_demo_xml" : "libs/serialization/test/test_demo_xml.cpp" +boost-test(RUN) "serialization/test_demo_xml_dll" : "libs/serialization/test/test_demo_xml.cpp" +boost-test(RUN) "serialization/test_demo_shared_ptr" : "libs/serialization/test/test_demo_shared_ptr.cpp" +boost-test(RUN) "serialization/test_demo_shared_ptr_dll" : "libs/serialization/test/test_demo_shared_ptr.cpp" +boost-test(RUN) "serialization/test_demo_portable_archive" : "libs/serialization/test/test_demo_portable_archive.cpp" +boost-test(RUN) "serialization/test_demo_portable_archive_dll" : "libs/serialization/test/test_demo_portable_archive.cpp" +boost-test(RUN) "serialization/test_demo_polymorphic" : "libs/serialization/test/test_demo_polymorphic.cpp" "libs/serialization/example/demo_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_demo_polymorphic_dll" : "libs/serialization/test/test_demo_polymorphic.cpp" "libs/serialization/example/demo_polymorphic_A.cpp" +boost-test(RUN) "serialization/test_demo_pimpl" : "libs/serialization/test/test_demo_pimpl.cpp" "libs/serialization/example/demo_pimpl_A.cpp" +boost-test(RUN) "serialization/test_demo_pimpl_dll" : "libs/serialization/test/test_demo_pimpl.cpp" "libs/serialization/example/demo_pimpl_A.cpp" +boost-test(RUN) "serialization/test_demo_fast_archive" : "libs/serialization/test/test_demo_fast_archive.cpp" +boost-test(RUN) "serialization/test_demo_fast_archive_dll" : "libs/serialization/test/test_demo_fast_archive.cpp" +boost-test(RUN) "serialization/test_demo_exception" : "libs/serialization/test/test_demo_exception.cpp" +boost-test(RUN) "serialization/test_demo_exception_dll" : "libs/serialization/test/test_demo_exception.cpp" +boost-test(RUN) "serialization/test_demo_auto_ptr" : "libs/serialization/test/test_demo_auto_ptr.cpp" +boost-test(RUN) "serialization/test_demo_auto_ptr_dll" : "libs/serialization/test/test_demo_auto_ptr.cpp" +boost-test(RUN) "serialization/test_demo" : "libs/serialization/test/test_demo.cpp" +boost-test(RUN) "serialization/test_demo_dll" : "libs/serialization/test/test_demo.cpp" +boost-test(RUN) "serialization/test_codecvt_null" : "libs/serialization/test/test_codecvt_null.cpp" "libs/serialization/src/codecvt_null.cpp" +boost-test(RUN) "serialization/test_mult_archive_types" : "libs/serialization/test/test_mult_archive_types.cpp" +boost-test(RUN) "serialization/test_mult_archive_types_dll" : "libs/serialization/test/test_mult_archive_types.cpp" +boost-test(RUN) "serialization/test_void_cast" : "libs/serialization/test/test_void_cast.cpp" +boost-test(RUN) "serialization/test_void_cast_dll" : "libs/serialization/test/test_void_cast.cpp" +boost-test(RUN) "serialization/test_utf8_codecvt" : "libs/serialization/test/test_utf8_codecvt.cpp" "libs/serialization/src/utf8_codecvt_facet.cpp" +boost-test(RUN) "serialization/test_static_warning" : "libs/serialization/test/test_static_warning.cpp" +boost-test(RUN) "serialization/test_smart_cast" : "libs/serialization/test/test_smart_cast.cpp" +boost-test(RUN) "serialization/test_reset_object_address" : "libs/serialization/test/test_reset_object_address.cpp" +boost-test(RUN) "serialization/test_reset_object_address_dll" : "libs/serialization/test/test_reset_object_address.cpp" +boost-test(RUN) "serialization/test_private_ctor" : "libs/serialization/test/test_private_ctor.cpp" +boost-test(RUN) "serialization/test_private_ctor_dll" : "libs/serialization/test/test_private_ctor.cpp" +boost-test(RUN) "serialization/test_inclusion" : "libs/serialization/test/test_inclusion.cpp" +boost-test(RUN) "serialization/test_iterators_base64" : "libs/serialization/test/test_iterators_base64.cpp" +boost-test(RUN) "serialization/test_iterators" : "libs/serialization/test/test_iterators.cpp" +boost-test(RUN) "signals/trackable_test" : "libs/signals/test/trackable_test.cpp" +boost-test(RUN) "signals/signal_test" : "libs/signals/test/signal_test.cpp" +boost-test(RUN) "signals/signal_n_test" : "libs/signals/test/signal_n_test.cpp" +boost-test(RUN) "signals/ordering_test" : "libs/signals/test/ordering_test.cpp" +boost-test(RUN) "signals/deletion_test" : "libs/signals/test/deletion_test.cpp" +boost-test(RUN) "signals/dead_slot_test" : "libs/signals/test/dead_slot_test.cpp" +boost-test(RUN) "smart_ptr/auto_ptr_rv_test" : "libs/smart_ptr/test/auto_ptr_rv_test.cpp" +boost-test(COMPILE) "smart_ptr/pointer_to_other_test" : "libs/smart_ptr/test/pointer_to_other_test.cpp" +boost-test(RUN) "smart_ptr/pointer_cast_test" : "libs/smart_ptr/test/pointer_cast_test.cpp" +boost-test(RUN) "smart_ptr/shared_ptr_alloc2_test" : "libs/smart_ptr/test/shared_ptr_alloc2_test.cpp" +boost-test(COMPILE_FAIL) "smart_ptr/shared_ptr_delete_fail" : "libs/smart_ptr/test/shared_ptr_delete_fail.cpp" +boost-test(COMPILE_FAIL) "smart_ptr/shared_ptr_assign_fail" : "libs/smart_ptr/test/shared_ptr_assign_fail.cpp" +boost-test(RUN) "smart_ptr/lw_mutex_test" : "libs/smart_ptr/test/lw_mutex_test.cpp" +boost-test(RUN) "smart_ptr/atomic_count_test" : "libs/smart_ptr/test/atomic_count_test.cpp" +boost-test(RUN) "smart_ptr/intrusive_ptr_test" : "libs/smart_ptr/test/intrusive_ptr_test.cpp" +boost-test(RUN) "smart_ptr/get_deleter_test" : "libs/smart_ptr/test/get_deleter_test.cpp" +boost-test(RUN) "smart_ptr/shared_from_this_test" : "libs/smart_ptr/test/shared_from_this_test.cpp" +boost-test(RUN) "smart_ptr/weak_ptr_test" : "libs/smart_ptr/test/weak_ptr_test.cpp" +boost-test(RUN) "smart_ptr/shared_ptr_test" : "libs/smart_ptr/test/shared_ptr_test.cpp" +boost-test(RUN) "smart_ptr/shared_ptr_basic_test" : "libs/smart_ptr/test/shared_ptr_basic_test.cpp" +boost-test(RUN) "smart_ptr/smart_ptr_test" : "libs/smart_ptr/test/smart_ptr_test.cpp" +boost-test(RUN) "spirit/match_tests_debug" : "libs/spirit/test/match_tests.cpp" +boost-test(RUN) "spirit/match_tests" : "libs/spirit/test/match_tests.cpp" +boost-test(RUN) "spirit/scanner_value_type_tests_debug" : "libs/spirit/test/scanner_value_type_tests.cpp" +boost-test(RUN) "spirit/scanner_value_type_tests" : "libs/spirit/test/scanner_value_type_tests.cpp" +boost-test(RUN) "spirit/scanner_tests_debug" : "libs/spirit/test/scanner_tests.cpp" +boost-test(RUN) "spirit/scanner_tests" : "libs/spirit/test/scanner_tests.cpp" +boost-test(RUN) "spirit/numerics_tests_debug" : "libs/spirit/test/numerics_tests.cpp" +boost-test(RUN) "spirit/numerics_tests" : "libs/spirit/test/numerics_tests.cpp" +boost-test(COMPILE_FAIL) "spirit/char_strings_test_fail" : "libs/spirit/test/char_strings_test_fail.cpp" +boost-test(RUN) "spirit/char_strings_test_debug" : "libs/spirit/test/char_strings_test.cpp" +boost-test(RUN) "spirit/char_strings_test" : "libs/spirit/test/char_strings_test.cpp" +boost-test(RUN) "spirit/primitives_tests_debug" : "libs/spirit/test/primitives_tests.cpp" +boost-test(RUN) "spirit/primitives_tests" : "libs/spirit/test/primitives_tests.cpp" +boost-test(RUN) "spirit/shortest_alternative_tests_debug" : "libs/spirit/test/shortest_alternative_tests.cpp" +boost-test(RUN) "spirit/shortest_alternative_tests" : "libs/spirit/test/shortest_alternative_tests.cpp" +boost-test(RUN) "spirit/directives_tests_debug" : "libs/spirit/test/directives_tests.cpp" +boost-test(RUN) "spirit/directives_tests" : "libs/spirit/test/directives_tests.cpp" +boost-test(RUN) "spirit/operators_tests_debug" : "libs/spirit/test/operators_tests.cpp" +boost-test(RUN) "spirit/operators_tests" : "libs/spirit/test/operators_tests.cpp" +boost-test(RUN) "spirit/negated_eps_p_test_debug" : "libs/spirit/test/negated_eps_p_test.cpp" +boost-test(RUN) "spirit/negated_eps_p_test" : "libs/spirit/test/negated_eps_p_test.cpp" +boost-test(RUN) "spirit/epsilon_tests_debug" : "libs/spirit/test/epsilon_tests.cpp" +boost-test(RUN) "spirit/epsilon_tests" : "libs/spirit/test/epsilon_tests.cpp" +boost-test(RUN) "spirit/parser_context_test_debug" : "libs/spirit/test/parser_context_test.cpp" +boost-test(RUN) "spirit/parser_context_test" : "libs/spirit/test/parser_context_test.cpp" +boost-test(RUN) "spirit/grammar_mt_tests" : "libs/spirit/test/grammar_mt_tests.cpp" +boost-test(RUN) "spirit/owi_mt_tests" : "libs/spirit/test/owi_mt_tests.cpp" +boost-test(RUN) "spirit/subrule_tests_debug" : "libs/spirit/test/subrule_tests.cpp" +boost-test(RUN) "spirit/subrule_tests" : "libs/spirit/test/subrule_tests.cpp" +boost-test(RUN) "spirit/grammar_multi_instance_tst_debug" : "libs/spirit/test/grammar_multi_instance_tst.cpp" +boost-test(RUN) "spirit/grammar_multi_instance_tst" : "libs/spirit/test/grammar_multi_instance_tst.cpp" +boost-test(RUN) "spirit/grammar_tests_debug" : "libs/spirit/test/grammar_tests.cpp" +boost-test(RUN) "spirit/grammar_tests" : "libs/spirit/test/grammar_tests.cpp" +boost-test(RUN) "spirit/owi_st_tests_debug" : "libs/spirit/test/owi_st_tests.cpp" +boost-test(RUN) "spirit/owi_st_tests" : "libs/spirit/test/owi_st_tests.cpp" +boost-test(RUN) "spirit/rule_tests_debug" : "libs/spirit/test/rule_tests.cpp" +boost-test(RUN) "spirit/rule_tests" : "libs/spirit/test/rule_tests.cpp" +boost-test(RUN) "spirit/traverse_tests_debug" : "libs/spirit/test/traverse_tests.cpp" +boost-test(RUN) "spirit/traverse_tests" : "libs/spirit/test/traverse_tests.cpp" +boost-test(RUN) "spirit/parser_traits_tests_debug" : "libs/spirit/test/parser_traits_tests.cpp" +boost-test(RUN) "spirit/parser_traits_tests" : "libs/spirit/test/parser_traits_tests.cpp" +boost-test(RUN) "spirit/fundamental_tests_debug" : "libs/spirit/test/fundamental_tests.cpp" +boost-test(RUN) "spirit/fundamental_tests" : "libs/spirit/test/fundamental_tests.cpp" +boost-test(RUN) "spirit/parametric_tests_debug" : "libs/spirit/test/parametric_tests.cpp" +boost-test(RUN) "spirit/parametric_tests" : "libs/spirit/test/parametric_tests.cpp" +boost-test(RUN) "spirit/bug_000008" : "libs/spirit/test/bug_000008.cpp" +boost-test(RUN) "spirit/closure_tests_debug" : "libs/spirit/test/closure_tests.cpp" +boost-test(RUN) "spirit/closure_tests" : "libs/spirit/test/closure_tests.cpp" +boost-test(RUN) "spirit/exception_tests_debug" : "libs/spirit/test/exception_tests.cpp" +boost-test(RUN) "spirit/exception_tests" : "libs/spirit/test/exception_tests.cpp" +boost-test(COMPILE) "spirit/mix_and_match_trees" : "libs/spirit/test/mix_and_match_trees.cpp" +boost-test(RUN) "spirit/repeat_ast_tests_debug" : "libs/spirit/test/repeat_ast_tests.cpp" +boost-test(RUN) "spirit/repeat_ast_tests" : "libs/spirit/test/repeat_ast_tests.cpp" +boost-test(RUN) "spirit/group_match_bug_debug" : "libs/spirit/test/group_match_bug.cpp" +boost-test(RUN) "spirit/group_match_bug" : "libs/spirit/test/group_match_bug.cpp" +boost-test(RUN) "spirit/ast_calc_tests_debug" : "libs/spirit/test/ast_calc_tests.cpp" +boost-test(RUN) "spirit/ast_calc_tests" : "libs/spirit/test/ast_calc_tests.cpp" +boost-test(RUN) "spirit/select_p_with_rule_debug" : "libs/spirit/test/select_p_with_rule.cpp" +boost-test(RUN) "spirit/select_p_with_rule" : "libs/spirit/test/select_p_with_rule.cpp" +boost-test(RUN) "spirit/switch_problem_debug" : "libs/spirit/test/switch_problem.cpp" +boost-test(RUN) "spirit/switch_problem" : "libs/spirit/test/switch_problem.cpp" +boost-test(RUN) "spirit/switch_tests_single_debug" : "libs/spirit/test/switch_tests_single.cpp" +boost-test(RUN) "spirit/switch_tests_single" : "libs/spirit/test/switch_tests_single.cpp" +boost-test(RUN) "spirit/switch_tests_wo_default_debug" : "libs/spirit/test/switch_tests_wo_default.cpp" +boost-test(RUN) "spirit/switch_tests_wo_default" : "libs/spirit/test/switch_tests_wo_default.cpp" +boost-test(RUN) "spirit/switch_tests_general_def_debug" : "libs/spirit/test/switch_tests_general_def.cpp" +boost-test(RUN) "spirit/switch_tests_general_def" : "libs/spirit/test/switch_tests_general_def.cpp" +boost-test(RUN) "spirit/switch_tests_eps_default_debug" : "libs/spirit/test/switch_tests_eps_default.cpp" +boost-test(RUN) "spirit/switch_tests_eps_default" : "libs/spirit/test/switch_tests_eps_default.cpp" +boost-test(RUN) "spirit/lazy_tests_debug" : "libs/spirit/test/lazy_tests.cpp" +boost-test(RUN) "spirit/lazy_tests" : "libs/spirit/test/lazy_tests.cpp" +boost-test(RUN) "spirit/while_tests_debug" : "libs/spirit/test/while_tests.cpp" +boost-test(RUN) "spirit/while_tests" : "libs/spirit/test/while_tests.cpp" +boost-test(RUN) "spirit/for_tests_debug" : "libs/spirit/test/for_tests.cpp" +boost-test(RUN) "spirit/for_tests" : "libs/spirit/test/for_tests.cpp" +boost-test(RUN) "spirit/if_p_int_as_condition_test_debug" : "libs/spirit/test/if_p_int_as_condition_test.cpp" +boost-test(RUN) "spirit/if_p_int_as_condition_test" : "libs/spirit/test/if_p_int_as_condition_test.cpp" +boost-test(RUN) "spirit/if_tests_debug" : "libs/spirit/test/if_tests.cpp" +boost-test(RUN) "spirit/if_tests" : "libs/spirit/test/if_tests.cpp" +boost-test(COMPILE) "spirit/for_p_as_parser_tests" : "libs/spirit/test/for_p_as_parser_tests.cpp" +boost-test(COMPILE) "spirit/while_p_as_parser_tests" : "libs/spirit/test/while_p_as_parser_tests.cpp" +boost-test(COMPILE) "spirit/if_p_as_parser_tests" : "libs/spirit/test/if_p_as_parser_tests.cpp" +boost-test(RUN) "spirit/grammar_def_test_debug" : "libs/spirit/test/grammar_def_test.cpp" +boost-test(RUN) "spirit/grammar_def_test" : "libs/spirit/test/grammar_def_test.cpp" +boost-test(RUN) "spirit/distinct_tests_debug" : "libs/spirit/test/distinct_tests.cpp" +boost-test(RUN) "spirit/distinct_tests" : "libs/spirit/test/distinct_tests.cpp" +boost-test(RUN) "spirit/escape_char_parser_tests_debug" : "libs/spirit/test/escape_char_parser_tests.cpp" +boost-test(RUN) "spirit/escape_char_parser_tests" : "libs/spirit/test/escape_char_parser_tests.cpp" +boost-test(RUN) "spirit/symbols_find_null_debug" : "libs/spirit/test/symbols_find_null.cpp" +boost-test(RUN) "spirit/symbols_find_null" : "libs/spirit/test/symbols_find_null.cpp" +boost-test(RUN) "spirit/symbols_add_null_debug" : "libs/spirit/test/symbols_add_null.cpp" +boost-test(RUN) "spirit/symbols_add_null" : "libs/spirit/test/symbols_add_null.cpp" +boost-test(RUN) "spirit/symbols_tests_debug" : "libs/spirit/test/symbols_tests.cpp" +boost-test(RUN) "spirit/symbols_tests" : "libs/spirit/test/symbols_tests.cpp" +boost-test(RUN) "spirit/loops_tests_debug" : "libs/spirit/test/loops_tests.cpp" +boost-test(RUN) "spirit/loops_tests" : "libs/spirit/test/loops_tests.cpp" +boost-test(RUN) "spirit/confix_tests_debug" : "libs/spirit/test/confix_tests.cpp" +boost-test(RUN) "spirit/confix_tests" : "libs/spirit/test/confix_tests.cpp" +boost-test(RUN) "spirit/chset_tests_debug" : "libs/spirit/test/chset_tests.cpp" +boost-test(RUN) "spirit/chset_tests" : "libs/spirit/test/chset_tests.cpp" +boost-test(RUN) "spirit/scoped_lock_tests_debug" : "libs/spirit/test/scoped_lock_tests.cpp" +boost-test(RUN) "spirit/scoped_lock_tests" : "libs/spirit/test/scoped_lock_tests.cpp" +boost-test(COMPILE) "spirit/multi_pass_compile_tests" : "libs/spirit/test/multi_pass_compile_tests.cpp" +boost-test(RUN) "spirit/position_iterator_tests_debug" : "libs/spirit/test/position_iterator_tests.cpp" +boost-test(RUN) "spirit/position_iterator_tests" : "libs/spirit/test/position_iterator_tests.cpp" +boost-test(RUN) "spirit/sf_bug_720917_debug" : "libs/spirit/test/sf_bug_720917.cpp" +boost-test(RUN) "spirit/sf_bug_720917" : "libs/spirit/test/sf_bug_720917.cpp" +boost-test(RUN) "spirit/multi_pass_tests_debug" : "libs/spirit/test/multi_pass_tests.cpp" +boost-test(RUN) "spirit/multi_pass_tests" : "libs/spirit/test/multi_pass_tests.cpp" +boost-test(RUN) "spirit/file_iterator_tests_debug" : "libs/spirit/test/file_iterator_tests.cpp" +boost-test(RUN) "spirit/file_iterator_tests" : "libs/spirit/test/file_iterator_tests.cpp" +boost-test(COMPILE_FAIL) "spirit/fixed_size_queue_fail_tests" : "libs/spirit/test/fixed_size_queue_fail_tests.cpp" +boost-test(RUN) "spirit/fixed_size_queue_tests_debug" : "libs/spirit/test/fixed_size_queue_tests.cpp" +boost-test(RUN) "spirit/fixed_size_queue_tests" : "libs/spirit/test/fixed_size_queue_tests.cpp" +boost-test(RUN) "spirit/bug_fixes_debug" : "libs/spirit/test/bug_fixes.cpp" +boost-test(RUN) "spirit/bug_fixes" : "libs/spirit/test/bug_fixes.cpp" +boost-test(RUN) "spirit/action_tests_debug" : "libs/spirit/test/actor/action_tests.cpp" "libs/spirit/test/actor/assign_test.cpp" "libs/spirit/test/actor/assign_key_test.cpp" "libs/spirit/test/actor/clear_test.cpp" "libs/spirit/test/actor/decrement_test.cpp" "libs/spirit/test/actor/erase_at_test.cpp" "libs/spirit/test/actor/increment_test.cpp" "libs/spirit/test/actor/insert_key_test.cpp" "libs/spirit/test/actor/insert_at_test.cpp" "libs/spirit/test/actor/push_back_test.cpp" "libs/spirit/test/actor/push_front_test.cpp" "libs/spirit/test/actor/swap_test.cpp" +boost-test(RUN) "spirit/action_tests" : "libs/spirit/test/actor/action_tests.cpp" "libs/spirit/test/actor/assign_test.cpp" "libs/spirit/test/actor/assign_key_test.cpp" "libs/spirit/test/actor/clear_test.cpp" "libs/spirit/test/actor/decrement_test.cpp" "libs/spirit/test/actor/erase_at_test.cpp" "libs/spirit/test/actor/increment_test.cpp" "libs/spirit/test/actor/insert_key_test.cpp" "libs/spirit/test/actor/insert_at_test.cpp" "libs/spirit/test/actor/push_back_test.cpp" "libs/spirit/test/actor/push_front_test.cpp" "libs/spirit/test/actor/swap_test.cpp" +boost-test(COMPILE) "spirit/typeof_utility" : "libs/spirit/test/typeof_support/typeof_utility.cpp" +boost-test(COMPILE) "spirit/typeof_tree" : "libs/spirit/test/typeof_support/typeof_tree.cpp" +boost-test(COMPILE) "spirit/typeof_symbols" : "libs/spirit/test/typeof_support/typeof_symbols.cpp" +boost-test(COMPILE) "spirit/typeof_iterator" : "libs/spirit/test/typeof_support/typeof_iterator.cpp" +boost-test(COMPILE) "spirit/typeof_error_handling" : "libs/spirit/test/typeof_support/typeof_error_handling.cpp" +boost-test(COMPILE) "spirit/typeof_dynamic" : "libs/spirit/test/typeof_support/typeof_dynamic.cpp" +boost-test(COMPILE) "spirit/typeof_debug" : "libs/spirit/test/typeof_support/typeof_debug.cpp" +boost-test(COMPILE) "spirit/typeof_core" : "libs/spirit/test/typeof_support/typeof_core.cpp" +boost-test(COMPILE) "spirit/typeof_attribute" : "libs/spirit/test/typeof_support/typeof_attribute.cpp" +boost-test(COMPILE) "spirit/typeof_actor" : "libs/spirit/test/typeof_support/typeof_actor.cpp" +boost-test(LINK) "statechart/StopWatch2Example" : "libs/statechart/example/StopWatch/StopWatch2.cpp" +boost-test(LINK) "statechart/StopWatchExample" : "libs/statechart/example/StopWatch/StopWatch.cpp" +boost-test(LINK) "statechart/PingPongExample" : "libs/statechart/example/PingPong/PingPong.cpp" +boost-test(LINK) "statechart/PerformanceExample" : "libs/statechart/example/Performance/Performance.cpp" +boost-test(LINK) "statechart/KeyboardExample" : "libs/statechart/example/Keyboard/Keyboard.cpp" +boost-test(LINK) "statechart/HandcraftedExample" : "libs/statechart/example/Handcrafted/Handcrafted.cpp" +boost-test(LINK) "statechart/CameraExample" : "libs/statechart/example/Camera/Camera.cpp" "libs/statechart/example/Camera/Configuring.cpp" "libs/statechart/example/Camera/Main.cpp" "libs/statechart/example/Camera/Shooting.cpp" +boost-test(LINK) "statechart/BitMachineExample" : "libs/statechart/example/BitMachine/BitMachine.cpp" +boost-test(RUN) "statechart/DllTestNative" : "libs/statechart/test/TuTestMain.cpp" +boost-test(RUN) "statechart/DllTestNormal" : "libs/statechart/test/TuTestMain.cpp" +boost-test(RUN) "statechart/LibTestNative" : "libs/statechart/test/TuTestMain.cpp" +boost-test(RUN) "statechart/LibTestNormal" : "libs/statechart/test/TuTestMain.cpp" +boost-test(RUN) "statechart/FifoSchedulerTestNormal" : "libs/statechart/test/FifoSchedulerTest.cpp" +boost-test(RUN) "statechart/FifoSchedulerTestNative" : "libs/statechart/test/FifoSchedulerTest.cpp" +boost-test(RUN) "statechart/FifoSchedulerTestRelaxed" : "libs/statechart/test/FifoSchedulerTest.cpp" +boost-test(RUN) "statechart/FifoSchedulerTestBoth" : "libs/statechart/test/FifoSchedulerTest.cpp" +boost-test(RUN) "statechart/StateIterationTestNormal" : "libs/statechart/test/StateIterationTest.cpp" +boost-test(RUN) "statechart/StateIterationTestNative" : "libs/statechart/test/StateIterationTest.cpp" +boost-test(RUN) "statechart/StateIterationTestRelaxed" : "libs/statechart/test/StateIterationTest.cpp" +boost-test(RUN) "statechart/StateIterationTestBoth" : "libs/statechart/test/StateIterationTest.cpp" +boost-test(RUN) "statechart/TypeInfoTestNormal" : "libs/statechart/test/TypeInfoTest.cpp" +boost-test(RUN) "statechart/TypeInfoTestNative" : "libs/statechart/test/TypeInfoTest.cpp" +boost-test(RUN) "statechart/TypeInfoTestRelaxed" : "libs/statechart/test/TypeInfoTest.cpp" +boost-test(RUN) "statechart/TypeInfoTestBoth" : "libs/statechart/test/TypeInfoTest.cpp" +boost-test(RUN) "statechart/StateCastTestNormal" : "libs/statechart/test/StateCastTest.cpp" +boost-test(RUN) "statechart/StateCastTestNative" : "libs/statechart/test/StateCastTest.cpp" +boost-test(RUN) "statechart/StateCastTestRelaxed" : "libs/statechart/test/StateCastTest.cpp" +boost-test(RUN) "statechart/StateCastTestBoth" : "libs/statechart/test/StateCastTest.cpp" +boost-test(COMPILE_FAIL) "statechart/UnsuppDeepHistoryTestNormal" : "libs/statechart/test/UnsuppDeepHistoryTest.cpp" +boost-test(COMPILE_FAIL) "statechart/UnsuppDeepHistoryTestNative" : "libs/statechart/test/UnsuppDeepHistoryTest.cpp" +boost-test(COMPILE_FAIL) "statechart/UnsuppDeepHistoryTestRelaxed" : "libs/statechart/test/UnsuppDeepHistoryTest.cpp" +boost-test(COMPILE_FAIL) "statechart/UnsuppDeepHistoryTestBoth" : "libs/statechart/test/UnsuppDeepHistoryTest.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest8Normal" : "libs/statechart/test/InconsistentHistoryTest8.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest8Native" : "libs/statechart/test/InconsistentHistoryTest8.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest8Relaxed" : "libs/statechart/test/InconsistentHistoryTest8.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest8Both" : "libs/statechart/test/InconsistentHistoryTest8.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest7Normal" : "libs/statechart/test/InconsistentHistoryTest7.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest7Native" : "libs/statechart/test/InconsistentHistoryTest7.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest7Relaxed" : "libs/statechart/test/InconsistentHistoryTest7.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest7Both" : "libs/statechart/test/InconsistentHistoryTest7.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest6Normal" : "libs/statechart/test/InconsistentHistoryTest6.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest6Native" : "libs/statechart/test/InconsistentHistoryTest6.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest6Relaxed" : "libs/statechart/test/InconsistentHistoryTest6.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest6Both" : "libs/statechart/test/InconsistentHistoryTest6.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest5Normal" : "libs/statechart/test/InconsistentHistoryTest5.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest5Native" : "libs/statechart/test/InconsistentHistoryTest5.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest5Relaxed" : "libs/statechart/test/InconsistentHistoryTest5.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest5Both" : "libs/statechart/test/InconsistentHistoryTest5.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest4Normal" : "libs/statechart/test/InconsistentHistoryTest4.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest4Native" : "libs/statechart/test/InconsistentHistoryTest4.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest4Relaxed" : "libs/statechart/test/InconsistentHistoryTest4.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest4Both" : "libs/statechart/test/InconsistentHistoryTest4.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest3Normal" : "libs/statechart/test/InconsistentHistoryTest3.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest3Native" : "libs/statechart/test/InconsistentHistoryTest3.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest3Relaxed" : "libs/statechart/test/InconsistentHistoryTest3.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest3Both" : "libs/statechart/test/InconsistentHistoryTest3.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest2Normal" : "libs/statechart/test/InconsistentHistoryTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest2Native" : "libs/statechart/test/InconsistentHistoryTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest2Relaxed" : "libs/statechart/test/InconsistentHistoryTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest2Both" : "libs/statechart/test/InconsistentHistoryTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest1Normal" : "libs/statechart/test/InconsistentHistoryTest1.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest1Native" : "libs/statechart/test/InconsistentHistoryTest1.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest1Relaxed" : "libs/statechart/test/InconsistentHistoryTest1.cpp" +boost-test(COMPILE_FAIL) "statechart/InconsistentHistoryTest1Both" : "libs/statechart/test/InconsistentHistoryTest1.cpp" +boost-test(RUN) "statechart/HistoryTestNormal" : "libs/statechart/test/HistoryTest.cpp" +boost-test(RUN) "statechart/HistoryTestNative" : "libs/statechart/test/HistoryTest.cpp" +boost-test(RUN) "statechart/HistoryTestRelaxed" : "libs/statechart/test/HistoryTest.cpp" +boost-test(RUN) "statechart/HistoryTestBoth" : "libs/statechart/test/HistoryTest.cpp" +boost-test(RUN) "statechart/UnconsumedResultTestNormal" : "libs/statechart/test/UnconsumedResultTest.cpp" +boost-test(RUN) "statechart/UnconsumedResultTestNative" : "libs/statechart/test/UnconsumedResultTest.cpp" +boost-test(RUN) "statechart/UnconsumedResultTestRelaxed" : "libs/statechart/test/UnconsumedResultTest.cpp" +boost-test(RUN) "statechart/UnconsumedResultTestBoth" : "libs/statechart/test/UnconsumedResultTest.cpp" +boost-test(RUN) "statechart/InvalidResultCopyTestNormal" : "libs/statechart/test/InvalidResultCopyTest.cpp" +boost-test(RUN) "statechart/InvalidResultCopyTestNative" : "libs/statechart/test/InvalidResultCopyTest.cpp" +boost-test(RUN) "statechart/InvalidResultCopyTestRelaxed" : "libs/statechart/test/InvalidResultCopyTest.cpp" +boost-test(RUN) "statechart/InvalidResultCopyTestBoth" : "libs/statechart/test/InvalidResultCopyTest.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidResultDefCtorTestNormal" : "libs/statechart/test/InvalidResultDefCtorTest.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidResultDefCtorTestNative" : "libs/statechart/test/InvalidResultDefCtorTest.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidResultDefCtorTestRelaxed" : "libs/statechart/test/InvalidResultDefCtorTest.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidResultDefCtorTestBoth" : "libs/statechart/test/InvalidResultDefCtorTest.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidResultAssignTestNormal" : "libs/statechart/test/InvalidResultAssignTest.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidResultAssignTestNative" : "libs/statechart/test/InvalidResultAssignTest.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidResultAssignTestRelaxed" : "libs/statechart/test/InvalidResultAssignTest.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidResultAssignTestBoth" : "libs/statechart/test/InvalidResultAssignTest.cpp" +boost-test(RUN) "statechart/CustomReactionTestNormal" : "libs/statechart/test/CustomReactionTest.cpp" +boost-test(RUN) "statechart/CustomReactionTestNative" : "libs/statechart/test/CustomReactionTest.cpp" +boost-test(RUN) "statechart/CustomReactionTestRelaxed" : "libs/statechart/test/CustomReactionTest.cpp" +boost-test(RUN) "statechart/CustomReactionTestBoth" : "libs/statechart/test/CustomReactionTest.cpp" +boost-test(RUN) "statechart/DeferralTestNormal" : "libs/statechart/test/DeferralTest.cpp" +boost-test(RUN) "statechart/DeferralTestNative" : "libs/statechart/test/DeferralTest.cpp" +boost-test(RUN) "statechart/DeferralTestRelaxed" : "libs/statechart/test/DeferralTest.cpp" +boost-test(RUN) "statechart/DeferralTestBoth" : "libs/statechart/test/DeferralTest.cpp" +boost-test(RUN) "statechart/TerminationTestNormal" : "libs/statechart/test/TerminationTest.cpp" +boost-test(RUN) "statechart/TerminationTestNative" : "libs/statechart/test/TerminationTest.cpp" +boost-test(RUN) "statechart/TerminationTestRelaxed" : "libs/statechart/test/TerminationTest.cpp" +boost-test(RUN) "statechart/TerminationTestBoth" : "libs/statechart/test/TerminationTest.cpp" +boost-test(RUN) "statechart/InStateReactionTestNormal" : "libs/statechart/test/InStateReactionTest.cpp" +boost-test(RUN) "statechart/InStateReactionTestNative" : "libs/statechart/test/InStateReactionTest.cpp" +boost-test(RUN) "statechart/InStateReactionTestRelaxed" : "libs/statechart/test/InStateReactionTest.cpp" +boost-test(RUN) "statechart/InStateReactionTestBoth" : "libs/statechart/test/InStateReactionTest.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidTransitionTest2Normal" : "libs/statechart/test/InvalidTransitionTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidTransitionTest2Native" : "libs/statechart/test/InvalidTransitionTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidTransitionTest2Relaxed" : "libs/statechart/test/InvalidTransitionTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidTransitionTest2Both" : "libs/statechart/test/InvalidTransitionTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidTransitionTest1Normal" : "libs/statechart/test/InvalidTransitionTest1.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidTransitionTest1Native" : "libs/statechart/test/InvalidTransitionTest1.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidTransitionTest1Relaxed" : "libs/statechart/test/InvalidTransitionTest1.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidTransitionTest1Both" : "libs/statechart/test/InvalidTransitionTest1.cpp" +boost-test(RUN) "statechart/TransitionTestNormal" : "libs/statechart/test/TransitionTest.cpp" +boost-test(RUN) "statechart/TransitionTestNative" : "libs/statechart/test/TransitionTest.cpp" +boost-test(RUN) "statechart/TransitionTestRelaxed" : "libs/statechart/test/TransitionTest.cpp" +boost-test(RUN) "statechart/TransitionTestBoth" : "libs/statechart/test/TransitionTest.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest3Normal" : "libs/statechart/test/InvalidChartTest3.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest3Native" : "libs/statechart/test/InvalidChartTest3.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest3Relaxed" : "libs/statechart/test/InvalidChartTest3.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest3Both" : "libs/statechart/test/InvalidChartTest3.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest2Normal" : "libs/statechart/test/InvalidChartTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest2Native" : "libs/statechart/test/InvalidChartTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest2Relaxed" : "libs/statechart/test/InvalidChartTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest2Both" : "libs/statechart/test/InvalidChartTest2.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest1Normal" : "libs/statechart/test/InvalidChartTest1.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest1Native" : "libs/statechart/test/InvalidChartTest1.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest1Relaxed" : "libs/statechart/test/InvalidChartTest1.cpp" +boost-test(COMPILE_FAIL) "statechart/InvalidChartTest1Both" : "libs/statechart/test/InvalidChartTest1.cpp" +boost-test(COMPILE_FAIL) "static_assert/static_assert_test_fail_10" : "libs/static_assert/static_assert_test_fail_10.cpp" +boost-test(COMPILE_FAIL) "static_assert/static_assert_test_fail_9" : "libs/static_assert/static_assert_test_fail_9.cpp" +boost-test(COMPILE_FAIL) "static_assert/static_assert_test_fail_8" : "libs/static_assert/static_assert_test_fail_8.cpp" +boost-test(COMPILE_FAIL) "static_assert/static_assert_test_fail_7" : "libs/static_assert/static_assert_test_fail_7.cpp" +boost-test(COMPILE_FAIL) "static_assert/static_assert_test_fail_6" : "libs/static_assert/static_assert_test_fail_6.cpp" +boost-test(COMPILE_FAIL) "static_assert/static_assert_test_fail_5" : "libs/static_assert/static_assert_test_fail_5.cpp" +boost-test(COMPILE_FAIL) "static_assert/static_assert_test_fail_4" : "libs/static_assert/static_assert_test_fail_4.cpp" +boost-test(COMPILE_FAIL) "static_assert/static_assert_test_fail_3" : "libs/static_assert/static_assert_test_fail_3.cpp" +boost-test(COMPILE_FAIL) "static_assert/static_assert_test_fail_2" : "libs/static_assert/static_assert_test_fail_2.cpp" +boost-test(COMPILE_FAIL) "static_assert/static_assert_test_fail_1" : "libs/static_assert/static_assert_test_fail_1.cpp" +boost-test(RUN) "static_assert/static_assert_example_3" : "libs/static_assert/static_assert_example_3.cpp" +boost-test(RUN) "static_assert/static_assert_example_2" : "libs/static_assert/static_assert_example_2.cpp" +boost-test(RUN) "static_assert/static_assert_test" : "libs/static_assert/static_assert_test.cpp" +boost-test(RUN) "test/basic_cstring_test" : "libs/test/test/basic_cstring_test.cpp" +boost-test(RUN) "test/class_properties_test" : "libs/test/test/class_properties_test.cpp" +boost-test(RUN_FAIL) "test/prg_exec_fail4" : "libs/test/test/prg_exec_fail4.cpp" +boost-test(RUN_FAIL) "test/prg_exec_fail3" : "libs/test/test/prg_exec_fail3.cpp" +boost-test(RUN_FAIL) "test/prg_exec_fail2" : "libs/test/test/prg_exec_fail2.cpp" +boost-test(RUN_FAIL) "test/prg_exec_fail1" : "libs/test/test/prg_exec_fail1.cpp" +boost-test(RUN) "test/boost_check_equal_str" : "libs/test/test/boost_check_equal_str.cpp" +boost-test(RUN) "test/token_iterator_test" : "libs/test/test/token_iterator_test.cpp" +boost-test(RUN) "test/algorithms_test" : "libs/test/test/algorithms_test.cpp" +boost-test(RUN) "test/ifstream_line_iterator_test" : "libs/test/test/ifstream_line_iterator_test.cpp" +boost-test(RUN) "test/fixed_mapping_test" : "libs/test/test/fixed_mapping_test.cpp" +boost-test(RUN) "test/custom_exception_test" : "libs/test/test/custom_exception_test.cpp" +boost-test(RUN) "test/test_case_template_test" : "libs/test/test/test_case_template_test.cpp" +boost-test(RUN) "test/test_tools_test" : "libs/test/test/test_tools_test.cpp" +boost-test(RUN) "test/test_fp_comparisons" : "libs/test/test/test_fp_comparisons.cpp" +boost-test(RUN) "test/parameterized_test_test" : "libs/test/test/parameterized_test_test.cpp" +boost-test(RUN) "test/result_report_test" : "libs/test/test/result_report_test.cpp" +boost-test(RUN) "test/output_test_stream_test" : "libs/test/test/output_test_stream_test.cpp" +boost-test(RUN) "test/foreach_test" : "libs/test/test/foreach_test.cpp" +boost-test(RUN_FAIL) "test/minimal_test" : "libs/test/test/minimal_test.cpp" +boost-test(RUN) "test/online_test" : "libs/test/test/online_test.cpp" +boost-test(RUN) "test/errors_handling_test" : "libs/test/test/errors_handling_test.cpp" +boost-test(RUN) "thread/test_barrier_lib" : "libs/thread/test/test_barrier.cpp" "libs/thread/src/tss_null.cpp" +boost-test(RUN) "thread/test_barrier" : "libs/thread/test/test_barrier.cpp" +boost-test(RUN) "thread/test_xtime_lib" : "libs/thread/test/test_xtime.cpp" "libs/thread/src/tss_null.cpp" +boost-test(RUN) "thread/test_xtime" : "libs/thread/test/test_xtime.cpp" +boost-test(RUN) "thread/test_once_lib" : "libs/thread/test/test_once.cpp" "libs/thread/src/tss_null.cpp" +boost-test(RUN) "thread/test_once" : "libs/thread/test/test_once.cpp" +boost-test(RUN) "thread/test_tss_lib" : "libs/thread/test/test_tss.cpp" "libs/thread/src/tss_null.cpp" +boost-test(RUN) "thread/test_tss" : "libs/thread/test/test_tss.cpp" +boost-test(RUN) "thread/test_condition_lib" : "libs/thread/test/test_condition.cpp" "libs/thread/src/tss_null.cpp" +boost-test(RUN) "thread/test_condition" : "libs/thread/test/test_condition.cpp" +boost-test(RUN) "thread/test_mutex_lib" : "libs/thread/test/test_mutex.cpp" "libs/thread/src/tss_null.cpp" +boost-test(RUN) "thread/test_mutex" : "libs/thread/test/test_mutex.cpp" +boost-test(RUN) "thread/test_thread_lib" : "libs/thread/test/test_thread.cpp" "libs/thread/src/tss_null.cpp" +boost-test(RUN) "thread/test_thread" : "libs/thread/test/test_thread.cpp" +boost-test(COMPILE) "tr1/test_ref_wrapper_tricky" : "libs/tr1/test/test_ref_wrapper_tricky.cpp" +boost-test(COMPILE) "tr1/std_test_ref_wrapper_tricky" : "libs/tr1/test/test_ref_wrapper_tricky.cpp" +boost-test(COMPILE) "tr1/test_result_of" : "libs/tr1/test/test_result_of.cpp" +boost-test(COMPILE) "tr1/std_test_result_of" : "libs/tr1/test/test_result_of.cpp" +boost-test(COMPILE) "tr1/test_random" : "libs/tr1/test/test_random.cpp" +boost-test(COMPILE) "tr1/std_test_random" : "libs/tr1/test/test_random.cpp" +boost-test(COMPILE) "tr1/test_mpl_header" : "libs/tr1/test/test_mpl_header.cpp" +boost-test(COMPILE) "tr1/std_test_mpl_header" : "libs/tr1/test/test_mpl_header.cpp" +boost-test(COMPILE) "tr1/test_weak_ptr_header" : "libs/tr1/test/test_weak_ptr_header.cpp" +boost-test(COMPILE) "tr1/std_test_weak_ptr_header" : "libs/tr1/test/test_weak_ptr_header.cpp" +boost-test(COMPILE) "tr1/test_bind_tricky" : "libs/tr1/test/test_bind_tricky.cpp" +boost-test(COMPILE) "tr1/std_test_bind_tricky" : "libs/tr1/test/test_bind_tricky.cpp" +boost-test(COMPILE) "tr1/test_type_traits" : "libs/tr1/test/test_type_traits.cpp" +boost-test(COMPILE) "tr1/std_test_type_traits" : "libs/tr1/test/test_type_traits.cpp" +boost-test(COMPILE) "tr1/test_reference_wrapper" : "libs/tr1/test/test_reference_wrapper.cpp" +boost-test(COMPILE) "tr1/std_test_reference_wrapper" : "libs/tr1/test/test_reference_wrapper.cpp" +boost-test(COMPILE) "tr1/test_function_header" : "libs/tr1/test/test_function_header.cpp" +boost-test(COMPILE) "tr1/std_test_function_header" : "libs/tr1/test/test_function_header.cpp" +boost-test(COMPILE) "tr1/test_shared_ptr" : "libs/tr1/test/test_shared_ptr.cpp" +boost-test(COMPILE) "tr1/std_test_shared_ptr" : "libs/tr1/test/test_shared_ptr.cpp" +boost-test(COMPILE) "tr1/test_ref_header" : "libs/tr1/test/test_ref_header.cpp" +boost-test(COMPILE) "tr1/std_test_ref_header" : "libs/tr1/test/test_ref_header.cpp" +boost-test(COMPILE) "tr1/test_shared_ptr_header" : "libs/tr1/test/test_shared_ptr_header.cpp" +boost-test(COMPILE) "tr1/std_test_shared_ptr_header" : "libs/tr1/test/test_shared_ptr_header.cpp" +boost-test(COMPILE) "tr1/test_array" : "libs/tr1/test/test_array.cpp" +boost-test(COMPILE) "tr1/std_test_array" : "libs/tr1/test/test_array.cpp" +boost-test(COMPILE) "tr1/test_complex" : "libs/tr1/test/test_complex.cpp" +boost-test(COMPILE) "tr1/std_test_complex" : "libs/tr1/test/test_complex.cpp" +boost-test(COMPILE) "tr1/test_hash" : "libs/tr1/test/test_hash.cpp" +boost-test(COMPILE) "tr1/std_test_hash" : "libs/tr1/test/test_hash.cpp" +boost-test(COMPILE) "tr1/test_tuple_tricky" : "libs/tr1/test/test_tuple_tricky.cpp" +boost-test(COMPILE) "tr1/std_test_tuple_tricky" : "libs/tr1/test/test_tuple_tricky.cpp" +boost-test(COMPILE) "tr1/test_function_tricky" : "libs/tr1/test/test_function_tricky.cpp" +boost-test(COMPILE) "tr1/std_test_function_tricky" : "libs/tr1/test/test_function_tricky.cpp" +boost-test(COMPILE) "tr1/test_mem_fn_header" : "libs/tr1/test/test_mem_fn_header.cpp" +boost-test(COMPILE) "tr1/std_test_mem_fn_header" : "libs/tr1/test/test_mem_fn_header.cpp" +boost-test(COMPILE) "tr1/test_hash_header" : "libs/tr1/test/test_hash_header.cpp" +boost-test(COMPILE) "tr1/std_test_hash_header" : "libs/tr1/test/test_hash_header.cpp" +boost-test(COMPILE) "tr1/test_function" : "libs/tr1/test/test_function.cpp" +boost-test(COMPILE) "tr1/std_test_function" : "libs/tr1/test/test_function.cpp" +boost-test(COMPILE) "tr1/test_shd_this_header" : "libs/tr1/test/test_shd_this_header.cpp" +boost-test(COMPILE) "tr1/std_test_shd_this_header" : "libs/tr1/test/test_shd_this_header.cpp" +boost-test(COMPILE) "tr1/test_mem_fn" : "libs/tr1/test/test_mem_fn.cpp" +boost-test(COMPILE) "tr1/std_test_mem_fn" : "libs/tr1/test/test_mem_fn.cpp" +boost-test(COMPILE) "tr1/test_shared_array_header" : "libs/tr1/test/test_shared_array_header.cpp" +boost-test(COMPILE) "tr1/std_test_shared_array_header" : "libs/tr1/test/test_shared_array_header.cpp" +boost-test(COMPILE) "tr1/test_type_traits_header" : "libs/tr1/test/test_type_traits_header.cpp" +boost-test(COMPILE) "tr1/std_test_type_traits_header" : "libs/tr1/test/test_type_traits_header.cpp" +boost-test(COMPILE) "tr1/test_result_of_header" : "libs/tr1/test/test_result_of_header.cpp" +boost-test(COMPILE) "tr1/std_test_result_of_header" : "libs/tr1/test/test_result_of_header.cpp" +boost-test(COMPILE) "tr1/test_regex" : "libs/tr1/test/test_regex.cpp" +boost-test(COMPILE) "tr1/std_test_regex" : "libs/tr1/test/test_regex.cpp" +boost-test(COMPILE) "tr1/test_array_tricky" : "libs/tr1/test/test_array_tricky.cpp" +boost-test(COMPILE) "tr1/std_test_array_tricky" : "libs/tr1/test/test_array_tricky.cpp" +boost-test(COMPILE) "tr1/test_tr1_include" : "libs/tr1/test/test_tr1_include.cpp" +boost-test(COMPILE) "tr1/std_test_tr1_include" : "libs/tr1/test/test_tr1_include.cpp" +boost-test(COMPILE) "tr1/test_mem_fn_tricky" : "libs/tr1/test/test_mem_fn_tricky.cpp" +boost-test(COMPILE) "tr1/std_test_mem_fn_tricky" : "libs/tr1/test/test_mem_fn_tricky.cpp" +boost-test(COMPILE) "tr1/test_complex_header" : "libs/tr1/test/test_complex_header.cpp" +boost-test(COMPILE) "tr1/std_test_complex_header" : "libs/tr1/test/test_complex_header.cpp" +boost-test(COMPILE) "tr1/test_tuple" : "libs/tr1/test/test_tuple.cpp" +boost-test(COMPILE) "tr1/std_test_tuple" : "libs/tr1/test/test_tuple.cpp" +boost-test(COMPILE) "tr1/test_integral_const_header" : "libs/tr1/test/test_integral_const_header.cpp" +boost-test(COMPILE) "tr1/std_test_integral_const_header" : "libs/tr1/test/test_integral_const_header.cpp" +boost-test(COMPILE) "tr1/test_bind_header" : "libs/tr1/test/test_bind_header.cpp" +boost-test(COMPILE) "tr1/std_test_bind_header" : "libs/tr1/test/test_bind_header.cpp" +boost-test(COMPILE) "tr1/test_bind" : "libs/tr1/test/test_bind.cpp" +boost-test(COMPILE) "tr1/std_test_bind" : "libs/tr1/test/test_bind.cpp" +boost-test(RUN) "tr1/run_random" : "libs/tr1/test/run_random.cpp" +boost-test(RUN) "tr1/std_run_random" : "libs/tr1/test/run_random.cpp" +boost-test(RUN) "tr1/run_complex_overloads" : "libs/tr1/test/run_complex_overloads.cpp" +boost-test(RUN) "tr1/std_run_complex_overloads" : "libs/tr1/test/run_complex_overloads.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_mem_fn_fail" : "libs/tr1/test/config/tr1_has_tr1_mem_fn_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_cx_over_fail" : "libs/tr1/test/config/tr1_has_tr1_cx_over_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_function_fail" : "libs/tr1/test/config/tr1_has_tr1_function_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_random_fail" : "libs/tr1/test/config/tr1_has_tr1_random_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_un_map_fail" : "libs/tr1/test/config/tr1_has_tr1_un_map_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_result_of_fail" : "libs/tr1/test/config/tr1_has_tr1_result_of_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_un_set_fail" : "libs/tr1/test/config/tr1_has_tr1_un_set_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_array_fail" : "libs/tr1/test/config/tr1_has_tr1_array_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_shared_ptr_fail" : "libs/tr1/test/config/tr1_has_tr1_shared_ptr_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_utility_fail" : "libs/tr1/test/config/tr1_has_tr1_utility_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_regex_fail" : "libs/tr1/test/config/tr1_has_tr1_regex_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_bind_fail" : "libs/tr1/test/config/tr1_has_tr1_bind_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_tt_fail" : "libs/tr1/test/config/tr1_has_tr1_tt_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_ref_wrap_fail" : "libs/tr1/test/config/tr1_has_tr1_ref_wrap_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_hash_fail" : "libs/tr1/test/config/tr1_has_tr1_hash_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_tuple_fail" : "libs/tr1/test/config/tr1_has_tr1_tuple_fail.cpp" +boost-test(COMPILE_FAIL) "tr1/tr1_has_tr1_cx_trig_fail" : "libs/tr1/test/config/tr1_has_tr1_cx_trig_fail.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_tt_pass" : "libs/tr1/test/config/tr1_has_tr1_tt_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_ref_wrap_pass" : "libs/tr1/test/config/tr1_has_tr1_ref_wrap_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_hash_pass" : "libs/tr1/test/config/tr1_has_tr1_hash_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_tuple_pass" : "libs/tr1/test/config/tr1_has_tr1_tuple_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_cx_trig_pass" : "libs/tr1/test/config/tr1_has_tr1_cx_trig_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_mem_fn_pass" : "libs/tr1/test/config/tr1_has_tr1_mem_fn_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_cx_over_pass" : "libs/tr1/test/config/tr1_has_tr1_cx_over_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_function_pass" : "libs/tr1/test/config/tr1_has_tr1_function_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_random_pass" : "libs/tr1/test/config/tr1_has_tr1_random_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_un_map_pass" : "libs/tr1/test/config/tr1_has_tr1_un_map_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_result_of_pass" : "libs/tr1/test/config/tr1_has_tr1_result_of_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_un_set_pass" : "libs/tr1/test/config/tr1_has_tr1_un_set_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_array_pass" : "libs/tr1/test/config/tr1_has_tr1_array_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_shared_ptr_pass" : "libs/tr1/test/config/tr1_has_tr1_shared_ptr_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_utility_pass" : "libs/tr1/test/config/tr1_has_tr1_utility_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_regex_pass" : "libs/tr1/test/config/tr1_has_tr1_regex_pass.cpp" +boost-test(COMPILE) "tr1/tr1_has_tr1_bind_pass" : "libs/tr1/test/config/tr1_has_tr1_bind_pass.cpp" +boost-test(RUN) "tr1/tr1_has_nothrow_assign_test" : "libs/tr1/test/type_traits/tr1_has_nothrow_assign_test.cpp" +boost-test(RUN) "tr1/tr1_is_class_test" : "libs/tr1/test/type_traits/tr1_is_class_test.cpp" +boost-test(RUN) "tr1/tr1_remove_extent_test" : "libs/tr1/test/type_traits/tr1_remove_extent_test.cpp" +boost-test(RUN) "tr1/tr1_is_enum_test" : "libs/tr1/test/type_traits/tr1_is_enum_test.cpp" +boost-test(RUN) "tr1/tr1_remove_pointer_test" : "libs/tr1/test/type_traits/tr1_remove_pointer_test.cpp" +boost-test(RUN) "tr1/tr1_is_empty_test" : "libs/tr1/test/type_traits/tr1_is_empty_test.cpp" +boost-test(RUN) "tr1/tr1_add_pointer_test" : "libs/tr1/test/type_traits/tr1_add_pointer_test.cpp" +boost-test(RUN) "tr1/tr1_remove_cv_test" : "libs/tr1/test/type_traits/tr1_remove_cv_test.cpp" +boost-test(RUN) "tr1/tr1_is_convertible_test" : "libs/tr1/test/type_traits/tr1_is_convertible_test.cpp" +boost-test(RUN) "tr1/tr1_is_same_test" : "libs/tr1/test/type_traits/tr1_is_same_test.cpp" +boost-test(RUN) "tr1/tr1_tky_partial_spec_test" : "libs/tr1/test/type_traits/tr1_tky_partial_spec_test.cpp" +boost-test(RUN) "tr1/tr1_add_volatile_test" : "libs/tr1/test/type_traits/tr1_add_volatile_test.cpp" +boost-test(RUN) "tr1/tr1_add_const_test" : "libs/tr1/test/type_traits/tr1_add_const_test.cpp" +boost-test(RUN) "tr1/tr1_is_member_obj_test" : "libs/tr1/test/type_traits/tr1_is_member_obj_test.cpp" +boost-test(RUN) "tr1/tr1_has_trivial_destr_test" : "libs/tr1/test/type_traits/tr1_has_trivial_destr_test.cpp" +boost-test(RUN) "tr1/tr1_extent_test" : "libs/tr1/test/type_traits/tr1_extent_test.cpp" +boost-test(RUN) "tr1/tr1_is_unsigned_test" : "libs/tr1/test/type_traits/tr1_is_unsigned_test.cpp" +boost-test(RUN) "tr1/tr1_is_base_of_test" : "libs/tr1/test/type_traits/tr1_is_base_of_test.cpp" +boost-test(RUN) "tr1/tr1_is_scalar_test" : "libs/tr1/test/type_traits/tr1_is_scalar_test.cpp" +boost-test(RUN) "tr1/tr1_is_void_test" : "libs/tr1/test/type_traits/tr1_is_void_test.cpp" +boost-test(RUN) "tr1/tr1_rank_test" : "libs/tr1/test/type_traits/tr1_rank_test.cpp" +boost-test(RUN) "tr1/tr1_tky_incomp_type_test" : "libs/tr1/test/type_traits/tr1_tky_incomp_type_test.cpp" +boost-test(RUN) "tr1/tr1_remove_all_extents_test" : "libs/tr1/test/type_traits/tr1_remove_all_extents_test.cpp" +boost-test(RUN) "tr1/tr1_add_cv_test" : "libs/tr1/test/type_traits/tr1_add_cv_test.cpp" +boost-test(RUN) "tr1/tr1_tricky_add_pointer_test" : "libs/tr1/test/type_traits/tr1_tricky_add_pointer_test.cpp" +boost-test(RUN) "tr1/tr1_has_trivial_assign_test" : "libs/tr1/test/type_traits/tr1_has_trivial_assign_test.cpp" +boost-test(RUN) "tr1/tr1_is_union_test" : "libs/tr1/test/type_traits/tr1_is_union_test.cpp" +boost-test(RUN) "tr1/tr1_is_pointer_test" : "libs/tr1/test/type_traits/tr1_is_pointer_test.cpp" +boost-test(RUN) "tr1/tr1_is_member_pointer_test" : "libs/tr1/test/type_traits/tr1_is_member_pointer_test.cpp" +boost-test(RUN) "tr1/tr1_is_const_test" : "libs/tr1/test/type_traits/tr1_is_const_test.cpp" +boost-test(RUN) "tr1/tr1_is_fundamental_test" : "libs/tr1/test/type_traits/tr1_is_fundamental_test.cpp" +boost-test(RUN) "tr1/tr1_is_volatile_test" : "libs/tr1/test/type_traits/tr1_is_volatile_test.cpp" +boost-test(RUN) "tr1/tr1_remove_const_test" : "libs/tr1/test/type_traits/tr1_remove_const_test.cpp" +boost-test(RUN) "tr1/tr1_has_nothrow_constr_test" : "libs/tr1/test/type_traits/tr1_has_nothrow_constr_test.cpp" +boost-test(RUN) "tr1/tr1_is_pod_test" : "libs/tr1/test/type_traits/tr1_is_pod_test.cpp" +boost-test(RUN) "tr1/tr1_is_polymorphic_test" : "libs/tr1/test/type_traits/tr1_is_polymorphic_test.cpp" +boost-test(RUN) "tr1/tr1_has_virtual_destr_test" : "libs/tr1/test/type_traits/tr1_has_virtual_destr_test.cpp" +boost-test(RUN) "tr1/tr1_is_object_test" : "libs/tr1/test/type_traits/tr1_is_object_test.cpp" +boost-test(RUN) "tr1/tr1_has_trivial_copy_test" : "libs/tr1/test/type_traits/tr1_has_trivial_copy_test.cpp" +boost-test(RUN) "tr1/tr1_is_array_test" : "libs/tr1/test/type_traits/tr1_is_array_test.cpp" +boost-test(RUN) "tr1/tr1_is_compound_test" : "libs/tr1/test/type_traits/tr1_is_compound_test.cpp" +boost-test(RUN) "tr1/tr1_aligned_storage_test" : "libs/tr1/test/type_traits/tr1_aligned_storage_test.cpp" +boost-test(RUN) "tr1/tr1_add_reference_test" : "libs/tr1/test/type_traits/tr1_add_reference_test.cpp" +boost-test(RUN) "tr1/tr1_tky_abstract_type_test" : "libs/tr1/test/type_traits/tr1_tky_abstract_type_test.cpp" +boost-test(RUN) "tr1/tr1_is_floating_point_test" : "libs/tr1/test/type_traits/tr1_is_floating_point_test.cpp" +boost-test(RUN) "tr1/tr1_is_integral_test" : "libs/tr1/test/type_traits/tr1_is_integral_test.cpp" +boost-test(RUN) "tr1/tr1_is_function_test" : "libs/tr1/test/type_traits/tr1_is_function_test.cpp" +boost-test(RUN) "tr1/tr1_is_abstract_test" : "libs/tr1/test/type_traits/tr1_is_abstract_test.cpp" +boost-test(RUN) "tr1/tr1_tricky_is_enum_test" : "libs/tr1/test/type_traits/tr1_tricky_is_enum_test.cpp" +boost-test(RUN) "tr1/tr1_remove_reference_test" : "libs/tr1/test/type_traits/tr1_remove_reference_test.cpp" +boost-test(RUN) "tr1/tr1_tky_function_type_test" : "libs/tr1/test/type_traits/tr1_tky_function_type_test.cpp" +boost-test(RUN) "tr1/tr1_is_signed_test" : "libs/tr1/test/type_traits/tr1_is_signed_test.cpp" +boost-test(RUN) "tr1/tr1_alignment_of_test" : "libs/tr1/test/type_traits/tr1_alignment_of_test.cpp" +boost-test(RUN) "tr1/tr1_has_nothrow_copy_test" : "libs/tr1/test/type_traits/tr1_has_nothrow_copy_test.cpp" +boost-test(RUN) "tr1/tr1_is_arithmetic_test" : "libs/tr1/test/type_traits/tr1_is_arithmetic_test.cpp" +boost-test(RUN) "tr1/tr1_is_reference_test" : "libs/tr1/test/type_traits/tr1_is_reference_test.cpp" +boost-test(RUN) "tr1/tr1_has_trivial_constr_test" : "libs/tr1/test/type_traits/tr1_has_trivial_constr_test.cpp" +boost-test(RUN) "tr1/tr1_remove_volatile_test" : "libs/tr1/test/type_traits/tr1_remove_volatile_test.cpp" +boost-test(RUN) "tr1/tr1_is_member_func_test" : "libs/tr1/test/type_traits/tr1_is_member_func_test.cpp" +boost-test(COMPILE) "tr1/test_list_std_header" : "libs/tr1/test/std_headers/test_list.cpp" +boost-test(COMPILE) "tr1/test_stdexcept_std_header" : "libs/tr1/test/std_headers/test_stdexcept.cpp" +boost-test(COMPILE) "tr1/test_istream_std_header" : "libs/tr1/test/std_headers/test_istream.cpp" +boost-test(COMPILE) "tr1/test_iomanip_std_header" : "libs/tr1/test/std_headers/test_iomanip.cpp" +boost-test(COMPILE) "tr1/test_set_std_header" : "libs/tr1/test/std_headers/test_set.cpp" +boost-test(COMPILE) "tr1/test_memory_std_header" : "libs/tr1/test/std_headers/test_memory.cpp" +boost-test(COMPILE) "tr1/test_vector_std_header" : "libs/tr1/test/std_headers/test_vector.cpp" +boost-test(COMPILE) "tr1/test_map_std_header" : "libs/tr1/test/std_headers/test_map.cpp" +boost-test(COMPILE) "tr1/test_typeinfo_std_header" : "libs/tr1/test/std_headers/test_typeinfo.cpp" +boost-test(COMPILE) "tr1/test_algorithm_std_header" : "libs/tr1/test/std_headers/test_algorithm.cpp" +boost-test(COMPILE) "tr1/test_limits_std_header" : "libs/tr1/test/std_headers/test_limits.cpp" +boost-test(COMPILE) "tr1/test_functional_std_header" : "libs/tr1/test/std_headers/test_functional.cpp" +boost-test(COMPILE) "tr1/test_sstream_std_header" : "libs/tr1/test/std_headers/test_sstream.cpp" +boost-test(COMPILE) "tr1/test_numeric_std_header" : "libs/tr1/test/std_headers/test_numeric.cpp" +boost-test(COMPILE) "tr1/test_deque_std_header" : "libs/tr1/test/std_headers/test_deque.cpp" +boost-test(COMPILE) "tr1/test_bitset_std_header" : "libs/tr1/test/std_headers/test_bitset.cpp" +boost-test(COMPILE) "tr1/test_strstream_std_header" : "libs/tr1/test/std_headers/test_strstream.cpp" +boost-test(COMPILE) "tr1/test_new_std_header" : "libs/tr1/test/std_headers/test_new.cpp" +boost-test(COMPILE) "tr1/test_complex_std_header" : "libs/tr1/test/std_headers/test_complex.cpp" +boost-test(COMPILE) "tr1/test_locale_std_header" : "libs/tr1/test/std_headers/test_locale.cpp" +boost-test(COMPILE) "tr1/test_stack_std_header" : "libs/tr1/test/std_headers/test_stack.cpp" +boost-test(COMPILE) "tr1/test_string_std_header" : "libs/tr1/test/std_headers/test_string.cpp" +boost-test(COMPILE) "tr1/test_ostream_std_header" : "libs/tr1/test/std_headers/test_ostream.cpp" +boost-test(COMPILE) "tr1/test_valarray_std_header" : "libs/tr1/test/std_headers/test_valarray.cpp" +boost-test(COMPILE) "tr1/test_exception_std_header" : "libs/tr1/test/std_headers/test_exception.cpp" +boost-test(COMPILE) "tr1/test_streambuf_std_header" : "libs/tr1/test/std_headers/test_streambuf.cpp" +boost-test(COMPILE) "tr1/test_iterator_std_header" : "libs/tr1/test/std_headers/test_iterator.cpp" +boost-test(COMPILE) "tr1/test_queue_std_header" : "libs/tr1/test/std_headers/test_queue.cpp" +boost-test(COMPILE) "tr1/test_iostream_std_header" : "libs/tr1/test/std_headers/test_iostream.cpp" +boost-test(COMPILE) "tr1/test_ios_std_header" : "libs/tr1/test/std_headers/test_ios.cpp" +boost-test(COMPILE) "tr1/test_utility_std_header" : "libs/tr1/test/std_headers/test_utility.cpp" +boost-test(COMPILE) "tr1/test_fstream_std_header" : "libs/tr1/test/std_headers/test_fstream.cpp" +boost-test(RUN) "type_traits/tricky_function_type_test" : "libs/type_traits/test/tricky_function_type_test.cpp" +boost-test(RUN) "type_traits/is_convertible_test" : "libs/type_traits/test/is_convertible_test.cpp" +boost-test(RUN) "type_traits/is_reference_test" : "libs/type_traits/test/is_reference_test.cpp" +boost-test(RUN) "type_traits/aligned_storage_test" : "libs/type_traits/test/aligned_storage_test.cpp" +boost-test(RUN) "type_traits/is_member_obj_test" : "libs/type_traits/test/is_member_obj_test.cpp" +boost-test(RUN) "type_traits/tricky_add_pointer_test" : "libs/type_traits/test/tricky_add_pointer_test.cpp" +boost-test(RUN) "type_traits/is_const_test" : "libs/type_traits/test/is_const_test.cpp" +boost-test(RUN) "type_traits/extent_test" : "libs/type_traits/test/extent_test.cpp" +boost-test(RUN) "type_traits/has_trivial_assign_test" : "libs/type_traits/test/has_trivial_assign_test.cpp" +boost-test(RUN) "type_traits/is_same_test" : "libs/type_traits/test/is_same_test.cpp" +boost-test(RUN) "type_traits/has_nothrow_constr_test" : "libs/type_traits/test/has_nothrow_constr_test.cpp" +boost-test(RUN) "type_traits/type_with_alignment_test" : "libs/type_traits/test/type_with_alignment_test.cpp" +boost-test(RUN) "type_traits/add_cv_test" : "libs/type_traits/test/add_cv_test.cpp" +boost-test(RUN) "type_traits/has_virtual_destructor_test" : "libs/type_traits/test/has_virtual_destructor_test.cpp" +boost-test(RUN) "type_traits/has_trivial_copy_test" : "libs/type_traits/test/has_trivial_copy_test.cpp" +boost-test(RUN) "type_traits/is_array_test" : "libs/type_traits/test/is_array_test.cpp" +boost-test(RUN) "type_traits/tricky_incomplete_type_test" : "libs/type_traits/test/tricky_incomplete_type_test.cpp" +boost-test(RUN) "type_traits/is_floating_point_test" : "libs/type_traits/test/is_floating_point_test.cpp" +boost-test(RUN) "type_traits/is_void_test" : "libs/type_traits/test/is_void_test.cpp" +boost-test(RUN) "type_traits/remove_cv_test" : "libs/type_traits/test/remove_cv_test.cpp" +boost-test(RUN) "type_traits/remove_volatile_test" : "libs/type_traits/test/remove_volatile_test.cpp" +boost-test(RUN) "type_traits/add_volatile_test" : "libs/type_traits/test/add_volatile_test.cpp" +boost-test(RUN) "type_traits/is_fundamental_test" : "libs/type_traits/test/is_fundamental_test.cpp" +boost-test(RUN) "type_traits/is_pod_test" : "libs/type_traits/test/is_pod_test.cpp" +boost-test(RUN) "type_traits/add_const_test" : "libs/type_traits/test/add_const_test.cpp" +boost-test(RUN) "type_traits/add_pointer_test" : "libs/type_traits/test/add_pointer_test.cpp" +boost-test(RUN) "type_traits/remove_reference_test" : "libs/type_traits/test/remove_reference_test.cpp" +boost-test(RUN) "type_traits/is_polymorphic_test" : "libs/type_traits/test/is_polymorphic_test.cpp" +boost-test(RUN) "type_traits/is_scalar_test" : "libs/type_traits/test/is_scalar_test.cpp" +boost-test(RUN) "type_traits/is_unsigned_test" : "libs/type_traits/test/is_unsigned_test.cpp" +boost-test(RUN) "type_traits/tricky_partial_spec_test" : "libs/type_traits/test/tricky_partial_spec_test.cpp" +boost-test(RUN) "type_traits/is_float_test" : "libs/type_traits/test/is_float_test.cpp" +boost-test(RUN) "type_traits/add_reference_test" : "libs/type_traits/test/add_reference_test.cpp" +boost-test(RUN) "type_traits/remove_bounds_test" : "libs/type_traits/test/remove_bounds_test.cpp" +boost-test(RUN) "type_traits/rank_test" : "libs/type_traits/test/rank_test.cpp" +boost-test(RUN) "type_traits/has_nothrow_copy_test" : "libs/type_traits/test/has_nothrow_copy_test.cpp" +boost-test(RUN) "type_traits/function_traits_test" : "libs/type_traits/test/function_traits_test.cpp" +boost-test(RUN) "type_traits/decay_test" : "libs/type_traits/test/decay_test.cpp" +boost-test(RUN) "type_traits/is_class_test" : "libs/type_traits/test/is_class_test.cpp" +boost-test(RUN) "type_traits/has_trivial_constr_test" : "libs/type_traits/test/has_trivial_constr_test.cpp" +boost-test(RUN) "type_traits/is_base_of_test" : "libs/type_traits/test/is_base_of_test.cpp" +boost-test(RUN) "type_traits/remove_const_test" : "libs/type_traits/test/remove_const_test.cpp" +boost-test(RUN) "type_traits/is_base_and_derived_test" : "libs/type_traits/test/is_base_and_derived_test.cpp" +boost-test(RUN) "type_traits/has_nothrow_assign_test" : "libs/type_traits/test/has_nothrow_assign_test.cpp" +boost-test(RUN) "type_traits/tricky_is_enum_test" : "libs/type_traits/test/tricky_is_enum_test.cpp" +boost-test(RUN) "type_traits/is_empty_test" : "libs/type_traits/test/is_empty_test.cpp" +boost-test(RUN) "type_traits/is_object_test" : "libs/type_traits/test/is_object_test.cpp" +boost-test(RUN) "type_traits/is_volatile_test" : "libs/type_traits/test/is_volatile_test.cpp" +boost-test(RUN) "type_traits/is_pointer_test" : "libs/type_traits/test/is_pointer_test.cpp" +boost-test(RUN) "type_traits/is_arithmetic_test" : "libs/type_traits/test/is_arithmetic_test.cpp" +boost-test(RUN) "type_traits/is_member_func_test" : "libs/type_traits/test/is_member_func_test.cpp" +boost-test(RUN) "type_traits/remove_extent_test" : "libs/type_traits/test/remove_extent_test.cpp" +boost-test(RUN) "type_traits/has_trivial_destructor_test" : "libs/type_traits/test/has_trivial_destructor_test.cpp" +boost-test(RUN) "type_traits/is_compound_test" : "libs/type_traits/test/is_compound_test.cpp" +boost-test(RUN) "type_traits/remove_pointer_test" : "libs/type_traits/test/remove_pointer_test.cpp" +boost-test(RUN) "type_traits/is_stateless_test" : "libs/type_traits/test/is_stateless_test.cpp" +boost-test(RUN) "type_traits/tricky_abstract_type_test" : "libs/type_traits/test/tricky_abstract_type_test.cpp" +boost-test(RUN) "type_traits/is_integral_test" : "libs/type_traits/test/is_integral_test.cpp" +boost-test(RUN) "type_traits/is_function_test" : "libs/type_traits/test/is_function_test.cpp" +boost-test(RUN) "type_traits/alignment_of_test" : "libs/type_traits/test/alignment_of_test.cpp" +boost-test(RUN) "type_traits/remove_all_extents_test" : "libs/type_traits/test/remove_all_extents_test.cpp" +boost-test(RUN) "type_traits/is_abstract_test" : "libs/type_traits/test/is_abstract_test.cpp" +boost-test(RUN) "type_traits/is_member_pointer_test" : "libs/type_traits/test/is_member_pointer_test.cpp" +boost-test(RUN) "type_traits/is_signed_test" : "libs/type_traits/test/is_signed_test.cpp" +boost-test(RUN) "type_traits/is_enum_test" : "libs/type_traits/test/is_enum_test.cpp" +boost-test(RUN) "type_traits/is_union_test" : "libs/type_traits/test/is_union_test.cpp" +boost-test(RUN) "type_traits/udt_specialisations" : "libs/type_traits/test/udt_specialisations.cpp" +boost-test(COMPILE) "typeof/function_emulation" : "libs/typeof/test/function.cpp" +boost-test(COMPILE) "typeof/function_native" : "libs/typeof/test/function.cpp" +boost-test(COMPILE) "typeof/noncopyable_emulation" : "libs/typeof/test/noncopyable.cpp" +boost-test(COMPILE) "typeof/noncopyable_native" : "libs/typeof/test/noncopyable.cpp" +boost-test(COMPILE) "typeof/function_binding_emulation" : "libs/typeof/test/function_binding.cpp" +boost-test(COMPILE) "typeof/function_binding_native" : "libs/typeof/test/function_binding.cpp" +boost-test(COMPILE) "typeof/type_emulation" : "libs/typeof/test/type.cpp" +boost-test(COMPILE) "typeof/type_native" : "libs/typeof/test/type.cpp" +boost-test(COMPILE) "typeof/template_tpl_emulation" : "libs/typeof/test/template_tpl.cpp" +boost-test(COMPILE) "typeof/template_tpl_native" : "libs/typeof/test/template_tpl.cpp" +boost-test(COMPILE) "typeof/std_emulation" : "libs/typeof/test/std.cpp" +boost-test(COMPILE) "typeof/std_native" : "libs/typeof/test/std.cpp" +boost-test(COMPILE) "typeof/data_member_emulation" : "libs/typeof/test/data_member.cpp" +boost-test(COMPILE) "typeof/data_member_native" : "libs/typeof/test/data_member.cpp" +boost-test(COMPILE) "typeof/member_function_emulation" : "libs/typeof/test/member_function.cpp" +boost-test(COMPILE) "typeof/member_function_native" : "libs/typeof/test/member_function.cpp" +boost-test(COMPILE) "typeof/template_type_emulation" : "libs/typeof/test/template_type.cpp" +boost-test(COMPILE) "typeof/template_type_native" : "libs/typeof/test/template_type.cpp" +boost-test(COMPILE) "typeof/modifiers_emulation" : "libs/typeof/test/modifiers.cpp" +boost-test(COMPILE) "typeof/modifiers_native" : "libs/typeof/test/modifiers.cpp" +boost-test(COMPILE) "typeof/nested_typedef_emulation" : "libs/typeof/test/nested_typedef.cpp" +boost-test(COMPILE) "typeof/nested_typedef_native" : "libs/typeof/test/nested_typedef.cpp" +boost-test(COMPILE) "typeof/template_multiword_emulation" : "libs/typeof/test/template_multiword.cpp" +boost-test(COMPILE) "typeof/template_multiword_native" : "libs/typeof/test/template_multiword.cpp" +boost-test(COMPILE) "typeof/template_int_emulation" : "libs/typeof/test/template_int.cpp" +boost-test(COMPILE) "typeof/template_int_native" : "libs/typeof/test/template_int.cpp" +boost-test(COMPILE) "typeof/template_enum_emulation" : "libs/typeof/test/template_enum.cpp" +boost-test(COMPILE) "typeof/template_enum_native" : "libs/typeof/test/template_enum.cpp" +boost-test(COMPILE) "typeof/function_ptr_emulation" : "libs/typeof/test/function_ptr.cpp" +boost-test(COMPILE) "typeof/function_ptr_native" : "libs/typeof/test/function_ptr.cpp" +boost-test(COMPILE) "typeof/function_ref_emulation" : "libs/typeof/test/function_ref.cpp" +boost-test(COMPILE) "typeof/function_ref_native" : "libs/typeof/test/function_ref.cpp" +boost-test(COMPILE) "typeof/function_ptr_from_tpl_emulation" : "libs/typeof/test/function_ptr_from_tpl.cpp" +boost-test(COMPILE) "typeof/function_ptr_from_tpl_native" : "libs/typeof/test/function_ptr_from_tpl.cpp" +boost-test(COMPILE) "typeof/template_dependent_emulation" : "libs/typeof/test/template_dependent.cpp" +boost-test(COMPILE) "typeof/template_dependent_native" : "libs/typeof/test/template_dependent.cpp" +boost-test(RUN) "typeof/odr_native" : "libs/typeof/test/odr1.cpp" "libs/typeof/test/odr2.cpp" +boost-test(RUN) "typeof/odr_emulation" : "libs/typeof/test/odr1.cpp" "libs/typeof/test/odr2.cpp" +boost-test(RUN) "typeof/odr_no_uns" : "libs/typeof/test/odr_no_uns1.cpp" "libs/typeof/test/odr_no_uns2.cpp" +boost-test(RUN) "utility/enable_if/partial_specializations" : "libs/utility/enable_if/test/partial_specializations.cpp" +boost-test(RUN) "utility/enable_if/no_disambiguation" : "libs/utility/enable_if/test/no_disambiguation.cpp" +boost-test(RUN) "utility/enable_if/namespace_disambiguation" : "libs/utility/enable_if/test/namespace_disambiguation.cpp" +boost-test(RUN) "utility/enable_if/member_templates" : "libs/utility/enable_if/test/member_templates.cpp" +boost-test(RUN) "utility/enable_if/lazy_test" : "libs/utility/enable_if/test/lazy_test.cpp" +boost-test(RUN) "utility/enable_if/lazy" : "libs/utility/enable_if/test/lazy.cpp" +boost-test(RUN) "utility/enable_if/dummy_arg_disambiguation" : "libs/utility/enable_if/test/dummy_arg_disambiguation.cpp" +boost-test(RUN) "utility/enable_if/constructors" : "libs/utility/enable_if/test/constructors.cpp" +boost-test(COMPILE_FAIL) "utility/value_init_test_fail3" : "libs/utility/value_init_test_fail3.cpp" +boost-test(COMPILE_FAIL) "utility/value_init_test_fail2" : "libs/utility/value_init_test_fail2.cpp" +boost-test(COMPILE_FAIL) "utility/value_init_test_fail1" : "libs/utility/value_init_test_fail1.cpp" +boost-test(RUN) "utility/value_init_test" : "libs/utility/value_init_test.cpp" +boost-test(RUN) "utility/shared_iterator_test" : "libs/utility/shared_iterator_test.cpp" +boost-test(COMPILE) "utility/result_of_test" : "libs/utility/test/result_of_test.cpp" +boost-test(RUN) "utility/ref_test" : "libs/utility/ref_test.cpp" +boost-test(COMPILE) "utility/ref_ct_test" : "libs/utility/ref_ct_test.cpp" +boost-test(RUN) "utility/operators_test" : "libs/utility/operators_test.cpp" +boost-test(RUN) "utility/numeric_traits_test" : "libs/utility/numeric_traits_test.cpp" +boost-test(COMPILE_FAIL) "utility/noncopyable_test" : "libs/utility/noncopyable_test.cpp" +boost-test(RUN) "utility/next_prior_test" : "libs/utility/test/next_prior_test.cpp" +boost-test(RUN) "utility/iterators_test" : "libs/utility/iterators_test.cpp" +boost-test(RUN) "utility/current_function_test" ["always_show_run_output"] : "libs/utility/current_function_test.cpp" +boost-test(RUN) "utility/compressed_pair_test" : "libs/utility/compressed_pair_test.cpp" +boost-test(COMPILE_FAIL) "utility/checked_delete_test" : "libs/utility/checked_delete_test.cpp" +boost-test(RUN) "utility/call_traits_test" : "libs/utility/call_traits_test.cpp" +boost-test(RUN) "utility/binary_search_test" : "libs/utility/binary_search_test.cpp" +boost-test(RUN) "utility/base_from_member_test" : "libs/utility/base_from_member_test.cpp" +boost-test(RUN) "utility/assert_test" : "libs/utility/assert_test.cpp" +boost-test(RUN) "utility/addressof_test" : "libs/utility/addressof_test.cpp" +boost-test(RUN) "variant/variant_visit_test" : "libs/variant/test/variant_visit_test.cpp" +boost-test(RUN) "variant/variant_comparison_test" : "libs/variant/test/variant_comparison_test.cpp" +boost-test(RUN) "variant/variant_reference_test" : "libs/variant/test/variant_reference_test.cpp" +boost-test(RUN) "variant/recursive_variant_test" : "libs/variant/test/recursive_variant_test.cpp" +boost-test(RUN) "variant/variant_test8" : "libs/variant/test/test8.cpp" +boost-test(RUN) "variant/variant_test7" : "libs/variant/test/test7.cpp" +boost-test(RUN) "variant/variant_test6" : "libs/variant/test/test6.cpp" +boost-test(RUN) "variant/variant_test5" : "libs/variant/test/test5.cpp" +boost-test(RUN) "variant/variant_test4" : "libs/variant/test/test4.cpp" "libs/variant/test/class_a.cpp" +boost-test(RUN) "variant/variant_test3" : "libs/variant/test/test3.cpp" +boost-test(RUN) "variant/variant_test2" : "libs/variant/test/test2.cpp" +boost-test(RUN) "variant/variant_test1" : "libs/variant/test/test1.cpp" "libs/variant/test/class_a.cpp" +boost-test(RUN) "wave/test_re2c_lexer" : "libs/wave/test/testlexers/test_re2c_lexer.cpp" +boost-test(RUN) "wave/test_slex_lexer" : "libs/wave/test/testlexers/test_slex_lexer.cpp" +boost-test(RUN) "wave/testwave" : "libs/wave/test/testwave/testwave.cpp" "libs/wave/test/testwave/testwave_app.cpp" +boost-test(RUN) "wave/testwave_dll" : "libs/wave/test/testwave/testwave.cpp" "libs/wave/test/testwave/testwave_app.cpp" +boost-test(COMPILE) "xpressive/test_sub_match" : "libs/xpressive/test/test_sub_match.cpp" +boost-test(COMPILE) "xpressive/test_regex_traits" : "libs/xpressive/test/test_regex_traits.cpp" +boost-test(COMPILE) "xpressive/test_regex_token_iterator" : "libs/xpressive/test/test_regex_token_iterator.cpp" +boost-test(COMPILE) "xpressive/test_regex_primitives" : "libs/xpressive/test/test_regex_primitives.cpp" +boost-test(COMPILE) "xpressive/test_regex_iterator" : "libs/xpressive/test/test_regex_iterator.cpp" +boost-test(COMPILE) "xpressive/test_regex_error" : "libs/xpressive/test/test_regex_error.cpp" +boost-test(COMPILE) "xpressive/test_regex_constants" : "libs/xpressive/test/test_regex_constants.cpp" +boost-test(COMPILE) "xpressive/test_regex_compiler" : "libs/xpressive/test/test_regex_compiler.cpp" +boost-test(COMPILE) "xpressive/test_regex_algorithms" : "libs/xpressive/test/test_regex_algorithms.cpp" +boost-test(COMPILE) "xpressive/test_match_results" : "libs/xpressive/test/test_match_results.cpp" +boost-test(COMPILE) "xpressive/test_basic_regex" : "libs/xpressive/test/test_basic_regex.cpp" +boost-test(LINK) "xpressive/multiple_defs" : "libs/xpressive/test/multiple_defs1.cpp" "libs/xpressive/test/multiple_defs2.cpp" +boost-test(RUN) "xpressive/test_dynamic" : "libs/xpressive/test/test_dynamic.cpp" +boost-test(RUN) "xpressive/test_static" : "libs/xpressive/test/test_static.cpp" +boost-test(RUN) "xpressive/test_non_char" : "libs/xpressive/test/test_non_char.cpp" +boost-test(RUN) "xpressive/test_cycles" : "libs/xpressive/test/test_cycles.cpp" +boost-test(RUN) "xpressive/misc2" : "libs/xpressive/test/misc2.cpp" +boost-test(RUN) "xpressive/misc1" : "libs/xpressive/test/misc1.cpp" +boost-test(RUN) "xpressive/test11u" : "libs/xpressive/test/test11u.cpp" +boost-test(RUN) "xpressive/test10u" : "libs/xpressive/test/test10u.cpp" +boost-test(RUN) "xpressive/test9u" : "libs/xpressive/test/test9u.cpp" +boost-test(RUN) "xpressive/test8u" : "libs/xpressive/test/test8u.cpp" +boost-test(RUN) "xpressive/test7u" : "libs/xpressive/test/test7u.cpp" +boost-test(RUN) "xpressive/test6u" : "libs/xpressive/test/test6u.cpp" +boost-test(RUN) "xpressive/test5u" : "libs/xpressive/test/test5u.cpp" +boost-test(RUN) "xpressive/test4u" : "libs/xpressive/test/test4u.cpp" +boost-test(RUN) "xpressive/test3u" : "libs/xpressive/test/test3u.cpp" +boost-test(RUN) "xpressive/test2u" : "libs/xpressive/test/test2u.cpp" +boost-test(RUN) "xpressive/test1u" : "libs/xpressive/test/test1u.cpp" +boost-test(RUN) "xpressive/test11" : "libs/xpressive/test/test11.cpp" +boost-test(RUN) "xpressive/test10" : "libs/xpressive/test/test10.cpp" +boost-test(RUN) "xpressive/test9" : "libs/xpressive/test/test9.cpp" +boost-test(RUN) "xpressive/test8" : "libs/xpressive/test/test8.cpp" +boost-test(RUN) "xpressive/test7" : "libs/xpressive/test/test7.cpp" +boost-test(RUN) "xpressive/test6" : "libs/xpressive/test/test6.cpp" +boost-test(RUN) "xpressive/test5" : "libs/xpressive/test/test5.cpp" +boost-test(RUN) "xpressive/test4" : "libs/xpressive/test/test4.cpp" +boost-test(RUN) "xpressive/test3" : "libs/xpressive/test/test3.cpp" +boost-test(RUN) "xpressive/test2" : "libs/xpressive/test/test2.cpp" +boost-test(RUN) "xpressive/test1" : "libs/xpressive/test/test1.cpp" +boost-test(RUN) "xpressive/c_traits" : "libs/xpressive/test/c_traits.cpp" +boost-test(RUN) "xpressive/regress" : "libs/xpressive/test/regress.cpp" +boost-test(RUN) "config/config_info" : "libs/config/test/config_info.cpp" +boost-test(RUN) "config/math_info" : "libs/config/test/math_info.cpp" +boost-test(RUN) "config/config_test" : "libs/config/test/config_test.cpp" +boost-test(RUN) "config/limits_test" : "libs/config/test/limits_test.cpp" +boost-test(RUN) "config/abi_test" : "libs/config/test/abi/abi_test.cpp" "libs/config/test/abi/main.cpp" +boost-test(COMPILE_FAIL) "config/has_2arg_use_facet_fail" : "libs/config/test/has_2arg_use_facet_fail.cpp" +boost-test(RUN) "config/has_2arg_use_facet_pass" : "libs/config/test/has_2arg_use_facet_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_bethreads_fail" : "libs/config/test/has_bethreads_fail.cpp" +boost-test(RUN) "config/has_bethreads_pass" : "libs/config/test/has_bethreads_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_clock_gettime_fail" : "libs/config/test/has_clock_gettime_fail.cpp" +boost-test(RUN) "config/has_clock_gettime_pass" : "libs/config/test/has_clock_gettime_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_dirent_h_fail" : "libs/config/test/has_dirent_h_fail.cpp" +boost-test(RUN) "config/has_dirent_h_pass" : "libs/config/test/has_dirent_h_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_expm1_fail" : "libs/config/test/has_expm1_fail.cpp" +boost-test(RUN) "config/has_expm1_pass" : "libs/config/test/has_expm1_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_ftime_fail" : "libs/config/test/has_ftime_fail.cpp" +boost-test(RUN) "config/has_ftime_pass" : "libs/config/test/has_ftime_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_gettimeofday_fail" : "libs/config/test/has_gettimeofday_fail.cpp" +boost-test(RUN) "config/has_gettimeofday_pass" : "libs/config/test/has_gettimeofday_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_hash_fail" : "libs/config/test/has_hash_fail.cpp" +boost-test(RUN) "config/has_hash_pass" : "libs/config/test/has_hash_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_log1p_fail" : "libs/config/test/has_log1p_fail.cpp" +boost-test(RUN) "config/has_log1p_pass" : "libs/config/test/has_log1p_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_long_long_fail" : "libs/config/test/has_long_long_fail.cpp" +boost-test(RUN) "config/has_long_long_pass" : "libs/config/test/has_long_long_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_macro_use_facet_fail" : "libs/config/test/has_macro_use_facet_fail.cpp" +boost-test(RUN) "config/has_macro_use_facet_pass" : "libs/config/test/has_macro_use_facet_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_ms_int64_fail" : "libs/config/test/has_ms_int64_fail.cpp" +boost-test(RUN) "config/has_ms_int64_pass" : "libs/config/test/has_ms_int64_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_nanosleep_fail" : "libs/config/test/has_nanosleep_fail.cpp" +boost-test(RUN) "config/has_nanosleep_pass" : "libs/config/test/has_nanosleep_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_nl_types_h_fail" : "libs/config/test/has_nl_types_h_fail.cpp" +boost-test(RUN) "config/has_nl_types_h_pass" : "libs/config/test/has_nl_types_h_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_nrvo_fail" : "libs/config/test/has_nrvo_fail.cpp" +boost-test(RUN) "config/has_nrvo_pass" : "libs/config/test/has_nrvo_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_part_alloc_fail" : "libs/config/test/has_part_alloc_fail.cpp" +boost-test(RUN) "config/has_part_alloc_pass" : "libs/config/test/has_part_alloc_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_pthreads_fail" : "libs/config/test/has_pthreads_fail.cpp" +boost-test(RUN) "config/has_pthreads_pass" : "libs/config/test/has_pthreads_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_pthread_delay_np_fail" : "libs/config/test/has_pthread_delay_np_fail.cpp" +boost-test(RUN) "config/has_pthread_delay_np_pass" : "libs/config/test/has_pthread_delay_np_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_pthread_ma_st_fail" : "libs/config/test/has_pthread_ma_st_fail.cpp" +boost-test(RUN) "config/has_pthread_ma_st_pass" : "libs/config/test/has_pthread_ma_st_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_pthread_yield_fail" : "libs/config/test/has_pthread_yield_fail.cpp" +boost-test(RUN) "config/has_pthread_yield_pass" : "libs/config/test/has_pthread_yield_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_sched_yield_fail" : "libs/config/test/has_sched_yield_fail.cpp" +boost-test(RUN) "config/has_sched_yield_pass" : "libs/config/test/has_sched_yield_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_sgi_type_traits_fail" : "libs/config/test/has_sgi_type_traits_fail.cpp" +boost-test(RUN) "config/has_sgi_type_traits_pass" : "libs/config/test/has_sgi_type_traits_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_sigaction_fail" : "libs/config/test/has_sigaction_fail.cpp" +boost-test(RUN) "config/has_sigaction_pass" : "libs/config/test/has_sigaction_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_slist_fail" : "libs/config/test/has_slist_fail.cpp" +boost-test(RUN) "config/has_slist_pass" : "libs/config/test/has_slist_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_stdint_h_fail" : "libs/config/test/has_stdint_h_fail.cpp" +boost-test(RUN) "config/has_stdint_h_pass" : "libs/config/test/has_stdint_h_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_stlp_use_facet_fail" : "libs/config/test/has_stlp_use_facet_fail.cpp" +boost-test(RUN) "config/has_stlp_use_facet_pass" : "libs/config/test/has_stlp_use_facet_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_array_fail" : "libs/config/test/has_tr1_array_fail.cpp" +boost-test(RUN) "config/has_tr1_array_pass" : "libs/config/test/has_tr1_array_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_bind_fail" : "libs/config/test/has_tr1_bind_fail.cpp" +boost-test(RUN) "config/has_tr1_bind_pass" : "libs/config/test/has_tr1_bind_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_complex_over_fail" : "libs/config/test/has_tr1_complex_over_fail.cpp" +boost-test(RUN) "config/has_tr1_complex_over_pass" : "libs/config/test/has_tr1_complex_over_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_complex_trig_fail" : "libs/config/test/has_tr1_complex_trig_fail.cpp" +boost-test(RUN) "config/has_tr1_complex_trig_pass" : "libs/config/test/has_tr1_complex_trig_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_function_fail" : "libs/config/test/has_tr1_function_fail.cpp" +boost-test(RUN) "config/has_tr1_function_pass" : "libs/config/test/has_tr1_function_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_hash_fail" : "libs/config/test/has_tr1_hash_fail.cpp" +boost-test(RUN) "config/has_tr1_hash_pass" : "libs/config/test/has_tr1_hash_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_mem_fn_fail" : "libs/config/test/has_tr1_mem_fn_fail.cpp" +boost-test(RUN) "config/has_tr1_mem_fn_pass" : "libs/config/test/has_tr1_mem_fn_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_random_fail" : "libs/config/test/has_tr1_random_fail.cpp" +boost-test(RUN) "config/has_tr1_random_pass" : "libs/config/test/has_tr1_random_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_ref_wrap_fail" : "libs/config/test/has_tr1_ref_wrap_fail.cpp" +boost-test(RUN) "config/has_tr1_ref_wrap_pass" : "libs/config/test/has_tr1_ref_wrap_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_regex_fail" : "libs/config/test/has_tr1_regex_fail.cpp" +boost-test(RUN) "config/has_tr1_regex_pass" : "libs/config/test/has_tr1_regex_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_result_of_fail" : "libs/config/test/has_tr1_result_of_fail.cpp" +boost-test(RUN) "config/has_tr1_result_of_pass" : "libs/config/test/has_tr1_result_of_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_shared_ptr_fail" : "libs/config/test/has_tr1_shared_ptr_fail.cpp" +boost-test(RUN) "config/has_tr1_shared_ptr_pass" : "libs/config/test/has_tr1_shared_ptr_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_tuple_fail" : "libs/config/test/has_tr1_tuple_fail.cpp" +boost-test(RUN) "config/has_tr1_tuple_pass" : "libs/config/test/has_tr1_tuple_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_type_traits_fail" : "libs/config/test/has_tr1_type_traits_fail.cpp" +boost-test(RUN) "config/has_tr1_type_traits_pass" : "libs/config/test/has_tr1_type_traits_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_unordered_map_fail" : "libs/config/test/has_tr1_unordered_map_fail.cpp" +boost-test(RUN) "config/has_tr1_unordered_map_pass" : "libs/config/test/has_tr1_unordered_map_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_unordered_set_fail" : "libs/config/test/has_tr1_unordered_set_fail.cpp" +boost-test(RUN) "config/has_tr1_unordered_set_pass" : "libs/config/test/has_tr1_unordered_set_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_tr1_utility_fail" : "libs/config/test/has_tr1_utility_fail.cpp" +boost-test(RUN) "config/has_tr1_utility_pass" : "libs/config/test/has_tr1_utility_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_unistd_h_fail" : "libs/config/test/has_unistd_h_fail.cpp" +boost-test(RUN) "config/has_unistd_h_pass" : "libs/config/test/has_unistd_h_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_vc6_mem_templ_fail" : "libs/config/test/has_vc6_mem_templ_fail.cpp" +boost-test(RUN) "config/has_vc6_mem_templ_pass" : "libs/config/test/has_vc6_mem_templ_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_vc_iterator_fail" : "libs/config/test/has_vc_iterator_fail.cpp" +boost-test(RUN) "config/has_vc_iterator_pass" : "libs/config/test/has_vc_iterator_pass.cpp" +boost-test(COMPILE_FAIL) "config/has_winthreads_fail" : "libs/config/test/has_winthreads_fail.cpp" +boost-test(RUN) "config/has_winthreads_pass" : "libs/config/test/has_winthreads_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_arg_dep_lookup_fail" : "libs/config/test/no_arg_dep_lookup_fail.cpp" +boost-test(RUN) "config/no_arg_dep_lookup_pass" : "libs/config/test/no_arg_dep_lookup_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_array_type_spec_fail" : "libs/config/test/no_array_type_spec_fail.cpp" +boost-test(RUN) "config/no_array_type_spec_pass" : "libs/config/test/no_array_type_spec_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_auto_ptr_fail" : "libs/config/test/no_auto_ptr_fail.cpp" +boost-test(RUN) "config/no_auto_ptr_pass" : "libs/config/test/no_auto_ptr_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_bcb_partial_spec_fail" : "libs/config/test/no_bcb_partial_spec_fail.cpp" +boost-test(RUN) "config/no_bcb_partial_spec_pass" : "libs/config/test/no_bcb_partial_spec_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_ctype_functions_fail" : "libs/config/test/no_ctype_functions_fail.cpp" +boost-test(RUN) "config/no_ctype_functions_pass" : "libs/config/test/no_ctype_functions_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_cv_spec_fail" : "libs/config/test/no_cv_spec_fail.cpp" +boost-test(RUN) "config/no_cv_spec_pass" : "libs/config/test/no_cv_spec_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_cv_void_spec_fail" : "libs/config/test/no_cv_void_spec_fail.cpp" +boost-test(RUN) "config/no_cv_void_spec_pass" : "libs/config/test/no_cv_void_spec_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_cwchar_fail" : "libs/config/test/no_cwchar_fail.cpp" +boost-test(RUN) "config/no_cwchar_pass" : "libs/config/test/no_cwchar_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_cwctype_fail" : "libs/config/test/no_cwctype_fail.cpp" +boost-test(RUN) "config/no_cwctype_pass" : "libs/config/test/no_cwctype_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_ded_typename_fail" : "libs/config/test/no_ded_typename_fail.cpp" +boost-test(RUN) "config/no_ded_typename_pass" : "libs/config/test/no_ded_typename_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_dep_nested_class_fail" : "libs/config/test/no_dep_nested_class_fail.cpp" +boost-test(RUN) "config/no_dep_nested_class_pass" : "libs/config/test/no_dep_nested_class_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_dep_val_param_fail" : "libs/config/test/no_dep_val_param_fail.cpp" +boost-test(RUN) "config/no_dep_val_param_pass" : "libs/config/test/no_dep_val_param_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_exceptions_fail" : "libs/config/test/no_exceptions_fail.cpp" +boost-test(RUN) "config/no_exceptions_pass" : "libs/config/test/no_exceptions_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_excep_std_fail" : "libs/config/test/no_excep_std_fail.cpp" +boost-test(RUN) "config/no_excep_std_pass" : "libs/config/test/no_excep_std_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_exp_func_tem_arg_fail" : "libs/config/test/no_exp_func_tem_arg_fail.cpp" +boost-test(RUN) "config/no_exp_func_tem_arg_pass" : "libs/config/test/no_exp_func_tem_arg_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_func_tmp_order_fail" : "libs/config/test/no_func_tmp_order_fail.cpp" +boost-test(RUN) "config/no_func_tmp_order_pass" : "libs/config/test/no_func_tmp_order_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_i64_limits_fail" : "libs/config/test/no_i64_limits_fail.cpp" +boost-test(RUN) "config/no_i64_limits_pass" : "libs/config/test/no_i64_limits_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_inline_memb_init_fail" : "libs/config/test/no_inline_memb_init_fail.cpp" +boost-test(RUN) "config/no_inline_memb_init_pass" : "libs/config/test/no_inline_memb_init_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_integral_int64_t_fail" : "libs/config/test/no_integral_int64_t_fail.cpp" +boost-test(RUN) "config/no_integral_int64_t_pass" : "libs/config/test/no_integral_int64_t_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_is_abstract_fail" : "libs/config/test/no_is_abstract_fail.cpp" +boost-test(RUN) "config/no_is_abstract_pass" : "libs/config/test/no_is_abstract_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_iter_construct_fail" : "libs/config/test/no_iter_construct_fail.cpp" +boost-test(RUN) "config/no_iter_construct_pass" : "libs/config/test/no_iter_construct_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_limits_fail" : "libs/config/test/no_limits_fail.cpp" +boost-test(RUN) "config/no_limits_pass" : "libs/config/test/no_limits_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_limits_const_exp_fail" : "libs/config/test/no_limits_const_exp_fail.cpp" +boost-test(RUN) "config/no_limits_const_exp_pass" : "libs/config/test/no_limits_const_exp_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_ll_limits_fail" : "libs/config/test/no_ll_limits_fail.cpp" +boost-test(RUN) "config/no_ll_limits_pass" : "libs/config/test/no_ll_limits_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_mem_func_spec_fail" : "libs/config/test/no_mem_func_spec_fail.cpp" +boost-test(RUN) "config/no_mem_func_spec_pass" : "libs/config/test/no_mem_func_spec_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_mem_templates_fail" : "libs/config/test/no_mem_templates_fail.cpp" +boost-test(RUN) "config/no_mem_templates_pass" : "libs/config/test/no_mem_templates_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_mem_templ_frnds_fail" : "libs/config/test/no_mem_templ_frnds_fail.cpp" +boost-test(RUN) "config/no_mem_templ_frnds_pass" : "libs/config/test/no_mem_templ_frnds_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_mem_tem_keyword_fail" : "libs/config/test/no_mem_tem_keyword_fail.cpp" +boost-test(RUN) "config/no_mem_tem_keyword_pass" : "libs/config/test/no_mem_tem_keyword_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_mem_tem_pnts_fail" : "libs/config/test/no_mem_tem_pnts_fail.cpp" +boost-test(RUN) "config/no_mem_tem_pnts_pass" : "libs/config/test/no_mem_tem_pnts_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_ops_in_namespace_fail" : "libs/config/test/no_ops_in_namespace_fail.cpp" +boost-test(RUN) "config/no_ops_in_namespace_pass" : "libs/config/test/no_ops_in_namespace_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_partial_spec_fail" : "libs/config/test/no_partial_spec_fail.cpp" +boost-test(RUN) "config/no_partial_spec_pass" : "libs/config/test/no_partial_spec_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_priv_aggregate_fail" : "libs/config/test/no_priv_aggregate_fail.cpp" +boost-test(RUN) "config/no_priv_aggregate_pass" : "libs/config/test/no_priv_aggregate_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_ptr_mem_const_fail" : "libs/config/test/no_ptr_mem_const_fail.cpp" +boost-test(RUN) "config/no_ptr_mem_const_pass" : "libs/config/test/no_ptr_mem_const_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_ret_det_fail" : "libs/config/test/no_ret_det_fail.cpp" +boost-test(RUN) "config/no_ret_det_pass" : "libs/config/test/no_ret_det_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_sfinae_fail" : "libs/config/test/no_sfinae_fail.cpp" +boost-test(RUN) "config/no_sfinae_pass" : "libs/config/test/no_sfinae_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_sstream_fail" : "libs/config/test/no_sstream_fail.cpp" +boost-test(RUN) "config/no_sstream_pass" : "libs/config/test/no_sstream_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_stdc_namespace_fail" : "libs/config/test/no_stdc_namespace_fail.cpp" +boost-test(RUN) "config/no_stdc_namespace_pass" : "libs/config/test/no_stdc_namespace_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_std_allocator_fail" : "libs/config/test/no_std_allocator_fail.cpp" +boost-test(RUN) "config/no_std_allocator_pass" : "libs/config/test/no_std_allocator_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_std_distance_fail" : "libs/config/test/no_std_distance_fail.cpp" +boost-test(RUN) "config/no_std_distance_pass" : "libs/config/test/no_std_distance_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_std_iterator_fail" : "libs/config/test/no_std_iterator_fail.cpp" +boost-test(RUN) "config/no_std_iterator_pass" : "libs/config/test/no_std_iterator_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_std_iter_traits_fail" : "libs/config/test/no_std_iter_traits_fail.cpp" +boost-test(RUN) "config/no_std_iter_traits_pass" : "libs/config/test/no_std_iter_traits_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_std_locale_fail" : "libs/config/test/no_std_locale_fail.cpp" +boost-test(RUN) "config/no_std_locale_pass" : "libs/config/test/no_std_locale_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_std_messages_fail" : "libs/config/test/no_std_messages_fail.cpp" +boost-test(RUN) "config/no_std_messages_pass" : "libs/config/test/no_std_messages_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_std_min_max_fail" : "libs/config/test/no_std_min_max_fail.cpp" +boost-test(RUN) "config/no_std_min_max_pass" : "libs/config/test/no_std_min_max_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_std_oi_assign_fail" : "libs/config/test/no_std_oi_assign_fail.cpp" +boost-test(RUN) "config/no_std_oi_assign_pass" : "libs/config/test/no_std_oi_assign_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_std_use_facet_fail" : "libs/config/test/no_std_use_facet_fail.cpp" +boost-test(RUN) "config/no_std_use_facet_pass" : "libs/config/test/no_std_use_facet_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_std_wstreambuf_fail" : "libs/config/test/no_std_wstreambuf_fail.cpp" +boost-test(RUN) "config/no_std_wstreambuf_pass" : "libs/config/test/no_std_wstreambuf_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_std_wstring_fail" : "libs/config/test/no_std_wstring_fail.cpp" +boost-test(RUN) "config/no_std_wstring_pass" : "libs/config/test/no_std_wstring_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_swprintf_fail" : "libs/config/test/no_swprintf_fail.cpp" +boost-test(RUN) "config/no_swprintf_pass" : "libs/config/test/no_swprintf_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_template_template_fail" : "libs/config/test/no_template_template_fail.cpp" +boost-test(RUN) "config/no_template_template_pass" : "libs/config/test/no_template_template_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_using_breaks_adl_fail" : "libs/config/test/no_using_breaks_adl_fail.cpp" +boost-test(RUN) "config/no_using_breaks_adl_pass" : "libs/config/test/no_using_breaks_adl_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_using_decl_overld_fail" : "libs/config/test/no_using_decl_overld_fail.cpp" +boost-test(RUN) "config/no_using_decl_overld_pass" : "libs/config/test/no_using_decl_overld_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_using_template_fail" : "libs/config/test/no_using_template_fail.cpp" +boost-test(RUN) "config/no_using_template_pass" : "libs/config/test/no_using_template_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_void_returns_fail" : "libs/config/test/no_void_returns_fail.cpp" +boost-test(RUN) "config/no_void_returns_pass" : "libs/config/test/no_void_returns_pass.cpp" +boost-test(COMPILE_FAIL) "config/no_wchar_t_fail" : "libs/config/test/no_wchar_t_fail.cpp" +boost-test(RUN) "config/no_wchar_t_pass" : "libs/config/test/no_wchar_t_pass.cpp" +boost-test(RUN) "functional/hash/books" : "libs/functional/hash/examples/books.cpp" +boost-test(RUN) "functional/hash/point" : "libs/functional/hash/examples/point.cpp" +boost-test(RUN) "functional/hash/portable" : "libs/functional/hash/examples/portable.cpp" +...patience... +...patience... +...patience... +...patience... +...patience... +...found 52565 targets... +...updating 11478 targets... + +######################### +MkDir1 /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64 + + mkdir "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64" + +MkDir1 /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug + + mkdir "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug" + +MkDir1 /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static + + mkdir "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/compiler_log_formatter.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/compiler_log_formatter.o" "../libs/test/src/compiler_log_formatter.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/execution_monitor.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/execution_monitor.o" "../libs/test/src/execution_monitor.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/framework.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/framework.o" "../libs/test/src/framework.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/plain_report_formatter.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/plain_report_formatter.o" "../libs/test/src/plain_report_formatter.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/progress_monitor.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/progress_monitor.o" "../libs/test/src/progress_monitor.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/results_collector.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/results_collector.o" "../libs/test/src/results_collector.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/results_reporter.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/results_reporter.o" "../libs/test/src/results_reporter.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/test_main.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/test_main.o" "../libs/test/src/test_main.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/test_tools.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/test_tools.o" "../libs/test/src/test_tools.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_log.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_log.o" "../libs/test/src/unit_test_log.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_main.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_main.o" "../libs/test/src/unit_test_main.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_monitor.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_monitor.o" "../libs/test/src/unit_test_monitor.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_parameters.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_parameters.o" "../libs/test/src/unit_test_parameters.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_suite.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_suite.o" "../libs/test/src/unit_test_suite.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/xml_log_formatter.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/xml_log_formatter.o" "../libs/test/src/xml_log_formatter.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/xml_report_formatter.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/xml_report_formatter.o" "../libs/test/src/xml_report_formatter.cpp" + +RmTemps /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/libboost_test_exec_monitor-gcc34-d-1_34.a(clean) + + rm -f "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/libboost_test_exec_monitor-gcc34-d-1_34.a" + +gcc.archive /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/libboost_test_exec_monitor-gcc34-d-1_34.a + + "ar" rc "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/libboost_test_exec_monitor-gcc34-d-1_34.a" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/compiler_log_formatter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/execution_monitor.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/framework.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/plain_report_formatter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/progress_monitor.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/results_collector.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/results_reporter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/test_main.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/test_tools.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_log.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_main.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_monitor.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_parameters.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_suite.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/xml_log_formatter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/xml_report_formatter.o" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/exception_safety.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/exception_safety.o" "../libs/test/src/exception_safety.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/interaction_based.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/interaction_based.o" "../libs/test/src/interaction_based.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/logged_expectations.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/logged_expectations.o" "../libs/test/src/logged_expectations.cpp" + +RmTemps /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/libboost_unit_test_framework-gcc34-d-1_34.a(clean) + + rm -f "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/libboost_unit_test_framework-gcc34-d-1_34.a" + +gcc.archive /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/libboost_unit_test_framework-gcc34-d-1_34.a + + "ar" rc "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/libboost_unit_test_framework-gcc34-d-1_34.a" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/compiler_log_formatter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/execution_monitor.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/framework.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/plain_report_formatter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/progress_monitor.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/results_collector.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/results_reporter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/test_tools.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_log.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_main.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_monitor.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_parameters.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/unit_test_suite.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/xml_log_formatter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/xml_report_formatter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/exception_safety.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/interaction_based.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/logged_expectations.o" + +MkDir1 /b/r/rc/results/boost/bin.v2/status/config_test.test/gcc-3.4.6_linux_x86_64 + + mkdir "/b/r/rc/results/boost/bin.v2/status/config_test.test/gcc-3.4.6_linux_x86_64" + +MkDir1 /b/r/rc/results/boost/bin.v2/status/config_test.test/gcc-3.4.6_linux_x86_64/debug + + mkdir "/b/r/rc/results/boost/bin.v2/status/config_test.test/gcc-3.4.6_linux_x86_64/debug" + +MkDir1 /b/r/rc/results/boost/bin.v2/status/config_test.test/gcc-3.4.6_linux_x86_64/debug/threading-multi + + mkdir "/b/r/rc/results/boost/bin.v2/status/config_test.test/gcc-3.4.6_linux_x86_64/debug/threading-multi" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/status/config_test.test/gcc-3.4.6_linux_x86_64/debug/threading-multi/config_test.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -fPIC -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -DBOOST_TEST_NO_AUTO_LINK=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/status/config_test.test/gcc-3.4.6_linux_x86_64/debug/threading-multi/config_test.o" "/b/r/rc/boost/libs/config/test/config_test.cpp" + +In file included from /b/r/rc/boost/libs/config/test/config_test.cpp:118: +/b/r/rc/boost/libs/config/test/boost_no_is_abstract.ipp: In function `int boost_no_is_abstract::test()': +/b/r/rc/boost/libs/config/test/boost_no_is_abstract.ipp:41: warning: comparison between `enum boost_no_is_abstract::is_abstract_test::' and `enum boost_no_is_abstract::is_abstract_test::' +/b/r/rc/boost/libs/config/test/boost_no_std_wstreambuf.ipp: In member function `typename boost_no_std_wstreambuf::parser_buf::pos_type boost_no_std_wstreambuf::parser_buf::seekoff(typename std::basic_streambuf<_CharT, _Traits>::off_type, std::_Ios_Seekdir, std::_Ios_Openmode) [with charT = char, traits = std::char_traits]': +/b/r/rc/boost/libs/config/test/boost_no_std_wstreambuf.ipp:104: instantiated from here +/b/r/rc/boost/libs/config/test/boost_no_std_wstreambuf.ipp:77: warning: enumeration value `_S_ios_seekdir_end' not handled in switch +/b/r/rc/boost/libs/config/test/boost_no_std_wstreambuf.ipp: In member function `typename boost_no_std_wstreambuf::parser_buf::pos_type boost_no_std_wstreambuf::parser_buf::seekoff(typename std::basic_streambuf<_CharT, _Traits>::off_type, std::_Ios_Seekdir, std::_Ios_Openmode) [with charT = wchar_t, traits = std::char_traits]': +/b/r/rc/boost/libs/config/test/boost_no_std_wstreambuf.ipp:105: instantiated from here +/b/r/rc/boost/libs/config/test/boost_no_std_wstreambuf.ipp:77: warning: enumeration value `_S_ios_seekdir_end' not handled in switch +MkDir1 /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi + + mkdir "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/compiler_log_formatter.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/compiler_log_formatter.o" "../libs/test/src/compiler_log_formatter.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/execution_monitor.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/execution_monitor.o" "../libs/test/src/execution_monitor.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/framework.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/framework.o" "../libs/test/src/framework.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/plain_report_formatter.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/plain_report_formatter.o" "../libs/test/src/plain_report_formatter.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/progress_monitor.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/progress_monitor.o" "../libs/test/src/progress_monitor.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/results_collector.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/results_collector.o" "../libs/test/src/results_collector.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/results_reporter.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/results_reporter.o" "../libs/test/src/results_reporter.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/test_main.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/test_main.o" "../libs/test/src/test_main.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/test_tools.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/test_tools.o" "../libs/test/src/test_tools.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_log.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_log.o" "../libs/test/src/unit_test_log.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_main.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_main.o" "../libs/test/src/unit_test_main.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_monitor.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_monitor.o" "../libs/test/src/unit_test_monitor.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_parameters.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_parameters.o" "../libs/test/src/unit_test_parameters.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_suite.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_suite.o" "../libs/test/src/unit_test_suite.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/xml_log_formatter.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/xml_log_formatter.o" "../libs/test/src/xml_log_formatter.cpp" + +gcc.compile.c++ /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/xml_report_formatter.o + + "/usr/local/gcc-3.4.6/bin/g++wrap" "--limit-memory=900" "--limit-cpu=1800" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -D_GLIBCXX_DEBUG=1 -pthread -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/xml_report_formatter.o" "../libs/test/src/xml_report_formatter.cpp" + +RmTemps /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/libboost_test_exec_monitor-gcc34-mt-d-1_34.a(clean) + + rm -f "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/libboost_test_exec_monitor-gcc34-mt-d-1_34.a" + +gcc.archive /b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/libboost_test_exec_monitor-gcc34-mt-d-1_34.a + + "ar" rc "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/libboost_test_exec_monitor-gcc34-mt-d-1_34.a" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/compiler_log_formatter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/execution_monitor.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/framework.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/plain_report_formatter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/progress_monitor.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/results_collector.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/results_reporter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/test_main.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/test_tools.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_log.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_main.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_monitor.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_parameters.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/unit_test_suite.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/xml_log_formatter.o" "/b/r/rc/results/boost/bin.v2/libs/test/build/gcc-3.4.6_linux_x86_64/debug/link-static/threading-multi/xml_report_formatter.o" + +...failed updating 42 targets... +...skipped 51 targets... +...updated 11385 targets... diff --git a/tools/regression/test/test.bat b/tools/regression/test/test.bat new file mode 100644 index 0000000000..200c716cba --- /dev/null +++ b/tools/regression/test/test.bat @@ -0,0 +1,10 @@ +set TEST_LOCATE_ROOT=d:\temp + +echo Begin test processing... +bjam --dump-tests "-sALL_LOCATE_TARGET=%TEST_LOCATE_ROOT%" %* >bjam.log 2>&1 +echo Begin log processing... +process_jam_log %TEST_LOCATE_ROOT% dst_timestamp: + needs_updating = 1 + utils.log( ' %s [%s] %s' % ( shorten( dependency ), dm, update_mark ) ) + + if needs_updating: + utils.log( "target needs updating, rebuilding" ) + self.update() + return + else: + utils.log( "target is up-to-date" ) + + + def clean( self ): + to_unlink = self.other_results_ + [ self.file_path_ ] + for result in to_unlink: + utils.log( ' Deleting obsolete "%s"' % shorten( result ) ) + if os.path.exists( result ): + os.unlink( result ) + +class merge_xml_action( action ): + def __init__( self, source, destination, expected_results_file, failures_markup_file ): + action.__init__( self, destination ) + self.source_ = source + self.destination_ = destination + + self.expected_results_file_ = expected_results_file + self.failures_markup_file_ = failures_markup_file + + self.dependencies_.extend( [ + self.source_ + , self.expected_results_file_ + , self.failures_markup_file_ + ] + ) + + self.relevant_paths_.extend( [ self.source_ ] ) + self.boost_paths_.extend( [ self.expected_results_file_, self.failures_markup_file_ ] ) + + + + def update( self ): + def filter_xml( src, dest ): + + class xmlgen( xml.sax.saxutils.XMLGenerator ): + def __init__( self, writer ): + xml.sax.saxutils.XMLGenerator.__init__( self, writer ) + + self.trimmed = 0 + self.character_content = "" + + def startElement( self, name, attrs): + self.flush() + xml.sax.saxutils.XMLGenerator.startElement( self, name, attrs ) + + def endElement( self, name ): + self.flush() + xml.sax.saxutils.XMLGenerator.endElement( self, name ) + + def flush( self ): + content = self.character_content + self.character_content = "" + self.trimmed = 0 + xml.sax.saxutils.XMLGenerator.characters( self, content ) + + def characters( self, content ): + if not self.trimmed: + max_size = pow( 2, 16 ) + self.character_content += content + if len( self.character_content ) > max_size: + self.character_content = self.character_content[ : max_size ] + "...\n\n[The content has been trimmed by the report system because it exceeds %d bytes]" % max_size + self.trimmed = 1 + + o = open( dest, "w" ) + try: + gen = xmlgen( o ) + xml.sax.parse( src, gen ) + finally: + o.close() + + return dest + + + utils.log( 'Merging "%s" with expected results...' % shorten( self.source_ ) ) + try: + trimmed_source = filter_xml( self.source_, '%s-trimmed.xml' % os.path.splitext( self.source_ )[0] ) + utils.libxslt( + utils.log + , trimmed_source + , xsl_path( 'add_expected_results.xsl' ) + , self.file_path_ + , { + "expected_results_file" : self.expected_results_file_ + , "failures_markup_file": self.failures_markup_file_ + } + ) + + os.unlink( trimmed_source ) + + except Exception, msg: + utils.log( ' Skipping "%s" due to errors (%s)' % ( self.source_, msg ) ) + if os.path.exists( self.file_path_ ): + os.unlink( self.file_path_ ) + + + def _xml_timestamp( xml_path ): + + class timestamp_reader( xml.sax.handler.ContentHandler ): + def startElement( self, name, attrs ): + if name == 'test-run': + self.timestamp = attrs.getValue( 'timestamp' ) + raise self + + try: + xml.sax.parse( xml_path, timestamp_reader() ) + raise 'Cannot extract timestamp from "%s". Invalid XML file format?' % xml_path + except timestamp_reader, x: + return x.timestamp + + +class make_links_action( action ): + def __init__( self, source, destination, output_dir, tag, run_date, comment_file, failures_markup_file ): + action.__init__( self, destination ) + self.dependencies_.append( source ) + self.source_ = source + self.output_dir_ = output_dir + self.tag_ = tag + self.run_date_ = run_date + self.comment_file_ = comment_file + self.failures_markup_file_ = failures_markup_file + self.links_file_path_ = os.path.join( output_dir, 'links.html' ) + + def update( self ): + utils.makedirs( os.path.join( os.path.dirname( self.links_file_path_ ), "output" ) ) + utils.makedirs( os.path.join( os.path.dirname( self.links_file_path_ ), "developer", "output" ) ) + utils.makedirs( os.path.join( os.path.dirname( self.links_file_path_ ), "user", "output" ) ) + utils.log( ' Making test output files...' ) + utils.libxslt( + utils.log + , self.source_ + , xsl_path( 'links_page.xsl' ) + , self.links_file_path_ + , { + 'source': self.tag_ + , 'run_date': self.run_date_ + , 'comment_file': self.comment_file_ + , 'explicit_markup_file': self.failures_markup_file_ + } + ) + + open( self.file_path_, "w" ).close() + + +class unzip_action( action ): + def __init__( self, source, destination, unzip_func ): + action.__init__( self, destination ) + self.dependencies_.append( source ) + self.source_ = source + self.unzip_func_ = unzip_func + + def update( self ): + try: + utils.log( ' Unzipping "%s" ... into "%s"' % ( shorten( self.source_ ), os.path.dirname( self.file_path_ ) ) ) + self.unzip_func_( self.source_, os.path.dirname( self.file_path_ ) ) + except Exception, msg: + utils.log( ' Skipping "%s" due to errors (%s)' % ( self.source_, msg ) ) + + +def ftp_task( site, site_path , destination ): + __log__ = 1 + utils.log( '' ) + utils.log( 'ftp_task: "ftp://%s/%s" -> %s' % ( site, site_path, destination ) ) + + utils.log( ' logging on ftp site %s' % site ) + f = ftplib.FTP( site ) + f.login() + utils.log( ' cwd to "%s"' % site_path ) + f.cwd( site_path ) + + source_content = list_ftp( f ) + source_content = [ x for x in source_content if re.match( r'.+[.](? -1: + new_name = file.replace( "%20", " " ) + old_file_path = os.path.join( root, file ) + new_file_path = os.path.join( root, new_name ) + print "renaming %s %s" % ( old_file_path, new_file_path ) + os.rename ( old_file_path, new_file_path ) + +def build_xsl_reports( + locate_root_dir + , tag + , expected_results_file + , failures_markup_file + , comment_file + , results_dir + , result_file_prefix + , dont_collect_logs = 0 + , reports = report_types + , warnings = [] + , user = None + , upload = False + ): + + ( run_date ) = time.strftime( '%Y-%m-%dT%H:%M:%SZ', time.gmtime() ) + + root_paths.append( locate_root_dir ) + root_paths.append( results_dir ) + + bin_boost_dir = os.path.join( locate_root_dir, 'bin', 'boost' ) + + output_dir = os.path.join( results_dir, result_file_prefix ) + utils.makedirs( output_dir ) + + if expected_results_file != '': + expected_results_file = os.path.abspath( expected_results_file ) + else: + expected_results_file = os.path.abspath( map_path( 'empty_expected_results.xml' ) ) + + + extended_test_results = os.path.join( output_dir, 'extended_test_results.xml' ) + + execute_tasks( + tag + , user + , run_date + , comment_file + , results_dir + , output_dir + , reports + , warnings + , extended_test_results + , dont_collect_logs + , expected_results_file + , failures_markup_file + ) + + if upload: + upload_dir = 'regression-logs/' + utils.log( 'Uploading results into "%s" [connecting as %s]...' % ( upload_dir, user ) ) + + archive_name = '%s.tar.gz' % result_file_prefix + utils.tar( + os.path.join( results_dir, result_file_prefix ) + , archive_name + ) + + utils.sourceforge.upload( os.path.join( results_dir, archive_name ), upload_dir, user ) + utils.sourceforge.untar( os.path.join( upload_dir, archive_name ), user, background = True ) + + +def accept_args( args ): + args_spec = [ + 'locate-root=' + , 'tag=' + , 'expected-results=' + , 'failures-markup=' + , 'comment=' + , 'results-dir=' + , 'results-prefix=' + , 'dont-collect-logs' + , 'reports=' + , 'user=' + , 'upload' + , 'help' + ] + + options = { + '--comment': '' + , '--expected-results': '' + , '--failures-markup': '' + , '--reports': string.join( report_types, ',' ) + , '--tag': None + , '--user': None + , 'upload': False + } + + utils.accept_args( args_spec, args, options, usage ) + if not options.has_key( '--results-dir' ): + options[ '--results-dir' ] = options[ '--locate-root' ] + + if not options.has_key( '--results-prefix' ): + options[ '--results-prefix' ] = 'all' + + return ( + options[ '--locate-root' ] + , options[ '--tag' ] + , options[ '--expected-results' ] + , options[ '--failures-markup' ] + , options[ '--comment' ] + , options[ '--results-dir' ] + , options[ '--results-prefix' ] + , options.has_key( '--dont-collect-logs' ) + , options[ '--reports' ].split( ',' ) + , options[ '--user' ] + , options.has_key( '--upload' ) + ) + + +def usage(): + print 'Usage: %s [options]' % os.path.basename( sys.argv[0] ) + print ''' +\t--locate-root the same as --locate-root in compiler_status +\t--tag the tag for the results (i.e. 'CVS-HEAD') +\t--expected-results the file with the results to be compared with +\t the current run +\t--failures-markup the file with the failures markup +\t--comment an html comment file (will be inserted in the reports) +\t--results-dir the directory containing -links.html, -fail.html +\t files produced by compiler_status (by default the +\t same as specified in --locate-root) +\t--results-prefix the prefix of -links.html, -fail.html +\t files produced by compiler_status +\t--user SourceForge user name for a shell account +\t--upload upload reports to SourceForge + +The following options are useful in debugging: + +\t--dont-collect-logs dont collect the test logs +\t--reports produce only the specified reports +\t us - user summary +\t ds - developer summary +\t ud - user detailed +\t dd - developer detailed +\t l - links +\t p - patches +\t x - extended results file +\t i - issues +\t n - runner comment files +''' + +def main(): + build_xsl_reports( *accept_args( sys.argv[ 1 : ] ) ) + +if __name__ == '__main__': + main() diff --git a/tools/regression/xsl_reports/boostbook_report.py b/tools/regression/xsl_reports/boostbook_report.py new file mode 100644 index 0000000000..6c91a939dd --- /dev/null +++ b/tools/regression/xsl_reports/boostbook_report.py @@ -0,0 +1,179 @@ +import ftplib +import optparse +import os +import time +import urlparse +import utils +import shutil +import sys +import zipfile +import xml.sax.saxutils + + +import utils.libxslt + +def get_date( words ): + date = words[ 5: -1 ] + t = time.localtime() + + month_names = [ "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" ] + + year = time.localtime()[0] # If year is not secified is it the current year + month = month_names.index( date[0] ) + 1 + day = int( date[1] ) + hours = 0 + minutes = 0 + + if date[2].find( ":" ) != -1: + ( hours, minutes ) = [ int(x) for x in date[2].split( ":" ) ] + else: + # there is no way to get seconds for not current year dates + year = int( date[2] ) + + return ( year, month, day, hours, minutes, 0, 0, 0, 0 ) + +#def check_for_new_upload( target_dir, boostbook_info ): + +def accept_args( args ): + parser = optparse.OptionParser() + parser.add_option( '-t', '--tag', dest='tag', help="the tag for the results (i.e. 'RC_1_34_0')" ) + parser.add_option( '-d', '--destination', dest='destination', help='destination directory' ) + + if len(args) == 0: + parser.print_help() + sys.exit( 1 ) + + (options, args) = parser.parse_args() + if not options.destination: + print '-d is required' + parser.print_help() + sys.exit( 1 ) + return options + +def unzip( archive_path, result_dir ): + utils.log( 'Unpacking %s into %s' % ( archive_path, result_dir ) ) + z = zipfile.ZipFile( archive_path, 'r', zipfile.ZIP_DEFLATED ) + for f in z.infolist(): + dir = os.path.join( result_dir, os.path.dirname( f.filename ) ) + if not os.path.exists( dir ): + os.makedirs( dir ) + result = open( os.path.join( result_dir, f.filename ), 'wb' ) + result.write( z.read( f.filename ) ) + result.close() + + z.close() + +def boostbook_report( options ): + site = 'fx.meta-comm.com' + site_path = '/boost-regression/%s' % options.tag + + utils.log( 'Opening %s ...' % site ) + f = ftplib.FTP( site ) + f.login() + utils.log( ' cd %s ...' % site_path ) + f.cwd( site_path ) + + utils.log( ' dir' ) + lines = [] + f.dir( lambda x: lines.append( x ) ) + word_lines = [ x.split( None, 8 ) for x in lines ] + boostbook_info = [ ( l[-1], get_date( l ) ) for l in word_lines if l[-1] == "BoostBook.zip" ] + if len( boostbook_info ) > 0: + boostbook_info = boostbook_info[0] + utils.log( 'BoostBook found! (%s)' % ( boostbook_info, ) ) + local_copy = os.path.join( options.destination,'BoostBook-%s.zip' % options.tag ) + + if 1: + if os.path.exists( local_copy ): + utils.log( 'Local copy exists. Checking if it is older than uploaded one...' ) + uploaded_mtime = time.mktime( boostbook_info[1] ) + local_mtime = os.path.getmtime( local_copy ) + utils.log( ' uploaded: %s %s, local: %s %s' % + ( uploaded_mtime + , boostbook_info[1] + , local_mtime + , time.localtime( local_mtime )) ) + modtime = time.localtime( os.path.getmtime( local_copy ) ) + if uploaded_mtime <= local_mtime: + utils.log( 'Local copy is newer: exiting' ) + sys.exit() + + if 1: + temp = os.path.join( options.destination,'BoostBook.zip' ) + result = open( temp, 'wb' ) + f.retrbinary( 'RETR %s' % boostbook_info[0], result.write ) + result.close() + + if os.path.exists( local_copy ): + os.unlink( local_copy ) + os.rename( temp, local_copy ) + m = time.mktime( boostbook_info[1] ) + os.utime( local_copy, ( m, m ) ) + + + docs_name = os.path.splitext( os.path.basename( local_copy ) )[0] + if 1: + unpacked_docs_dir = os.path.join( options.destination, docs_name ) + utils.log( 'Dir %s ' % unpacked_docs_dir ) + if os.path.exists( unpacked_docs_dir ): + utils.log( 'Cleaning up...' ) + shutil.rmtree( unpacked_docs_dir ) + os.makedirs( unpacked_docs_dir ) + + unzip( local_copy, unpacked_docs_dir ) + + utils.system( [ 'cd %s' % unpacked_docs_dir + , 'tar -c -f ../%s.tar.gz -z --exclude=tarball *' % docs_name ] ) + + process_boostbook_build_log( os.path.join( unpacked_docs_dir, 'boostbook.log' ), read_timestamp( unpacked_docs_dir ) ) + utils.libxslt( log + , os.path.abspath( os.path.join( unpacked_docs_dir, 'boostbook.log.xml' ) ) + , os.path.abspath( os.path.join( os.path.dirname( __file__ ), 'xsl', 'v2', 'boostbook_log.xsl' ) ) + , os.path.abspath( os.path.join( unpacked_docs_dir, 'boostbook.log.html' ) ) ) + + +def log( msg ): + print msg + +def process_boostbook_build_log( path, timestamp ): + f = open( path + '.xml', 'w' ) + g = xml.sax.saxutils.XMLGenerator( f ) + lines = open( path ).read().splitlines() + output_lines = [] + result = 'success' + for line in lines: + type = 'output' + if line.startswith( '...failed' ): + type = 'failure' + result='failure' + + if line.startswith( 'runtime error:' ): + type = 'failure' + + if line.startswith( '...skipped' ): + type = 'skipped' + output_lines.append( ( type, line ) ) + + g.startDocument() + g.startElement( 'build', { 'result': result, 'timestamp': timestamp } ) + for line in output_lines: + g.startElement( 'line', { 'type': line[0]} ) + g.characters( line[1] ) + g.endElement( 'line' ) + g.endElement( 'build' ) + g.endDocument() + + +def read_timestamp( docs_directory ): + f = open( os.path.join( docs_directory, 'timestamp' ) ) + try: + return f.readline() + finally: + f.close() + +def main(): + options = accept_args( sys.argv[1:]) + boostbook_report( options ) + +if __name__ == '__main__': + main() \ No newline at end of file diff --git a/tools/regression/xsl_reports/db/load.py b/tools/regression/xsl_reports/db/load.py new file mode 100644 index 0000000000..d12953d8f7 --- /dev/null +++ b/tools/regression/xsl_reports/db/load.py @@ -0,0 +1,10 @@ +import os +import sys +import win32com.client + +objBL = win32com.client.Dispatch("SQLXMLBulkLoad.SQLXMLBulkload.3.0") +objBL.ConnectionString = "provider=SQLOLEDB;data source=localhost;database=boost;integrated security=SSPI" +objBL.ErrorLogFile = "c:\\error.log" +#objBL.Execute( os.path.join( os.path.dirname( __file__ ), "test-runs.xsd" ), "Huang-WinXP-x64.xml" ) +#objBL.Execute( os.path.join( os.path.dirname( __file__ ), "test-runs.xsd" ), "extended_test_results.xml" ) +objBL.Execute( os.path.join( os.path.dirname( __file__ ), "test-runs.xsd" ), sys.argv[1] ) \ No newline at end of file diff --git a/tools/regression/xsl_reports/db/sqlserver_schemas.sql b/tools/regression/xsl_reports/db/sqlserver_schemas.sql new file mode 100644 index 0000000000..af307be983 --- /dev/null +++ b/tools/regression/xsl_reports/db/sqlserver_schemas.sql @@ -0,0 +1,82 @@ +drop table [test-log] +go +drop table [test-run] +go +CREATE TABLE [test-run] ( + [runner] [varchar] (32) NOT NULL , + [timestamp] [varchar] (32) NOT NULL , + [source] [varchar] (32) COLLATE SQL_Latin1_General_CP1_CI_AS NULL , + [tag] [varchar] (32) COLLATE SQL_Latin1_General_CP1_CI_AS NULL , + [platform] [varchar] (32), + [run-type] [varchar] (32) COLLATE SQL_Latin1_General_CP1_CI_AS NULL, + [comment] [text] NULL, + [toolset] varchar (32) not null + PRIMARY KEY ( runner, timestamp ) + ) +GO + +go +CREATE TABLE [test-log] + ( + [runner] [varchar] (32) NOT NULL , + [timestamp] [varchar] (32) NOT NULL , + [test-name] [varchar] (64) COLLATE SQL_Latin1_General_CP1_CI_AS NULL , + [test-run] [varchar] (32) COLLATE SQL_Latin1_General_CP1_CI_AS NULL , + [test-type] [varchar] (16) COLLATE SQL_Latin1_General_CP1_CI_AS NULL , + [test-program] [varchar] (512) COLLATE SQL_Latin1_General_CP1_CI_AS NULL , + [target-directory] [varchar] (512) NOT NULL , + [library] varchar(64) + PRIMARY KEY ( runner, timestamp, [target-directory] ) + ) +GO + +alter table [test-log] add CONSTRAINT parent FOREIGN KEY ( runner, timestamp ) REFERENCES [test-run] ( runner, timestamp ) + +go +drop table [compile] +go +create table [compile] + ( + [runner] [varchar](32) NOT NULL , + [target-directory] [varchar](512) NOT NULL , + [output] [text], + [timestamp] [varchar](32) NULL , + result [varchar](16) + ) + +drop table [link] +go +create table [link] + ( + [runner] [varchar](32) NOT NULL , + [target-directory] [varchar](512) NOT NULL , + [output] [text], + [timestamp] [varchar](32) NULL , + result [varchar](16) + ) + +drop table [run] +go +create table [run] + ( + [runner] [varchar](32) NOT NULL , + [target-directory] [varchar](512) NOT NULL , + [output] [text], + [timestamp] [varchar](32) NULL , + result [varchar](16) + ) + +drop table [note] +go +create table [note] + ( + [runner] [varchar](32) NOT NULL , + [target-directory] [varchar](512) NOT NULL , + [note] [text] + ) + + +select * from [test-run] +select * from [test-log] +select * from run +select * from note \ No newline at end of file diff --git a/tools/regression/xsl_reports/db/test-runs.xsd b/tools/regression/xsl_reports/db/test-runs.xsd new file mode 100644 index 0000000000..879a337e35 --- /dev/null +++ b/tools/regression/xsl_reports/db/test-runs.xsd @@ -0,0 +1,126 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/email_maintainers.py b/tools/regression/xsl_reports/email_maintainers.py new file mode 100644 index 0000000000..06c7e3b714 --- /dev/null +++ b/tools/regression/xsl_reports/email_maintainers.py @@ -0,0 +1,633 @@ +# +# Copyright (C) 2005 The Trustees of Indiana University +# Author: Douglas Gregor +# +# 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) +# +import re +import smtplib +import os +import time +import string +import datetime +import sys + +report_author = "Douglas Gregor " +boost_dev_list = "Boost Developer List " + +def sorted_keys( dict ): + result = dict.keys() + result.sort() + return result + + +class Platform: + """ + All of the failures for a particular platform. + """ + def __init__(self, name): + self.name = name + self.failures = list() + return + + def addFailure(self, failure): + self.failures.append(failure) + return + + def isBroken(self): + return len(self.failures) > 300 + +class Failure: + """ + A single test case failure in the report. + """ + def __init__(self, test, platform): + self.test = test + self.platform = platform + return + +class Test: + """ + All of the failures for a single test name within a library. + """ + def __init__(self, library, name): + self.library = library + self.name = name + self.failures = list() + return + + def addFailure(self, failure): + self.failures.append(failure) + return + + def numFailures(self): + return len(self.failures) + + def numReportableFailures(self): + """ + Returns the number of failures that we will report to the + maintainers of the library. This doesn't count failures on + broken platforms. + """ + count = 0 + for failure in self.failures: + if not failure.platform.isBroken(): + count += 1 + pass + pass + return count + +class Library: + """ + All of the information about the failures in a single library. + """ + def __init__(self, name): + self.name = name + self.maintainers = list() + self.tests = list() + return + + def addTest(self, test): + """ + Add another test to the library. + """ + self.tests.append(test) + return + + def addMaintainer(self, maintainer): + """ + Add a new maintainer for this library. + """ + self.maintainers.append(maintainer) + return + + def numFailures(self): + count = 0 + for test in self.tests: + count += test.numFailures() + pass + return count + + def numReportableFailures(self): + count = 0 + for test in self.tests: + count += test.numReportableFailures() + pass + return count + +class Maintainer: + """ + Information about the maintainer of a library + """ + def __init__(self, name, email): + self.name = name + self.email = email + self.libraries = list() + return + + def addLibrary(self, library): + self.libraries.append(library) + return + + def composeEmail(self, report): + """ + Composes an e-mail to this maintainer with information about + the failures in his or her libraries, omitting those that come + from "broken" platforms. Returns the e-mail text if a message + needs to be sent, or None otherwise. + """ + + # Determine if we need to send a message to this developer. + requires_message = False + for library in self.libraries: + if library.numReportableFailures() > 0: + requires_message = True + break + + if not requires_message: + return None + + # Build the message header + message = """From: Douglas Gregor +To: """ + message += self.name + ' <' + self.email + '>' + message += """ +Reply-To: boost@lists.boost.org +Subject: Regressions in your Boost libraries as of """ + message += str(datetime.date.today()) + " [" + report.branch + "]" + message += """ + +You are receiving this report because one or more of the libraries you +maintain has regression test failures that are not accounted for. +A full version of the report is sent to the Boost developer's mailing +list. + +Detailed report: +""" + message += ' ' + report.url + """ + +There are failures in these libraries you maintain: +""" + + # List the libraries this maintainer is responsible for and + # the number of reportable failures in that library. + for library in self.libraries: + num_failures = library.numReportableFailures() + if num_failures > 0: + message += ' ' + library.name + ' (' + str(num_failures) + ')\n' + pass + pass + + # Provide the details for the failures in each library. + for library in self.libraries: + if library.numReportableFailures() > 0: + message += '\n|' + library.name + '|\n' + for test in library.tests: + if test.numReportableFailures() > 0: + message += ' ' + test.name + ':' + for failure in test.failures: + if not failure.platform.isBroken(): + message += ' ' + failure.platform.name + pass + pass + message += '\n' + pass + pass + pass + pass + + return message + +class Report: + """ + The complete report of all failing test cases. + """ + def __init__(self, branch = 'HEAD'): + self.branch = branch + self.date = None + self.url = None + self.libraries = dict() + self.platforms = dict() + self.maintainers = dict() + return + + def getPlatform(self, name): + """ + Retrieve the platform with the given name. + """ + if self.platforms.has_key(name): + return self.platforms[name] + else: + self.platforms[name] = Platform(name) + return self.platforms[name] + + def getMaintainer(self, name, email): + """ + Retrieve the maintainer with the given name and e-mail address. + """ + if self.maintainers.has_key(name): + return self.maintainers[name] + else: + self.maintainers[name] = Maintainer(name, email) + return self.maintainers[name] + + def parseIssuesEmail(self): + """ + Try to parse the issues e-mail file. Returns True if everything was + successful, false otherwise. + """ + # See if we actually got the file + if not os.path.isfile('issues-email.txt'): + return False + + # Determine the set of libraries that have unresolved failures + date_regex = re.compile('Report time: (.*)') + url_regex = re.compile(' (http://.*)') + library_regex = re.compile('\|(.*)\|') + failure_regex = re.compile(' ([^:]*): (.*)') + current_library = None + for line in file('issues-email.txt', 'r'): + # Check for the report time line + m = date_regex.match(line) + if m: + self.date = m.group(1) + continue + + # Check for the detailed report URL + m = url_regex.match(line) + if m: + self.url = m.group(1) + continue + + # Check for a library header + m = library_regex.match(line) + if m: + current_library = Library(m.group(1)) + self.libraries[m.group(1)] = current_library + continue + + # Check for a library test and its failures + m = failure_regex.match(line) + if m: + test = Test(current_library, m.group(1)) + for platform_name in re.split('\s*', m.group(2)): + if platform_name != '': + platform = self.getPlatform(platform_name) + failure = Failure(test, platform) + test.addFailure(failure) + platform.addFailure(failure) + pass + current_library.addTest(test) + continue + pass + + return True + + def getIssuesEmail(self): + """ + Retrieve the issues email from MetaComm, trying a few times in + case something wonky is happening. If we can retrieve the file, + calls parseIssuesEmail and return True; otherwise, return False. + """ + base_url = "http://engineering.meta-comm.com/boost-regression/CVS-" + base_url += self.branch + base_url += "/developer/"; + got_issues = False + + # Ping the server by looking for an HTML file + print "Pinging the server to initiate extraction..." + ping_url = base_url + "issues.html" + os.system('curl -O ' + ping_url) + os.system('rm -f issues.html') + + for x in range(30): + # Update issues-email.txt + url = base_url + "issues-email.txt" + print 'Retrieving issues email from ' + url + os.system('rm -f issues-email.txt') + os.system('curl -O ' + url) + + if self.parseIssuesEmail(): + return True + + print 'Failed to fetch issues email. ' + time.sleep (30) + + return False + + # Parses the file $BOOST_ROOT/libs/maintainers.txt to create a hash + # mapping from the library name to the list of maintainers. + def parseLibraryMaintainersFile(self): + """ + Parse the maintainers file in ../../../libs/maintainers.txt to + collect information about the maintainers of broken libraries. + """ + lib_maintainer_regex = re.compile('(\S+)\s*(.*)') + name_email_regex = re.compile('\s*(\w*(\s*\w+)+)\s*<\s*(\S*(\s*\S+)+)\S*>') + at_regex = re.compile('\s*-\s*at\s*-\s*') + for line in file('../../../libs/maintainers.txt', 'r'): + m = lib_maintainer_regex.match (line) + if m: + libname = m.group(1) + if self.libraries.has_key(m.group(1)): + library = self.libraries[m.group(1)] + for person in re.split('\s*,\s*', m.group(2)): + nmm = name_email_regex.match(person) + if nmm: + name = nmm.group(1) + email = nmm.group(3) + email = at_regex.sub('@', email) + maintainer = self.getMaintainer(name, email) + maintainer.addLibrary(library) + library.addMaintainer(maintainer) + pass + pass + pass + pass + pass + pass + + def numFailures(self): + count = 0 + for library in self.libraries: + count += self.libraries[library].numFailures() + pass + return count + + def numReportableFailures(self): + count = 0 + for library in self.libraries: + count += self.libraries[library].numReportableFailures() + pass + return count + + def composeSummaryEmail(self): + """ + Compose a message to send to the Boost developer's + list. Return the message and return it. + """ + message = """From: Douglas Gregor +To: boost@lists.boost.org +Reply-To: boost@lists.boost.org +Subject: Boost regression notification (""" + + message += str(datetime.date.today()) + " [" + branch + "]" + message += ")" + + message += """ + +Boost Regression test failures +""" + message += "Report time: " + self.date + """ + +This report lists all regression test failures on release platforms. + +Detailed report: +""" + + message += ' ' + self.url + '\n\n' + + if self.numFailures() == 0: + message += "No failures! Yay!\n" + return message + + # List the platforms that are broken + any_broken_platforms = self.numReportableFailures() < self.numFailures() + if any_broken_platforms: + message += """The following platforms have a large number of failures: +""" + for platform in sorted_keys( self.platforms ): + if self.platforms[platform].isBroken(): + message += ' ' + platform + '\n' + + message += '\n' + + # Display the number of failures + message += (str(self.numFailures()) + ' failures in ' + + str(len(self.libraries)) + ' libraries') + if any_broken_platforms: + diff = self.numFailures() - self.numReportableFailures() + message += ' (' + str(diff) + ' are from non-broken platforms)' + message += '\n' + + # Display the number of failures per library + for k in sorted_keys( self.libraries ): + library = self.libraries[k] + num_failures = library.numFailures() + message += (' ' + library.name + ' (' + + str(library.numReportableFailures())) + if library.numReportableFailures() < num_failures: + message += (' of ' + str(num_failures) + + ' failures are from non-broken platforms') + message += ')\n' + pass + + # If we have any broken platforms, tell the user how we're + # displaying them. + if any_broken_platforms: + message += """ +Test failures marked with a (*) represent tests that failed on +platforms that are considered broken. They are likely caused by +misconfiguration by the regression tester or a failure in a core +library such as Test or Config.""" + message += '\n' + + # Provide the details for the failures in each library. + for k in sorted_keys( self.libraries ): + library = self.libraries[k] + message += '\n|' + library.name + '|\n' + for test in library.tests: + message += ' ' + test.name + ':' + for failure in test.failures: + platform = failure.platform + message += ' ' + platform.name + if platform.isBroken(): + message += '*' + pass + message += '\n' + pass + pass + + return message + +# Send a message to "person" (a maintainer of a library that is +# failing). +# maintainers is the result of get_library_maintainers() +def send_individualized_message (branch, person, maintainers): + # There are several states we could be in: + # 0 Initial state. Eat everything up to the "NNN failures in MMM + # libraries" line + # 1 Suppress output within this library + # 2 Forward output within this library + state = 0 + + failures_in_lib_regex = re.compile('\d+ failur.*\d+ librar') + lib_failures_regex = re.compile(' (\S+) \((\d+)\)') + lib_start_regex = re.compile('\|(\S+)\|') + general_pass_regex = re.compile(' http://') + for line in file('issues-email.txt', 'r'): + if state == 0: + lfm = lib_failures_regex.match(line) + if lfm: + # Pass the line through if the current person is a + # maintainer of this library + if lfm.group(1) in maintainers and person in maintainers[lfm.group(1)]: + message += line + print line, + + elif failures_in_lib_regex.match(line): + message += "\nThere are failures in these libraries you maintain:\n" + elif general_pass_regex.match(line): + message += line + + lib_start = lib_start_regex.match(line) + if lib_start: + if state == 0: + message += '\n' + + if lib_start.group(1) in maintainers and person in maintainers[lib_start.group(1)]: + message += line + state = 2 + else: + state = 1 + else: + if state == 1: + pass + elif state == 2: + message += line + + if '--debug' in sys.argv: + print '-----------------Message text----------------' + print message + else: + print + + if '--send' in sys.argv: + print "Sending..." + smtp = smtplib.SMTP('milliways.osl.iu.edu') + smtp.sendmail(from_addr = 'Douglas Gregor ', + to_addrs = person[1], + msg = message) + print "Done." + + +# Send a message to the developer's list +def send_boost_developers_message(branch, maintainers, failing_libraries): + to_line = 'boost@lists.boost.org' + from_line = 'Douglas Gregor ' + + message = """From: Douglas Gregor +To: boost@lists.boost.org +Reply-To: boost@lists.boost.org +Subject: Boost regression notification (""" + + message += str(datetime.date.today()) + " [" + branch + "]" + message += ")" + + message += """ + +""" + + for line in file('issues-email.txt', 'r'): + # Right before the detailed report, put out a warning message if + # any libraries with failures to not have maintainers listed. + if line.startswith('Detailed report:'): + missing_maintainers = False + for lib in failing_libraries: + if not(lib in maintainers) or maintainers[lib] == list(): + missing_maintainers = True + + if missing_maintainers: + message += """WARNING: The following libraries have failing regression tests but do +not have a maintainer on file. Once a maintainer is found, add an +entry to libs/maintainers.txt to eliminate this message. +""" + + for lib in failing_libraries: + if not(lib in maintainers) or maintainers[lib] == list(): + message += ' ' + lib + '\n' + message += '\n' + + message += line + + if '--send' in sys.argv: + print 'Sending notification email...' + smtp = smtplib.SMTP('milliways.osl.iu.edu') + smtp.sendmail(from_addr = from_line, to_addrs = to_line, msg = message) + print 'Done.' + + if '--debug' in sys.argv: + print "----------Boost developer's message text----------" + print message + +############################################################################### +# Main program # +############################################################################### + +# Parse command-line options +branch = "HEAD" +for arg in sys.argv: + if arg.startswith("--branch="): + branch = arg[len("--branch="):] + +report = Report(branch) + +# Try to parse the issues e-mail +if '--no-get' in sys.argv: + okay = report.parseIssuesEmail() +else: + okay = report.getIssuesEmail() + +if not okay: + print 'Aborting.' + if '--send' in sys.argv: + message = """From: Douglas Gregor + To: Douglas Gregor + Reply-To: boost@lists.boost.org + Subject: Regression status script failed on """ + message += str(datetime.date.today()) + " [" + branch + "]" + smtp = smtplib.SMTP('milliways.osl.iu.edu') + smtp.sendmail(from_addr = 'Douglas Gregor ', + to_addrs = 'dgregor@cs.indiana.edu', + msg = message) + sys.exit(1) + +# Try to parse maintainers information +report.parseLibraryMaintainersFile() + +for maintainer_name in report.maintainers: + maintainer = report.maintainers[maintainer_name] + + email = maintainer.composeEmail(report) + if email: + if '--send' in sys.argv: + print ('Sending notification email to ' + maintainer.name + '...') + smtp = smtplib.SMTP('milliways.osl.iu.edu') + smtp.sendmail(from_addr = report_author, + to_addrs = maintainer.email, + msg = email) + print 'done.\n' + else: + print 'Would send a notification e-mail to',maintainer.name + + if '--debug' in sys.argv: + print ('Message text for ' + maintainer.name + ':\n') + print email + +email = report.composeSummaryEmail() +if '--send' in sys.argv: + print 'Sending summary email to Boost developer list...' + smtp = smtplib.SMTP('milliways.osl.iu.edu') + smtp.sendmail(from_addr = report_author, + to_addrs = boost_dev_list, + msg = email) + print 'done.\n' +if '--debug' in sys.argv: + print 'Message text for summary:\n' + print email + +if not ('--send' in sys.argv): + print 'Chickening out and not sending any e-mail.' + print 'Use --send to actually send e-mail, --debug to see e-mails.' diff --git a/tools/regression/xsl_reports/empty_expected_results.xml b/tools/regression/xsl_reports/empty_expected_results.xml new file mode 100644 index 0000000000..43e72ca406 --- /dev/null +++ b/tools/regression/xsl_reports/empty_expected_results.xml @@ -0,0 +1,5 @@ + + + + + \ No newline at end of file diff --git a/tools/regression/xsl_reports/make_snapshot.py b/tools/regression/xsl_reports/make_snapshot.py new file mode 100644 index 0000000000..7b9b2f8020 --- /dev/null +++ b/tools/regression/xsl_reports/make_snapshot.py @@ -0,0 +1,175 @@ + +# Copyright (c) MetaCommunications, Inc. 2003-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) + +import tarfile +import shutil +import time +import os.path +import string +import sys +import traceback + + +def retry( f, args, max_attempts=5, sleep_secs=10 ): + for attempts in range( max_attempts, -1, -1 ): + try: + return f( *args ) + except Exception, msg: + utils.log( '%s failed with message "%s"' % ( f.__name__, msg ) ) + if attempts == 0: + utils.log( 'Giving up.' ) + raise + + utils.log( 'Retrying (%d more attempts).' % attempts ) + time.sleep( sleep_secs ) + + +def rmtree( path ): + if os.path.exists( path ): + if sys.platform == 'win32': + os.system( 'del /f /s /q "%s" >nul 2>&1' % path ) + shutil.rmtree( path ) + else: + os.system( 'rm -f -r "%s"' % path ) + + +def cvs_command( user, command ): + cmd = 'cvs -d:ext:%(user)s@cvs.sourceforge.net:/cvsroot/boost -z9 %(command)s' \ + % { 'user': user, 'command': command } + + utils.log( 'Executing CVS command "%s"' % cmd ) + rc = os.system( cmd ) + if rc != 0: + raise Exception( 'CVS command "%s" failed with code %d' % ( cmd, rc ) ) + + + +def cvs_export( working_dir, user, tag ): + if tag != 'CVS-HEAD': + command = 'export -r %s boost' % tag + else: + command = 'export -r HEAD boost' + + os.chdir( working_dir ) + retry( + cvs_command + , ( user, command ) + ) + + +def make_tarball( + working_dir + , tag + , user + , site_dir + ): + + sources_dir = os.path.join( working_dir, 'boost' ) + if os.path.exists( sources_dir ): + utils.log( 'Directory "%s" already exists, cleaning it up...' % sources_dir ) + rmtree( sources_dir ) + + try: + os.mkdir( sources_dir ) + utils.log( 'Exporting files from CVS...' ) + cvs_export( working_dir, user, tag ) + except: + utils.log( 'Cleaning up...' ) + rmtree( sources_dir ) + raise + + timestamp = time.time() + timestamped_dir_name = 'boost-%s-%s' % ( tag, time.strftime( '%y-%m-%d-%H%M', time.gmtime( timestamp ) ) ) + timestamped_dir = os.path.join( working_dir, timestamped_dir_name ) + + utils.log( 'Renaming "%s" to "%s"...' % ( sources_dir, timestamped_dir ) ) + os.rename( sources_dir, timestamped_dir ) + + tarball_name = 'boost-%s.tar.bz2' % tag + tarball_path = os.path.join( working_dir, tarball_name ) + + utils.log( 'Archiving "%s" to "%s"...' % ( timestamped_dir, tarball_path ) ) + tar = tarfile.open( tarball_path, 'w|bz2' ) + tar.posix = False # see http://tinyurl.com/4ebd8 + + tar.add( timestamped_dir, timestamped_dir_name ) + tar.close() + + tarball_timestamp_path = os.path.join( working_dir, 'boost-%s.timestamp' % tag ) + + utils.log( 'Writing timestamp into "%s"...' % tarball_timestamp_path ) + timestamp_file = open( tarball_timestamp_path, 'w' ) + timestamp_file.write( '%f' % timestamp ) + timestamp_file.close() + + md5sum_path = os.path.join( working_dir, 'boost-%s.md5' % tag ) + utils.log( 'Writing md5 checksum into "%s"...' % md5sum_path ) + old_dir = os.getcwd() + os.chdir( os.path.dirname( tarball_path ) ) + os.system( 'md5sum -b "%s" >"%s"' % ( os.path.basename( tarball_path ), md5sum_path ) ) + os.chdir( old_dir ) + + if site_dir is not None: + utils.log( 'Moving "%s" to the site location "%s"...' % ( tarball_name, site_dir ) ) + temp_site_dir = os.path.join( site_dir, 'temp' ) + if not os.path.exists( temp_site_dir ): + os.mkdir( temp_site_dir ) + + shutil.move( tarball_path, temp_site_dir ) + shutil.move( os.path.join( temp_site_dir, tarball_name ), site_dir ) + shutil.move( tarball_timestamp_path, site_dir ) + shutil.move( md5sum_path, site_dir ) + utils.log( 'Removing "%s"...' % timestamped_dir ) + rmtree( timestamped_dir ) + + +def accept_args( args ): + args_spec = [ + 'working-dir=' + , 'tag=' + , 'user=' + , 'site-dir=' + , 'mail=' + , 'help' + ] + + options = { + '--tag': 'CVS-HEAD' + , '--site-dir': None + } + + utils.accept_args( args_spec, args, options, usage ) + + return ( + options[ '--working-dir' ] + , options[ '--tag' ] + , options[ '--user' ] + , options[ '--site-dir' ] + ) + + +def usage(): + print 'Usage: %s [options]' % os.path.basename( sys.argv[0] ) + print ''' +\t--working-dir working directory +\t--tag snapshot tag (i.e. 'CVS-HEAD') +\t--user SourceForge user name for a CVS account +\t--site-dir site directory to copy the snapshot to (optional) +''' + +def main(): + make_tarball( *accept_args( sys.argv[ 1: ] ) ) + +if __name__ != '__main__': import utils +else: + # in absense of relative import... + xsl_path = os.path.abspath( os.path.dirname( sys.argv[ 0 ] ) ) + while os.path.basename( xsl_path ) != 'xsl_reports': xsl_path = os.path.dirname( xsl_path ) + sys.path.append( xsl_path ) + + import utils + main() diff --git a/tools/regression/xsl_reports/report.py b/tools/regression/xsl_reports/report.py new file mode 100644 index 0000000000..3a262195d6 --- /dev/null +++ b/tools/regression/xsl_reports/report.py @@ -0,0 +1,369 @@ + +# Copyright (c) MetaCommunications, Inc. 2003-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) + +import shutil +import os.path +import os +import string +import time +import sys + +import utils +import runner + + +report_types = [ 'us', 'ds', 'ud', 'dd', 'l', 'p', 'x', 'i', 'n', 'ddr', 'dsr' ] + +if __name__ == '__main__': + run_dir = os.path.abspath( os.path.dirname( sys.argv[ 0 ] ) ) +else: + run_dir = os.path.abspath( os.path.dirname( sys.modules[ __name__ ].__file__ ) ) + + +def map_path( path ): + return os.path.join( run_dir, path ) + + +def xsl_path( xsl_file_name, v2 = 0 ): + if v2: + return map_path( os.path.join( 'xsl/v2', xsl_file_name ) ) + else: + return map_path( os.path.join( 'xsl', xsl_file_name ) ) + + +def make_result_pages( + test_results_file + , expected_results_file + , failures_markup_file + , tag + , run_date + , comment_file + , results_dir + , result_prefix + , reports + , v2 + ): + + utils.log( 'Producing the reports...' ) + __log__ = 1 + + output_dir = os.path.join( results_dir, result_prefix ) + utils.makedirs( output_dir ) + + if comment_file != '': + comment_file = os.path.abspath( comment_file ) + + if expected_results_file != '': + expected_results_file = os.path.abspath( expected_results_file ) + else: + expected_results_file = os.path.abspath( map_path( 'empty_expected_results.xml' ) ) + + + extended_test_results = os.path.join( output_dir, 'extended_test_results.xml' ) + if 'x' in reports: + utils.log( ' Merging with expected results...' ) + utils.libxslt( + utils.log + , test_results_file + , xsl_path( 'add_expected_results.xsl', v2 ) + , extended_test_results + , { 'expected_results_file': expected_results_file, 'failures_markup_file' : failures_markup_file } + ) + + links = os.path.join( output_dir, 'links.html' ) + + utils.makedirs( os.path.join( output_dir, 'output' ) ) + for mode in ( 'developer', 'user' ): + utils.makedirs( os.path.join( output_dir, mode , 'output' ) ) + + if 'l' in reports: + utils.log( ' Making test output files...' ) + utils.libxslt( + utils.log + , extended_test_results + , xsl_path( 'links_page.xsl', v2 ) + , links + , { + 'source': tag + , 'run_date': run_date + , 'comment_file': comment_file + , 'explicit_markup_file': failures_markup_file + } + ) + + + issues = os.path.join( output_dir, 'developer', 'issues.html' ) + if 'i' in reports: + utils.log( ' Making issues list...' ) + utils.libxslt( + utils.log + , extended_test_results + , xsl_path( 'issues_page.xsl', v2 ) + , issues + , { + 'source': tag + , 'run_date': run_date + , 'comment_file': comment_file + , 'explicit_markup_file': failures_markup_file + } + ) + + for mode in ( 'developer', 'user' ): + if mode[0] + 'd' in reports: + utils.log( ' Making detailed %s report...' % mode ) + utils.libxslt( + utils.log + , extended_test_results + , xsl_path( 'result_page.xsl', v2 ) + , os.path.join( output_dir, mode, 'index.html' ) + , { + 'links_file': 'links.html' + , 'mode': mode + , 'source': tag + , 'run_date': run_date + , 'comment_file': comment_file + , 'expected_results_file': expected_results_file + , 'explicit_markup_file' : failures_markup_file + } + ) + + for mode in ( 'developer', 'user' ): + if mode[0] + 's' in reports: + utils.log( ' Making summary %s report...' % mode ) + utils.libxslt( + utils.log + , extended_test_results + , xsl_path( 'summary_page.xsl', v2 ) + , os.path.join( output_dir, mode, 'summary.html' ) + , { + 'mode' : mode + , 'source': tag + , 'run_date': run_date + , 'comment_file': comment_file + , 'explicit_markup_file' : failures_markup_file + } + ) + + if v2 and "ddr" in reports: + utils.log( ' Making detailed %s release report...' % mode ) + utils.libxslt( + utils.log + , extended_test_results + , xsl_path( 'result_page.xsl', v2 ) + , os.path.join( output_dir, "developer", 'index_release.html' ) + , { + 'links_file': 'links.html' + , 'mode': "developer" + , 'source': tag + , 'run_date': run_date + , 'comment_file': comment_file + , 'expected_results_file': expected_results_file + , 'explicit_markup_file' : failures_markup_file + , 'release': "yes" + } + ) + + if v2 and "dsr" in reports: + utils.log( ' Making summary %s release report...' % mode ) + utils.libxslt( + utils.log + , extended_test_results + , xsl_path( 'summary_page.xsl', v2 ) + , os.path.join( output_dir, "developer", 'summary_release.html' ) + , { + 'mode' : "developer" + , 'source': tag + , 'run_date': run_date + , 'comment_file': comment_file + , 'explicit_markup_file' : failures_markup_file + , 'release': 'yes' + } + ) + + if 'e' in reports: + utils.log( ' Generating expected_results ...' ) + utils.libxslt( + utils.log + , extended_test_results + , xsl_path( 'produce_expected_results.xsl', v2 ) + , os.path.join( output_dir, 'expected_results.xml' ) + ) + + if v2 and 'n' in reports: + utils.log( ' Making runner comment files...' ) + utils.libxslt( + utils.log + , extended_test_results + , xsl_path( 'runners.xsl', v2 ) + , os.path.join( output_dir, 'runners.html' ) + ) + + shutil.copyfile( + xsl_path( 'html/master.css', v2 ) + , os.path.join( output_dir, 'master.css' ) + ) + + +def build_xsl_reports( + locate_root_dir + , tag + , expected_results_file + , failures_markup_file + , comment_file + , results_dir + , result_file_prefix + , dont_collect_logs = 0 + , reports = report_types + , v2 = 0 + , user = None + , upload = False + ): + + ( run_date ) = time.strftime( '%Y-%m-%dT%H:%M:%SZ', time.gmtime() ) + + test_results_file = os.path.join( results_dir, 'test_results.xml' ) + bin_boost_dir = os.path.join( locate_root_dir, 'bin', 'boost' ) + + if v2: + import merger + merger.merge_logs( + tag + , user + , results_dir + , test_results_file + , dont_collect_logs + ) + else: + utils.log( ' dont_collect_logs: %s' % dont_collect_logs ) + if not dont_collect_logs: + f = open( test_results_file, 'w+' ) + f.write( '\n' ) + runner.collect_test_logs( [ bin_boost_dir ], f ) + f.write( '\n' ) + f.close() + + make_result_pages( + test_results_file + , expected_results_file + , failures_markup_file + , tag + , run_date + , comment_file + , results_dir + , result_file_prefix + , reports + , v2 + ) + + if v2 and upload: + upload_dir = 'regression-logs/' + utils.log( 'Uploading v2 results into "%s" [connecting as %s]...' % ( upload_dir, user ) ) + + archive_name = '%s.tar.gz' % result_file_prefix + utils.tar( + os.path.join( results_dir, result_file_prefix ) + , archive_name + ) + + utils.sourceforge.upload( os.path.join( results_dir, archive_name ), upload_dir, user ) + utils.sourceforge.untar( os.path.join( upload_dir, archive_name ), user, background = True ) + + +def accept_args( args ): + args_spec = [ + 'locate-root=' + , 'tag=' + , 'expected-results=' + , 'failures-markup=' + , 'comment=' + , 'results-dir=' + , 'results-prefix=' + , 'dont-collect-logs' + , 'reports=' + , 'v2' + , 'user=' + , 'upload' + , 'help' + ] + + options = { + '--comment': '' + , '--expected-results': '' + , '--failures-markup': '' + , '--reports': string.join( report_types, ',' ) + , '--tag': None + , '--user': None + , 'upload': False + } + + utils.accept_args( args_spec, args, options, usage ) + if not options.has_key( '--results-dir' ): + options[ '--results-dir' ] = options[ '--locate-root' ] + + if not options.has_key( '--results-prefix' ): + if options.has_key( '--v2' ): + options[ '--results-prefix' ] = 'all' + else: + options[ '--results-prefix' ] = '' + + return ( + options[ '--locate-root' ] + , options[ '--tag' ] + , options[ '--expected-results' ] + , options[ '--failures-markup' ] + , options[ '--comment' ] + , options[ '--results-dir' ] + , options[ '--results-prefix' ] + , options.has_key( '--dont-collect-logs' ) + , options[ '--reports' ].split( ',' ) + , options.has_key( '--v2' ) + , options[ '--user' ] + , options.has_key( '--upload' ) + ) + + +def usage(): + print 'Usage: %s [options]' % os.path.basename( sys.argv[0] ) + print ''' +\t--locate-root the same as --locate-root in compiler_status +\t--tag the tag for the results (i.e. 'CVS-HEAD') +\t--expected-results the file with the results to be compared with +\t the current run +\t--failures-markup the file with the failures markup +\t--comment an html comment file (will be inserted in the reports) +\t--results-dir the directory containing -links.html, -fail.html +\t files produced by compiler_status (by default the +\t same as specified in --locate-root) +\t--results-prefix the prefix of -links.html, -fail.html +\t files produced by compiler_status +\t--v2 v2 reports (combine multiple runners results into a +\t single set of reports) + +The following options are valid only for v2 reports: + +\t--user SourceForge user name for a shell account +\t--upload upload v2 reports to SourceForge + +The following options are useful in debugging: + +\t--dont-collect-logs dont collect the test logs +\t--reports produce only the specified reports +\t us - user summary +\t ds - developer summary +\t ud - user detailed +\t dd - developer detailed +\t l - links +\t p - patches +\t x - extended results file +\t i - issues +''' + +def main(): + build_xsl_reports( *accept_args( sys.argv[ 1 : ] ) ) + +if __name__ == '__main__': + main() diff --git a/tools/regression/xsl_reports/runner/__init__.py b/tools/regression/xsl_reports/runner/__init__.py new file mode 100644 index 0000000000..4018536558 --- /dev/null +++ b/tools/regression/xsl_reports/runner/__init__.py @@ -0,0 +1,2 @@ + +from collect_and_upload_logs import * diff --git a/tools/regression/xsl_reports/runner/collect_and_upload_logs.py b/tools/regression/xsl_reports/runner/collect_and_upload_logs.py new file mode 100644 index 0000000000..aa54628ef8 --- /dev/null +++ b/tools/regression/xsl_reports/runner/collect_and_upload_logs.py @@ -0,0 +1,333 @@ + +# Copyright (c) MetaCommunications, Inc. 2003-2007 +# +# 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) + +import xml.sax.saxutils +import zipfile +import ftplib +import time +import stat + +import os.path +import string +import sys + + +def process_xml_file( input_file, output_file ): + utils.log( 'Processing test log "%s"' % input_file ) + + f = open( input_file, 'r' ) + xml = f.readlines() + f.close() + + for i in range( 0, len(xml)): + xml[i] = string.translate( xml[i], utils.char_translation_table ) + + output_file.writelines( xml ) + + +def process_test_log_files( output_file, dir, names ): + for file in names: + if os.path.basename( file ) == 'test_log.xml': + process_xml_file( os.path.join( dir, file ), output_file ) + + +def collect_test_logs( input_dirs, test_results_writer ): + __log__ = 1 + utils.log( 'Collecting test logs ...' ) + for input_dir in input_dirs: + utils.log( 'Walking directory "%s" ...' % input_dir ) + os.path.walk( input_dir, process_test_log_files, test_results_writer ) + + +def upload_to_ftp( tag, results_file, ftp_proxy, debug_level ): + ftp_site = 'fx.meta-comm.com' + site_path = '/boost-regression' + utils.log( 'Uploading log archive "%s" to ftp://%s%s/%s' % ( results_file, ftp_site, site_path, tag ) ) + + if not ftp_proxy: + ftp = ftplib.FTP( ftp_site ) + ftp.set_debuglevel( debug_level ) + ftp.login() + else: + utils.log( ' Connecting through FTP proxy server "%s"' % ftp_proxy ) + ftp = ftplib.FTP( ftp_proxy ) + ftp.set_debuglevel( debug_level ) + ftp.set_pasv (0) # turn off PASV mode + ftp.login( 'anonymous@%s' % ftp_site, 'anonymous@' ) + + ftp.cwd( site_path ) + try: + ftp.cwd( tag ) + except ftplib.error_perm: + ftp.mkd( tag ) + ftp.cwd( tag ) + + f = open( results_file, 'rb' ) + ftp.storbinary( 'STOR %s' % os.path.basename( results_file ), f ) + ftp.quit() + + +def copy_comments( results_xml, comment_file ): + results_xml.startElement( 'comment', {} ) + + if os.path.exists( comment_file ): + utils.log( 'Reading comments file "%s"...' % comment_file ) + f = open( comment_file, 'r' ) + try: + results_xml.characters( f.read() ) + finally: + f.close() + else: + utils.log( 'Warning: comment file "%s" is not found.' % comment_file ) + + results_xml.endElement( 'comment' ) + + +def compress_file( file_path, archive_path ): + utils.log( 'Compressing "%s"...' % file_path ) + + try: + z = zipfile.ZipFile( archive_path, 'w', zipfile.ZIP_DEFLATED ) + z.write( file_path, os.path.basename( file_path ) ) + z.close() + utils.log( 'Done writing "%s".'% archive_path ) + except Exception, msg: + utils.log( 'Warning: Compressing falied (%s)' % msg ) + utils.log( ' Trying to compress using a platform-specific tool...' ) + try: import zip_cmd + except ImportError: + script_dir = os.path.dirname( os.path.abspath( sys.argv[0] ) ) + utils.log( 'Could not find \'zip_cmd\' module in the script directory (%s).' % script_dir ) + raise Exception( 'Compressing failed!' ) + else: + if os.path.exists( archive_path ): + os.unlink( archive_path ) + utils.log( 'Removing stale "%s".' % archive_path ) + + zip_cmd.main( file_path, archive_path ) + utils.log( 'Done compressing "%s".' % archive_path ) + + +def read_timestamp( file ): + if not os.path.exists( file ): + result = time.gmtime() + utils.log( 'Warning: timestamp file "%s" does not exist'% file ) + utils.log( 'Using current UTC time (%s)' % result ) + return result + + return time.gmtime( os.stat( file ).st_mtime ) + + +def collect_logs( + results_dir + , runner_id + , tag + , platform + , comment_file + , timestamp_file + , user + , source + , run_type + , **unused + ): + + results_file = os.path.join( results_dir, '%s.xml' % runner_id ) + results_writer = open( results_file, 'w' ) + utils.log( 'Collecting test logs into "%s"...' % results_file ) + + results_xml = xml.sax.saxutils.XMLGenerator( results_writer ) + results_xml.startDocument() + results_xml.startElement( + 'test-run' + , { + 'tag': tag + , 'platform': platform + , 'runner': runner_id + , 'timestamp': time.strftime( '%Y-%m-%dT%H:%M:%SZ', read_timestamp( timestamp_file ) ) + , 'source': source + , 'run-type': run_type + } + ) + + copy_comments( results_xml, comment_file ) + collect_test_logs( [ results_dir ], results_writer ) + + results_xml.endElement( "test-run" ) + results_xml.endDocument() + results_writer.close() + utils.log( 'Done writing "%s".' % results_file ) + + compress_file( + results_file + , os.path.join( results_dir,'%s.zip' % runner_id ) + ) + + +def upload_logs( + results_dir + , runner_id + , tag + , user + , ftp_proxy + , debug_level + , send_bjam_log = False + , timestamp_file = None + , **unused + ): + + logs_archive = os.path.join( results_dir, '%s.zip' % runner_id ) + upload_to_ftp( tag, logs_archive, ftp_proxy, debug_level ) + if send_bjam_log: + bjam_log_path = os.path.join( results_dir, 'bjam.log' ) + if not timestamp_file: + timestamp_file = bjam_log_path + + timestamp = time.strftime( '%Y-%m-%d-%H-%M-%S', read_timestamp( timestamp_file ) ) + logs_archive = os.path.join( results_dir, '%s.%s.log.zip' % ( runner_id, timestamp ) ) + compress_file( bjam_log_path, logs_archive ) + upload_to_ftp( '%s/logs' % tag, logs_archive, ftp_proxy, debug_level ) + + +def collect_and_upload_logs( + results_dir + , runner_id + , tag + , platform + , comment_file + , timestamp_file + , user + , source + , run_type + , ftp_proxy = None + , debug_level = 0 + , send_bjam_log = False + , **unused + ): + + collect_logs( + results_dir + , runner_id + , tag + , platform + , comment_file + , timestamp_file + , user + , source + , run_type + ) + + upload_logs( + results_dir + , runner_id + , tag + , user + , ftp_proxy + , debug_level + , send_bjam_log + , timestamp_file + ) + + +def accept_args( args ): + args_spec = [ + 'locate-root=' + , 'runner=' + , 'tag=' + , 'platform=' + , 'comment=' + , 'timestamp=' + , 'source=' + , 'run-type=' + , 'user=' + , 'ftp-proxy=' + , 'debug-level=' + , 'send-bjam-log' + , 'help' + ] + + options = { + '--tag' : 'CVS-HEAD' + , '--platform' : sys.platform + , '--comment' : 'comment.html' + , '--timestamp' : 'timestamp' + , '--user' : None + , '--source' : 'CVS' + , '--run-type' : 'full' + , '--ftp-proxy' : None + , '--debug-level' : 0 + } + + utils.accept_args( args_spec, args, options, usage ) + + return { + 'results_dir' : options[ '--locate-root' ] + , 'runner_id' : options[ '--runner' ] + , 'tag' : options[ '--tag' ] + , 'platform' : options[ '--platform'] + , 'comment_file' : options[ '--comment' ] + , 'timestamp_file' : options[ '--timestamp' ] + , 'user' : options[ '--user' ] + , 'source' : options[ '--source' ] + , 'run_type' : options[ '--run-type' ] + , 'ftp_proxy' : options[ '--ftp-proxy' ] + , 'debug_level' : int(options[ '--debug-level' ]) + , 'send_bjam_log' : options.has_key( '--send-bjam-log' ) + } + + +commands = { + 'collect-and-upload' : collect_and_upload_logs + , 'collect-logs' : collect_logs + , 'upload-logs' : upload_logs + } + +def usage(): + print 'Usage: %s [command] [options]' % os.path.basename( sys.argv[0] ) + print ''' +Commands: +\t%s + +Options: +\t--locate-root directory to to scan for "test_log.xml" files +\t--runner runner ID (e.g. "Metacomm") +\t--timestamp path to a file which modification time will be used +\t as a timestamp of the run ("timestamp" by default) +\t--comment an HTML comment file to be inserted in the reports +\t ("comment.html" by default) +\t--tag the tag for the results ("CVS-HEAD" by default) +\t--user SourceForge user name for a shell account (optional) +\t--source where Boost sources came from (e.g. "CVS", "tarball", +\t "anonymous CVS"; "CVS" by default) +\t--run-type "incremental" or "full" ("full" by default) +\t--send-bjam-log in addition to regular XML results, send in full bjam +\t log of the regression run +\t--ftp-proxy FTP proxy server (e.g. 'ftpproxy', optional) +\t--debug-level debugging level; controls the amount of debugging +\t output printed; 0 by default (no debug output) +''' % '\n\t'.join( commands.keys() ) + + +def main(): + if len(sys.argv) > 1 and sys.argv[1] in commands: + command = sys.argv[1] + args = sys.argv[ 2: ] + else: + command = 'collect-and-upload' + args = sys.argv[ 1: ] + + commands[ command ]( **accept_args( args ) ) + + +if __name__ != '__main__': import utils +else: + # in absense of relative import... + xsl_path = os.path.abspath( os.path.dirname( sys.argv[ 0 ] ) ) + while os.path.basename( xsl_path ) != 'xsl_reports': xsl_path = os.path.dirname( xsl_path ) + sys.path.append( xsl_path ) + + import utils + main() diff --git a/tools/regression/xsl_reports/runner/default.css b/tools/regression/xsl_reports/runner/default.css new file mode 100644 index 0000000000..e713c4a3b2 --- /dev/null +++ b/tools/regression/xsl_reports/runner/default.css @@ -0,0 +1,235 @@ +/* +:Author: David Goodger +:Contact: goodger@users.sourceforge.net +:date: $Date$ +:version: $Revision$ +:copyright: This stylesheet has been placed in the public domain. + +Default cascading style sheet for the HTML output of Docutils. +*/ + +body { + background-color: #fffff5; +} + +h2 { + text-decoration: underline; +} + +.first { + margin-top: 0 } + +.last { + margin-bottom: 0 } + +a.toc-backref { + text-decoration: none ; + color: black } + +blockquote.epigraph { + margin: 2em 5em ; } + +dd { + margin-bottom: 0.5em } + +div.abstract { + margin: 2em 5em } + +div.abstract p.topic-title { + font-weight: bold ; + text-align: center } + +div.attention, div.caution, div.danger, div.error, div.hint, +div.important, div.note, div.tip, div.warning, div.admonition { + margin: 2em ; + border: medium outset ; + padding: 1em } + +div.attention p.admonition-title, div.caution p.admonition-title, +div.danger p.admonition-title, div.error p.admonition-title, +div.warning p.admonition-title { + color: red ; + font-weight: bold ; + font-family: sans-serif } + +div.hint p.admonition-title, div.important p.admonition-title, +div.note p.admonition-title, div.tip p.admonition-title, +div.admonition p.admonition-title { + font-weight: bold ; + font-family: sans-serif } + +div.dedication { + margin: 2em 5em ; + text-align: center ; + font-style: italic } + +div.dedication p.topic-title { + font-weight: bold ; + font-style: normal } + +div.figure { + margin-left: 2em } + +div.footer, div.header { + font-size: smaller } + +div.sidebar { + margin-left: 1em ; + border: medium outset ; + padding: 0em 1em ; + background-color: #ffffee ; + width: 40% ; + float: right ; + clear: right } + +div.sidebar p.rubric { + font-family: sans-serif ; + font-size: medium } + +div.system-messages { + margin: 5em } + +div.system-messages h1 { + color: red } + +div.system-message { + border: medium outset ; + padding: 1em } + +div.system-message p.system-message-title { + color: red ; + font-weight: bold } + +div.topic { + margin: 2em } + +h1.title { + text-align: center } + +h2.subtitle { + text-align: center } + +hr { + width: 75% } + +ol.simple, ul.simple { + margin-bottom: 1em } + +ol.arabic { + list-style: decimal } + +ol.loweralpha { + list-style: lower-alpha } + +ol.upperalpha { + list-style: upper-alpha } + +ol.lowerroman { + list-style: lower-roman } + +ol.upperroman { + list-style: upper-roman } + +p.attribution { + text-align: right ; + margin-left: 50% } + +p.caption { + font-style: italic } + +p.credits { + font-style: italic ; + font-size: smaller } + +p.label { + white-space: nowrap } + +p.rubric { + font-weight: bold ; + font-size: larger ; + color: maroon ; + text-align: center } + +p.sidebar-title { + font-family: sans-serif ; + font-weight: bold ; + font-size: larger } + +p.sidebar-subtitle { + font-family: sans-serif ; + font-weight: bold } + +p.topic-title { + font-weight: bold } + +pre.address { + margin-bottom: 0 ; + margin-top: 0 ; + font-family: serif ; + font-size: 100% } + +pre.line-block { + font-family: serif ; + font-size: 100% } + +pre.literal-block, pre.doctest-block { + margin-left: 2em ; + margin-right: 2em ; + background-color: #eeeeee } + +span.classifier { + font-family: sans-serif ; + font-style: oblique } + +span.classifier-delimiter { + font-family: sans-serif ; + font-weight: bold } + +span.interpreted { + font-family: sans-serif } + +span.option { + white-space: nowrap } + +span.option-argument { + font-style: italic } + +span.pre { + white-space: pre } + +span.problematic { + color: red } + +table { + margin-top: 0.5em ; + margin-bottom: 0.5em } + +table.citation { + border-left: solid thin gray ; + padding-left: 0.5ex } + +table.docinfo { + margin: 2em 4em } + +table.footnote { + border-left: solid thin black ; + padding-left: 0.5ex } + +td, th { + padding-left: 0.5em ; + padding-right: 0.5em ; + vertical-align: top } + +th.docinfo-name, th.field-name { + font-weight: bold ; + text-align: left ; + white-space: nowrap } + +h1 tt, h2 tt, h3 tt, h4 tt, h5 tt, h6 tt { + font-size: 100% } + +tt { + background-color: #eeeeee } + +ul.auto-toc { + list-style-type: none } diff --git a/tools/regression/xsl_reports/runner/instructions.html b/tools/regression/xsl_reports/runner/instructions.html new file mode 100644 index 0000000000..10ca054932 --- /dev/null +++ b/tools/regression/xsl_reports/runner/instructions.html @@ -0,0 +1,525 @@ + + + + + + +Running Boost Regression Tests + + + +
+

Running Boost Regression Tests

+
+

Requirements

+
    +
  • Python 2.3 or higher
    • +
  • Some spare disk space (~5 Gb per each tested compiler)
    • +
+

That's it! You don't even need a CVS client installed.

+
+
+

Installation

+
    +
  • Download regression driver regression.py from here (http://tinyurl.com/uufav) +and put it in the directory where you want all the regression +test files to be placed.
    • +
+
    +

  • Optional: If you already have bjam and/or process_jam_log executables +you'd like to use, just put them in the same directory with regression.py, e.g.:

    +
    +my_boost_regressions/
+    regression.py
+    bjam[.exe]
+
    +
    • +
+
+
+

Running tests

+

To start a regression run, simply run regression.py providing it with the following +two arguments:

+
    +
  • runner id (something unique of your choice that will identify your +results in the reports [1], [2])
    • +
  • a particular set of toolsets you want to test with [3].
    • +
+

For example:

+
+python regression.py --runner=Metacomm --toolsets=gcc,vc7
+
+

If you are interested in seeing all available options, run python regression.py +or python regression.py --help. See also the Advanced use section below.

+

Note: If you are behind a firewall/proxy server, everything should still "just work". +In the rare cases when it doesn't, you can explicitly specify the proxy server +parameters through the --proxy option, e.g.:

+
+python regression.py ... --proxy=http://www.someproxy.com:3128
+
+
+
+

Details

+

The regression run procedure will:

+ +

The report merger process running continuously on MetaCommunications site will +merge all submitted test runs and publish them at +http://boost.sourceforge.net/regression-logs/developer.

+
+
+

Advanced use

+
+

Providing detailed information about your environment

+

Once you have your regression results displayed in the Boost-wide +reports, you may consider providing a bit more information about +yourself and your test environment. This additional information will +be presented in the reports on a page associated with your runner ID.

+

By default, the page's content is just a single line coming from the +comment.html file in your regression.py directory, specifying +the tested platform. You can put online a more detailed description of +your environment, such as your hardware configuration, compiler builds, +and test schedule, by simply altering the file's content. Also, please +consider providing your name and email address for cases where Boost +developers have questions specific to your particular set of results.

+
+
+

Incremental runs

+

You can run regression.py in incremental mode [4] by simply passing +it an identically named command-line flag:

+
+python regression.py ... --incremental
+
+
+
+

Dealing with misbehaved tests/compilers

+

Depending on the environment/C++ runtime support library the test is compiled with, +a test failure/termination may cause an appearance of a dialog window, requiring +human intervention to proceed. Moreover, the test (or even of the compiler itself) +can fall into infinite loop, or simply run for too long. To allow regression.py +to take care of these obstacles, add the --monitored flag to the script +invocation:

+
+python regression.py ... --monitored
+
+

That's it. Knowing your intentions, the script will be able to automatically deal +with the listed issues [5].

+
+
+

Getting sources from CVS

+

If you already have a CVS client installed and configured, you might prefer to get +the sources directly from the Boost CVS repository. To communicate this to the +script, you just need to pass it your SourceForge user ID using the --user +option; for instance:

+
+python regression.py ... --user=agurtovoy
+
+

You can also specify the user as anonymous, requesting anonymous CVS access. +Note, though, that the files obtained this way tend to lag behind the actual CVS +state by several hours, sometimes up to twelve. By contrast, the tarball the script +downloads by default is at most one hour behind.

+
+
+

Integration with a custom driver script

+

Even if you've already been using a custom driver script, and for some +reason you don't want regression.py to take over of the entire test cycle, +getting your regression results into Boost-wide reports is still easy!

+

In fact, it's just a matter of modifying your script to perform two straightforward +operations:

+
    +

  1. Timestamp file creation needs to be done before the CVS update/checkout. +The file's location doesn't matter (nor does the content), as long as you know how +to access it later. Making your script to do something as simple as +echo >timestamp would work just fine.

    +
    2. +

  2. Collecting and uploading logs can be done any time after process_jam_log' s +run, and is as simple as an invocation of the local copy of +$BOOST_ROOT/tools/regression/xsl_reports/runner/collect_and_upload_logs.py +script that was just obtained from the CVS with the rest of the sources. +You'd need to provide collect_and_upload_logs.py with the following three +arguments:

    +
    +--locate-root   directory to to scan for "test_log.xml" files
+--runner        runner ID (e.g. "Metacomm")
+--timestamp     path to a file which modification time will be used
+                as a timestamp of the run ("timestamp" by default)
+
    +

    For example, assuming that the run's resulting binaries are in the +$BOOST_ROOT/bin directory (the default Boost.Build setup), the +collect_and_upload_logs.py invocation might look like this:

    +
    +python $BOOST_ROOT/tools/regression/xsl_reports/runner/collect_and_upload_logs.py
+   --locate-root=$BOOST_ROOT/bin
+   --runner=Metacomm
+   --timestamp=timestamp
+
    +
    3. +
+
+
+

Patching Boost sources

+

You might encounter an occasional need to make local modifications to +the Boost codebase before running the tests, without disturbing the +automatic nature of the regression process. To implement this under +regression.py:

+
    +
  1. Codify applying the desired modifications to the sources +located in the ./boost subdirectory in a single executable +script named patch_boost (patch_boost.bat on Windows).
    2. +
  2. Place the script in the regression.py directory.
    3. +
+

The driver will check for the existence of the patch_boost script, +and, if found, execute it after obtaining the Boost sources.

+
+
+
+

Feedback

+

Please send all comments/suggestions regarding this document and the testing procedure +itself to the Boost Testing list.

+
+
+

Notes

+ + + + + +
[1]If you are running regressions interlacingly with a different +set of compilers (e.g. for Intel in the morning and GCC at the end of the day), you need +to provide a different runner id for each of these runs, e.g. your_name-intel, and +your_name-gcc.
+ + + + + +
[2]The limitations of the reports' format/medium impose a direct dependency +between the number of compilers you are testing with and the amount of space available +for your runner id. If you are running regressions for a single compiler, please make +sure to choose a short enough id that does not significantly disturb the reports' layout.
+ + + + + +
[3]If --toolsets option is not provided, the script will try to use the +platform's default toolset (gcc for most Unix-based systems).
+ + + + + +
[4]

By default, the script runs in what is known as full mode: on +each regression.py invocation all the files that were left in place by the +previous run -- including the binaries for the successfully built tests and libraries +-- are deleted, and everything is rebuilt once again from scratch. By contrast, in +incremental mode the already existing binaries are left intact, and only the +tests and libraries which source files has changed since the previous run are +re-built and re-tested.

+

The main advantage of incremental runs is a significantly shorter turnaround time, +but unfortunately they don't always produce reliable results. Some type of changes +to the codebase (changes to the bjam testing subsystem in particular) +often require switching to a full mode for one cycle in order to produce +trustworthy reports.

+

As a general guideline, if you can afford it, testing in full mode is preferable.

+
+ + + + + +
[5]Note that at the moment this functionality is available only if you +are running on a Windows platform. Contributions are welcome!
+
+
+ + diff --git a/tools/regression/xsl_reports/runner/instructions.rst b/tools/regression/xsl_reports/runner/instructions.rst new file mode 100644 index 0000000000..1ab54a61db --- /dev/null +++ b/tools/regression/xsl_reports/runner/instructions.rst @@ -0,0 +1,252 @@ +Running Boost Regression Tests +============================== + + +Requirements +------------ + +* Python 2.3 or higher +* Some spare disk space (~5 Gb per each tested compiler) + +That's it! You don't even need a CVS client installed. + +Installation +------------ + +* Download regression driver ``regression.py`` from here__ (http://tinyurl.com/uufav) + and put it in the directory where you want all the regression + test files to be placed. + +__ http://boost.cvs.sourceforge.net/*checkout*/boost/boost/tools/regression/xsl_reports/runner/regression.py + + +* **Optional**: If you already have ``bjam`` and/or ``process_jam_log`` executables + you'd like to use, just put them in the same directory with ``regression.py``, e.g.: + + .. parsed-literal:: + + my_boost_regressions/ + regression.py + bjam\ *[.exe]* + + +Running tests +------------- + +To start a regression run, simply run ``regression.py`` providing it with the following +two arguments: + +- runner id (something unique of your choice that will identify your + results in the reports [#runnerid1]_, [#runnerid2]_) + +- a particular set of toolsets you want to test with [#toolsets]_. + +For example:: + + python regression.py --runner=Metacomm --toolsets=gcc,vc7 + + +If you are interested in seeing all available options, run ``python regression.py`` +or ``python regression.py --help``. See also the `Advanced use`_ section below. + +**Note**: If you are behind a firewall/proxy server, everything should still "just work". +In the rare cases when it doesn't, you can explicitly specify the proxy server +parameters through the ``--proxy`` option, e.g.: + +.. parsed-literal:: + + python regression.py ... **--proxy=http://www.someproxy.com:3128** + + +Details +------- + +The regression run procedure will: + +* Download the most recent tarball from http://www.meta-comm.com/engineering/boost/snapshot/, + unpack it in the subdirectory ``boost``. + +* Build ``bjam`` and ``process_jam_log`` if needed. (``process_jam_log`` is an + utility, which extracts the test results from the log file produced by + Boost.Build). + +* Run regression tests, process and collect the results. + +* Upload the results to ftp://fx.meta-comm.com/boost-regression. + + +The report merger process running continuously on MetaCommunications site will +merge all submitted test runs and publish them at +http://boost.sourceforge.net/regression-logs/developer. + + +Advanced use +------------ + +Providing detailed information about your environment +..................................................... + +Once you have your regression results displayed in the Boost-wide +reports, you may consider providing a bit more information about +yourself and your test environment. This additional information will +be presented in the reports on a page associated with your runner ID. + +By default, the page's content is just a single line coming from the +``comment.html`` file in your ``regression.py`` directory, specifying +the tested platform. You can put online a more detailed description of +your environment, such as your hardware configuration, compiler builds, +and test schedule, by simply altering the file's content. Also, please +consider providing your name and email address for cases where Boost +developers have questions specific to your particular set of results. + + +Incremental runs +................ + +You can run ``regression.py`` in incremental mode [#incremental]_ by simply passing +it an identically named command-line flag: + +.. parsed-literal:: + + python regression.py ... **--incremental** + + +Dealing with misbehaved tests/compilers +....................................... + +Depending on the environment/C++ runtime support library the test is compiled with, +a test failure/termination may cause an appearance of a dialog window, requiring +human intervention to proceed. Moreover, the test (or even of the compiler itself) +can fall into infinite loop, or simply run for too long. To allow ``regression.py`` +to take care of these obstacles, add the ``--monitored`` flag to the script +invocation: + +.. parsed-literal:: + + python regression.py ... **--monitored** + + +That's it. Knowing your intentions, the script will be able to automatically deal +with the listed issues [#monitored]_. + + +Getting sources from CVS +........................ + +If you already have a CVS client installed and configured, you might prefer to get +the sources directly from the Boost CVS repository. To communicate this to the +script, you just need to pass it your SourceForge user ID using the ``--user`` +option; for instance: + +.. parsed-literal:: + + python regression.py ... **--user=agurtovoy** + +You can also specify the user as ``anonymous``, requesting anonymous CVS access. +Note, though, that the files obtained this way tend to lag behind the actual CVS +state by several hours, sometimes up to twelve. By contrast, the tarball the script +downloads by default is at most one hour behind. + + +Integration with a custom driver script +....................................... + +Even if you've already been using a custom driver script, and for some +reason you don't want ``regression.py`` to take over of the entire test cycle, +getting your regression results into `Boost-wide reports`__ is still easy! + +In fact, it's just a matter of modifying your script to perform two straightforward +operations: + +1. *Timestamp file creation* needs to be done before the CVS update/checkout. + The file's location doesn't matter (nor does the content), as long as you know how + to access it later. Making your script to do something as simple as + ``echo >timestamp`` would work just fine. + +2. *Collecting and uploading logs* can be done any time after ``process_jam_log``' s + run, and is as simple as an invocation of the local copy of + ``$BOOST_ROOT/tools/regression/xsl_reports/runner/collect_and_upload_logs.py`` + script that was just obtained from the CVS with the rest of the sources. + You'd need to provide ``collect_and_upload_logs.py`` with the following three + arguments:: + + --locate-root directory to to scan for "test_log.xml" files + --runner runner ID (e.g. "Metacomm") + --timestamp path to a file which modification time will be used + as a timestamp of the run ("timestamp" by default) + + For example, assuming that the run's resulting binaries are in the + ``$BOOST_ROOT/bin`` directory (the default Boost.Build setup), the + ``collect_and_upload_logs.py`` invocation might look like this:: + + python $BOOST_ROOT/tools/regression/xsl_reports/runner/collect_and_upload_logs.py + --locate-root=$BOOST_ROOT/bin + --runner=Metacomm + --timestamp=timestamp + + +__ http://www.boost.org/regression-logs/developer/ + + +Patching Boost sources +...................... + +You might encounter an occasional need to make local modifications to +the Boost codebase before running the tests, without disturbing the +automatic nature of the regression process. To implement this under +``regression.py``: + +1. Codify applying the desired modifications to the sources + located in the ``./boost`` subdirectory in a single executable + script named ``patch_boost`` (``patch_boost.bat`` on Windows). + +2. Place the script in the ``regression.py`` directory. + +The driver will check for the existence of the ``patch_boost`` script, +and, if found, execute it after obtaining the Boost sources. + + +Feedback +-------- + +Please send all comments/suggestions regarding this document and the testing procedure +itself to the `Boost Testing list`__. + +__ http://lists.boost.org/mailman/listinfo.cgi/boost-testing + + +Notes +----- + +.. [#runnerid1] If you are running regressions interlacingly with a different + set of compilers (e.g. for Intel in the morning and GCC at the end of the day), you need + to provide a *different* runner id for each of these runs, e.g. ``your_name-intel``, and + ``your_name-gcc``. + +.. [#runnerid2] The limitations of the reports' format/medium impose a direct dependency + between the number of compilers you are testing with and the amount of space available + for your runner id. If you are running regressions for a single compiler, please make + sure to choose a short enough id that does not significantly disturb the reports' layout. + +.. [#toolsets] If ``--toolsets`` option is not provided, the script will try to use the + platform's default toolset (``gcc`` for most Unix-based systems). + +.. [#incremental] By default, the script runs in what is known as *full mode*: on + each ``regression.py`` invocation all the files that were left in place by the + previous run -- including the binaries for the successfully built tests and libraries + -- are deleted, and everything is rebuilt once again from scratch. By contrast, in + *incremental mode* the already existing binaries are left intact, and only the + tests and libraries which source files has changed since the previous run are + re-built and re-tested. + + The main advantage of incremental runs is a significantly shorter turnaround time, + but unfortunately they don't always produce reliable results. Some type of changes + to the codebase (changes to the bjam testing subsystem in particular) + often require switching to a full mode for one cycle in order to produce + trustworthy reports. + + As a general guideline, if you can afford it, testing in full mode is preferable. + +.. [#monitored] Note that at the moment this functionality is available only if you + are running on a Windows platform. Contributions are welcome! + diff --git a/tools/regression/xsl_reports/runner/regression.py b/tools/regression/xsl_reports/runner/regression.py new file mode 100644 index 0000000000..1e53435344 --- /dev/null +++ b/tools/regression/xsl_reports/runner/regression.py @@ -0,0 +1,1005 @@ +#!/usr/bin/python + +# Copyright (c) MetaCommunications, Inc. 2003-2007 +# +# 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) + +import urllib +import tarfile +import socket +import time +import getopt +import glob +import shutil +import stat +import os.path +import os +import platform +import traceback +import string +import sys + +regression_root = os.path.abspath( os.path.dirname( sys.argv[0] ) ) +regression_results = os.path.join( regression_root, 'results' ) +regression_log = os.path.join( regression_results, 'bjam.log' ) +install_log = os.path.join( regression_results, 'bjam_install.log' ) +boostbook_log = os.path.join( regression_results, 'boostbook.log' ) +boostbook_archive_name = os.path.join( regression_results, 'boostbook.zip' ) + +boost_root = os.path.join( regression_root, 'boost' ) +xsl_reports_dir = os.path.join( boost_root, 'tools', 'regression', 'xsl_reports' ) +timestamp_path = os.path.join( regression_root, 'timestamp' ) + +cvs_command_line = 'cvs -z9 %(command)s' +cvs_ext_command_line = 'cvs -d:ext:%(user)s@boost.cvs.sourceforge.net:/cvsroot/boost -z9 %(command)s' +cvs_pserver_command_line = 'cvs -d:pserver:%(user)s@boost.cvs.sourceforge.net:/cvsroot/boost -z9 %(command)s' + +bjam = {} +process_jam_log = {} + + +if sys.platform == 'win32': + bjam[ 'name' ] = 'bjam.exe' + bjam[ 'build_cmd' ] = lambda toolset, v2: bjam_build_script_cmd( 'build.bat %s' % toolset ) + bjam[ 'is_supported_toolset' ] = lambda x: x in [ 'borland', 'como', 'gcc', 'gcc-nocygwin' \ + , 'intel-win32', 'metrowerks', 'mingw' \ + , 'msvc', 'vc7' \ + ] + process_jam_log[ 'name' ] = 'process_jam_log.exe' + + def default_toolset(v2): + if v2: + return 'msvc' + else: + return 'vc-7_1' + + process_jam_log[ 'default_toolset' ] = default_toolset + patch_boost_name = 'patch_boost.bat' +else: + bjam[ 'name' ] = 'bjam' + bjam[ 'build_cmd' ] = lambda toolset, v2: bjam_build_script_cmd( './build.sh %s' % toolset ) + bjam[ 'is_supported_toolset' ] = lambda x: x in [ 'acc', 'como', 'darwin', 'gcc' \ + , 'intel-linux', 'kcc', 'kylix' \ + , 'mipspro', 'sunpro', 'tru64cxx' \ + , 'vacpp'\ + ] + process_jam_log[ 'name' ] = 'process_jam_log' + process_jam_log[ 'default_toolset' ] = lambda x: 'gcc' + patch_boost_name = 'patch_boost' + +bjam[ 'default_toolset' ] = lambda x: '' +bjam[ 'path' ] = os.path.join( regression_root, bjam[ 'name' ] ) +bjam[ 'source_dir' ] = os.path.join( boost_root, 'tools', 'jam', 'src' ) +bjam[ 'build_path_root' ] = lambda unused: bjam[ 'source_dir' ] + +process_jam_log[ 'path' ] = os.path.join( regression_root, process_jam_log[ 'name' ] ) +process_jam_log[ 'source_dir' ] = os.path.join( boost_root, 'tools', 'regression', 'build' ) + + +def process_jam_build_root(v2): + if v2: + return os.path.join(boost_root, 'dist', 'bin') + else: + return os.path.join( + boost_root, 'bin', 'boost', 'tools', 'regression', 'build' + , process_jam_log[ 'name' ]) + + +process_jam_log[ 'build_path_root' ] = process_jam_build_root + +process_jam_log[ 'build_cmd' ] = lambda toolset, v2: bjam_command( toolset, v2 ) +process_jam_log[ 'is_supported_toolset' ] = lambda x : True + +build_monitor_url = 'http://engineering.meta-comm.com/resources/build_monitor.zip' +pskill_url = 'http://www.sysinternals.com/files/pskill.zip' + +utils = None + + +def log( message ): + sys.stdout.flush() + sys.stderr.flush() + sys.stderr.write( '# %s\n' % message ) + sys.stderr.flush() + + +def platform_name(): + # See http://article.gmane.org/gmane.comp.lib.boost.testing/933 + if sys.platform == 'win32': + return 'Windows' + elif sys.platform == 'cygwin': + return 'Windows/Cygwin' + + return platform.system() + + +def rmtree( path ): + if os.path.exists( path ): + if sys.platform == 'win32': + os.system( 'del /f /s /q "%s" >nul 2>&1' % path ) + shutil.rmtree( unicode( path ) ) + else: + os.system( 'rm -f -r "%s"' % path ) + + +def retry( f, args, max_attempts=5, sleep_secs=10 ): + for attempts in range( max_attempts, -1, -1 ): + try: + return f( *args ) + except Exception, msg: + log( '%s failed with message "%s"' % ( f.__name__, msg ) ) + if attempts == 0: + log( 'Giving up.' ) + raise + + log( 'Retrying (%d more attempts).' % attempts ) + time.sleep( sleep_secs ) + + +def cleanup( args, **unused ): + if args == []: args = [ 'source', 'bin' ] + + if 'source' in args: + log( 'Cleaning up "%s" directory ...' % boost_root ) + rmtree( boost_root ) + + if 'bin' in args: + boost_bin_dir = os.path.join( boost_root, 'bin' ) + log( 'Cleaning up "%s" directory ...' % boost_bin_dir ) + rmtree( boost_bin_dir ) + + boost_binv2_dir = os.path.join( boost_root, 'bin.v2' ) + log( 'Cleaning up "%s" directory ...' % boost_binv2_dir ) + rmtree( boost_binv2_dir ) + + log( 'Cleaning up "%s" directory ...' % regression_results ) + rmtree( regression_results ) + + +def http_get( source_url, destination, proxy ): + if proxy is None: proxies = None + else: proxies = { 'http' : proxy } + + src = urllib.urlopen( source_url, proxies = proxies ) + + f = open( destination, 'wb' ) + while True: + data = src.read( 16*1024 ) + if len( data ) == 0: break + f.write( data ) + + f.close() + src.close() + + +def tarball_name_for_tag( tag, timestamp = False ): + if not timestamp: return 'boost-%s.tar.bz2' % tag + else: return 'boost-%s.timestamp' % tag + + +def download_boost_tarball( destination, tag, proxy, timestamp_only = False ): + tarball_name = tarball_name_for_tag( tag, timestamp_only ) + tarball_path = os.path.join( destination, tarball_name ) + tarball_url = 'http://engineering.meta-comm.com/boost/snapshot/%s' % tarball_name + + log( 'Downloading "%s" to "%s"...' % ( tarball_url, os.path.dirname( tarball_path ) ) ) + if os.path.exists( tarball_path ): + os.unlink( tarball_path ) + + http_get( + tarball_url + , tarball_path + , proxy + ) + + return tarball_path + + +def find_boost_dirs( path ): + return [ x for x in glob.glob( os.path.join( path, 'boost[-_]*' ) ) + if os.path.isdir( x ) ] + + +def unpack_tarball( tarball_path, destination ): + log( 'Looking for old unpacked archives...' ) + old_boost_dirs = find_boost_dirs( destination ) + + for old_boost_dir in old_boost_dirs: + if old_boost_dir != tarball_path: + log( 'Deleting old directory %s.' % old_boost_dir ) + rmtree( old_boost_dir ) + + log( 'Unpacking boost tarball ("%s")...' % tarball_path ) + + tarball_name = os.path.basename( tarball_path ) + extension = tarball_name[ tarball_name.find( '.' ) : ] + + if extension in ( ".tar.gz", ".tar.bz2" ): + mode = os.path.splitext( extension )[1][1:] + tar = tarfile.open( tarball_path, 'r:%s' % mode ) + for tarinfo in tar: + tar.extract( tarinfo, destination ) + if sys.platform == 'win32' and not tarinfo.isdir(): + # workaround what appears to be a Win32-specific bug in 'tarfile' + # (modification times for extracted files are not set properly) + f = os.path.join( destination, tarinfo.name ) + os.chmod( f, stat.S_IWRITE ) + os.utime( f, ( tarinfo.mtime, tarinfo.mtime ) ) + tar.close() + elif extension in ( ".zip" ): + import zipfile + + z = zipfile.ZipFile( tarball_path, 'r', zipfile.ZIP_DEFLATED ) + for f in z.infolist(): + destination_file_path = os.path.join( destination, f.filename ) + if destination_file_path[-1] == "/": # directory + if not os.path.exists( destination_file_path ): + os.makedirs( destination_file_path ) + else: # file + result = open( destination_file_path, 'wb' ) + result.write( z.read( f.filename ) ) + result.close() + z.close() + else: + raise 'Do not know how to unpack archives with extension \"%s\"' % extension + + boost_dir = find_boost_dirs( destination )[0] + log( ' Unpacked into directory "%s"' % boost_dir ) + + if os.path.exists( boost_root ): + log( 'Deleting "%s" directory...' % boost_root ) + rmtree( boost_root ) + + log( 'Renaming "%s" into "%s"' % ( boost_dir, boost_root ) ) + os.rename( boost_dir, boost_root ) + + +def cvs_command( user, command ): + if user is None: + cmd = cvs_command_line % { 'command': command } + elif user == 'anonymous': + cmd = cvs_pserver_command_line % { 'user': user, 'command': command } + else: + cmd = cvs_ext_command_line % { 'user': user, 'command': command } + + log( 'Executing CVS command "%s"' % cmd ) + rc = os.system( cmd ) + if rc != 0: + raise Exception( 'CVS command "%s" failed with code %d' % ( cmd, rc ) ) + + +def cvs_checkout( user, tag, args ): + if tag != 'CVS-HEAD': + command = 'checkout -r %s boost' % tag + else: + command = 'checkout boost' + + os.chdir( regression_root ) + cvs_command( user, command ) + + +def cvs_update( user, tag, args ): + if tag != 'CVS-HEAD': + command = 'update -dPA -r %s' % tag + else: + command = 'update -dPA' + + os.chdir( os.path.join( regression_root, 'boost' ) ) + cvs_command( user, command ) + + +def format_time( t ): + return time.strftime( + '%a, %d %b %Y %H:%M:%S +0000' + , t + ) + + +def refresh_timestamp(): + if os.path.exists( timestamp_path ): + os. unlink( timestamp_path ) + + open( timestamp_path, 'w' ).close() + + +def timestamp(): + return time.strftime( + '%Y-%m-%dT%H:%M:%SZ' + , time.gmtime( os.stat( timestamp_path ).st_mtime ) + ) + + +def get_tarball( tag, proxy, args, **unused ): + if args == []: args = [ 'download', 'unpack' ] + + tarball_path = None + + if 'download' in args: + tarball_path = download_boost_tarball( regression_root, tag, proxy ) + + if 'unpack' in args: + if not tarball_path: + tarball_path = os.path.join( regression_root, tarball_name_for_tag( tag ) ) + unpack_tarball( tarball_path, regression_root ) + + +def get_source( user, tag, proxy, args, **unused ): + refresh_timestamp() + log( 'Getting sources (%s)...' % timestamp() ) + + if user is not None: + retry( + cvs_checkout + , ( user, tag, args ) + ) + else: + retry( + get_tarball + , ( tag, proxy, args ) + ) + + +def update_source( user, tag, proxy, args, **unused ): + if user is not None or os.path.exists( os.path.join( boost_root, 'CVS' ) ): + open( timestamp_path, 'w' ).close() + log( 'Updating sources from CVS (%s)...' % timestamp() ) + retry( + cvs_update + , ( user, tag, args ) + ) + else: + get_source( user, tag, proxy, args ) + + +def tool_path( name_or_spec, v2=None ): + if isinstance( name_or_spec, basestring ): + return os.path.join( regression_root, name_or_spec ) + + if os.path.exists( name_or_spec[ 'path' ] ): + return name_or_spec[ 'path' ] + + if name_or_spec.has_key( 'build_path' ): + return name_or_spec[ 'build_path' ] + + build_path_root = name_or_spec[ 'build_path_root' ]( v2 ) + log( 'Searching for "%s" in "%s"...' % ( name_or_spec[ 'name' ], build_path_root ) ) + for root, dirs, files in os.walk( build_path_root ): + if name_or_spec[ 'name' ] in files: + return os.path.join( root, name_or_spec[ 'name' ] ) + + raise Exception( 'Cannot find "%s" in any of the following locations:\n%s' % ( + name_or_spec[ 'name' ] + , '\n'.join( [ name_or_spec[ 'path' ], build_path_root ] ) + ) ) + + +def build_if_needed( tool, toolset, toolsets, v2 ): + if os.path.exists( tool[ 'path' ] ): + log( 'Found preinstalled "%s"; will use it.' % tool[ 'path' ] ) + return + + log( 'Preinstalled "%s" is not found; building one...' % tool[ 'path' ] ) + + if toolset is None: + if toolsets is not None: + toolset = string.split( toolsets, ',' )[0] + if not tool[ 'is_supported_toolset' ]( toolset ): + log( 'Warning: Specified toolset (%s) cannot be used to bootstrap "%s".'\ + % ( toolset, tool[ 'name' ] ) ) + + toolset = tool[ 'default_toolset' ](v2) + log( ' Using default toolset for the platform (%s).' % toolset ) + else: + toolset = tool[ 'default_toolset' ](v2) + log( 'Warning: No bootstrap toolset for "%s" was specified.' % tool[ 'name' ] ) + log( ' Using default toolset for the platform (%s).' % toolset ) + + if os.path.exists( tool[ 'source_dir' ] ): + log( 'Found "%s" source directory "%s"' % ( tool[ 'name' ], tool[ 'source_dir' ] ) ) + build_cmd = tool[ 'build_cmd' ]( toolset, v2 ) + log( 'Building "%s" (%s)...' % ( tool[ 'name'], build_cmd ) ) + utils.system( [ + 'cd "%s"' % tool[ 'source_dir' ] + , build_cmd + ] ) + else: + raise 'Could not find "%s" source directory "%s"' % ( tool[ 'name' ], tool[ 'source_dir' ] ) + + if not tool.has_key( 'build_path' ): + tool[ 'build_path' ] = tool_path( tool, v2 ) + + if not os.path.exists( tool[ 'build_path' ] ): + raise 'Failed to find "%s" after build.' % tool[ 'build_path' ] + + log( '%s succesfully built in "%s" location' % ( tool[ 'name' ], tool[ 'build_path' ] ) ) + + +def import_utils(): + global utils + if utils is None: + sys.path.append( xsl_reports_dir ) + import utils as utils_module + utils = utils_module + + +def download_if_needed( tool_name, tool_url, proxy ): + path = tool_path( tool_name ) + if not os.path.exists( path ): + log( 'Preinstalled "%s" is not found.' % path ) + log( ' Downloading from %s...' % tool_url ) + + zip_path = '%s.zip' % os.path.splitext( path )[0] + http_get( tool_url, zip_path, proxy ) + + log( ' Unzipping %s...' % path ) + utils.unzip( zip_path, os.path.dirname( path ) ) + + log( ' Removing %s...' % zip_path ) + os.unlink( zip_path ) + log( 'Done.' ) + + +def setup( + comment + , toolsets + , book + , bjam_toolset + , pjl_toolset + , monitored + , proxy + , v2 + , args + , **unused + ): + import_utils() + + patch_boost_path = os.path.join( regression_root, patch_boost_name ) + if os.path.exists( patch_boost_path ): + log( 'Found patch file "%s". Executing it.' % patch_boost_path ) + os.chdir( regression_root ) + utils.system( [ patch_boost_path ] ) + + build_if_needed( bjam, bjam_toolset, toolsets, v2 ) + build_if_needed( process_jam_log, pjl_toolset, toolsets, v2 ) + + if monitored: + if sys.platform == 'win32': + download_if_needed( 'build_monitor.exe', build_monitor_url, proxy ) + download_if_needed( 'pskill.exe', pskill_url, proxy ) + else: + log( 'Warning: Test monitoring is not supported on this platform (yet).' ) + log( ' Please consider contributing this piece!' ) + +def bjam_build_script_cmd( cmd ): + env_setup_key = 'BJAM_ENVIRONMENT_SETUP' + if os.environ.has_key( env_setup_key ): + return '%s & %s' % ( os.environ[env_setup_key], cmd ) + + return cmd + + +def bjam_command( toolsets, v2 ): + build_path = regression_root + if build_path[-1] == '\\': build_path += '\\' + v2_option = "" + if v2: + v2_option = "--v2" + result = '"%s" %s "-sBOOST_BUILD_PATH=%s" "-sBOOST_ROOT=%s"'\ + % ( + tool_path( bjam, v2 ) + , v2_option + , build_path + , boost_root + ) + + if not toolsets is None: + if v2: + result += ' ' + string.join(string.split( toolsets, ',' ), ' ' ) + else: + result += ' "-sTOOLS=%s"' % string.join( string.split( toolsets, ',' ), ' ' ) + + return result + + +def install( toolsets, v2, **unused ): + import_utils() + os.chdir( os.path.join( boost_root ) ) + + log( 'Making "%s" directory...' % regression_results ) + utils.makedirs( regression_results ) + + install_cmd = '%s -d2 install >>%s 2>&1' % ( bjam_command( toolsets, v2 ), install_log ) + log( 'Installing libraries (%s)...' % install_cmd ) + utils.system( [ install_cmd ] ) + + +def start_build_monitor( timeout ): + if sys.platform == 'win32': + build_monitor_path = tool_path( 'build_monitor.exe' ) + if os.path.exists( build_monitor_path ): + utils.system( [ 'start /belownormal "" "%s" bjam.exe %d' % ( build_monitor_path, timeout*60 ) ] ) + else: + log( 'Warning: Build monitor is not found at "%s"' % build_monitor_path ) + + +def stop_build_monitor(): + if sys.platform == 'win32': + build_monitor_path = tool_path( 'build_monitor.exe' ) + if os.path.exists( build_monitor_path ): + utils.system( [ '"%s" build_monitor' % tool_path( 'pskill.exe' ) ] ) + + +def run_process_jam_log(v2): + log( 'Getting test case results out of "%s"...' % regression_log ) + + if v2: + v2 = "--v2" + else: + v2 = "" + + utils.checked_system( [ + '"%s" %s "%s" <"%s"' % ( + tool_path( process_jam_log, v2 ) + , v2 + , regression_results + , regression_log + ) + ] ) + + +def test( + toolsets + , bjam_options + , monitored + , timeout + , v2 + , args + , **unused + ): + if args == []: + args = [ "test", "process" ] + + import_utils() + + try: + if monitored: + start_build_monitor( timeout ) + + cd = os.getcwd() + os.chdir( os.path.join( boost_root, 'status' ) ) + + log( 'Making "%s" directory...' % regression_results ) + utils.makedirs( regression_results ) + + results_libs = os.path.join( regression_results, 'libs' ) + results_status = os.path.join( regression_results, 'status' ) + + if "clean" in args: + rmtree( results_libs ) + rmtree( results_status ) + + build_dir_option = "-sALL_LOCATE_TARGET" + if v2: + build_dir_option = "--build-dir" + + if "test" in args: + test_cmd = '%s -d2 --dump-tests %s "%s=%s" >>"%s" 2>&1' % ( + bjam_command( toolsets, v2 ) + , bjam_options + , build_dir_option + , regression_results + , regression_log + ) + + log( 'Starting tests (%s)...' % test_cmd ) + utils.system( [ test_cmd ] ) + + if "process" in args: + run_process_jam_log(v2) + + os.chdir( cd ) + finally: + if monitored: + stop_build_monitor() + +def build_book( **kargs ): + # To do + # 1. PDF generation + # 2. Do we need to cleanup before the build? + # 3. Incremental builds + if not os.path.exists( regression_results ): + os.makedirs( regression_results ) + import_utils() + cwd = os.getcwd() + try: + os.chdir( os.path.join( boost_root, 'doc' ) ) + if os.path.exists( boostbook_log ): + os.unlink( boostbook_log ) + utils.system( [ '%s --v2 html >>%s 2>&1' % ( tool_path( bjam, v2=True ), boostbook_log ) ] ) + # utils.system( [ '%s --v2 pdf >>%s 2>&1' % ( tool_path( bjam, v2=True ), boostbook_log ) ] ) + finally: + os.chdir( cwd ) + +def collect_logs( + tag + , runner + , platform + , user + , comment + , incremental + , args + , **unused + ): + import_utils() + + if comment is None: + comment = 'comment.html' + + comment_path = os.path.join( regression_root, comment ) + if not os.path.exists( comment_path ): + log( 'Comment file "%s" not found; creating default comment.' % comment_path ) + f = open( comment_path, 'w' ) + f.write( '

Tests are run on %s platform.

' % platform_name() ) + f.close() + + run_type = '' + if incremental: run_type = 'incremental' + else: run_type = 'full' + + source = 'tarball' + cvs_root_file = os.path.join( boost_root, 'CVS', 'root' ) + if os.path.exists( cvs_root_file ): + if string.split( open( cvs_root_file ).readline(), '@' )[0] == ':pserver:anonymous': + source = 'anonymous CVS' + else: + source = 'CVS' + + from runner import collect_logs + collect_logs( + regression_results + , runner + , tag + , platform + , comment_path + , timestamp_path + , user + , source + , run_type + ) + +def collect_book( **unused ): + log( 'Collecting files for BoostBook into "%s"...' % boostbook_archive_name ) + import zipfile + boostbook_archive = zipfile.ZipFile( boostbook_archive_name, 'w', zipfile.ZIP_DEFLATED ) + html_root = os.path.join( boost_root, 'doc/html' ) + + boostbook_archive.writestr( 'timestamp', timestamp()) + boostbook_archive.write( boostbook_log, os.path.basename( boostbook_log ) ) + + def add_files( arg, dirname, names ): + for name in names: + path = os.path.join( dirname, name ) + if not os.path.isdir( path ): + boostbook_archive.write( path, path[ len(html_root) + 1: ] ) + os.path.walk( html_root, add_files, None ) + +def upload_logs( + tag + , runner + , user + , ftp_proxy + , debug_level + , send_bjam_log + , **unused + ): + import_utils() + from runner import upload_logs + retry( + upload_logs + , ( regression_results, runner, tag, user, ftp_proxy, debug_level, send_bjam_log, timestamp_path ) + ) + +def upload_book( tag, runner, ftp_proxy, debug_level, **unused ): + import_utils() + from runner import upload_to_ftp + upload_to_ftp( tag, boostbook_archive_name, ftp_proxy, debug_level ) + +def update_itself( tag, **unused ): + source = os.path.join( xsl_reports_dir, 'runner', os.path.basename( sys.argv[0] ) ) + self = os.path.join( regression_root, os.path.basename( sys.argv[0] ) ) + + log( 'Updating %s from %s...' % ( self, source ) ) + log( ' Checking modification dates...' ) + if os.stat( self ).st_mtime > os.stat( source ).st_mtime: + log( 'Warning: The current version of script appears to be newer than the source.' ) + log( ' Update skipped.' ) + else: + log( ' Saving a backup copy of the current script...' ) + os.chmod( self, stat.S_IWRITE ) # Win32 workaround + shutil.move( self, '%s~' % self ) + log( ' Replacing %s with a newer version...' % self ) + shutil.copy2( source, self ) + + +def send_mail( smtp_login, mail, subject, msg = '', debug_level = 0 ): + import smtplib + if not smtp_login: + server_name = 'mail.%s' % mail.split( '@' )[-1] + user_name = None + password = None + else: + server_name = smtp_login.split( '@' )[-1] + ( user_name, password ) = string.split( smtp_login.split( '@' )[0], ':' ) + + log( ' Sending mail through "%s"...' % server_name ) + smtp_server = smtplib.SMTP( server_name ) + smtp_server.set_debuglevel( debug_level ) + if user_name: + smtp_server.login( user_name, password ) + + smtp_server.sendmail( + mail + , [ mail ] + , 'Subject: %s\nTo: %s\n\n%s' % ( subject, mail, msg ) + ) + + +def regression( + tag + , local + , runner + , platform + , user + , comment + , toolsets + , book + , bjam_options + , bjam_toolset + , pjl_toolset + , incremental + , send_bjam_log + , force_update + , monitored + , timeout + , mail = None + , smtp_login = None + , proxy = None + , ftp_proxy = None + , debug_level = 0 + , v2 = 1 + , args = [] + ): + + try: + mail_subject = 'Boost regression for %s on %s' % ( tag, string.split(socket.gethostname(), '.')[0] ) + start_time = time.localtime() + if mail: + log( 'Sending start notification to "%s"' % mail ) + send_mail( + smtp_login + , mail + , '%s started at %s.' % ( mail_subject, format_time( start_time ) ) + , debug_level = debug_level + ) + + if local is not None: + log( 'Using local file "%s"' % local ) + + b = os.path.basename( local ) + tag = b[ 0: b.find( '.' ) ] + log( 'Tag: "%s"' % tag ) + + unpack_tarball( local, regression_root ) + else: + if incremental or force_update: + if not incremental: cleanup( [ 'bin' ] ) + update_source( user, tag, proxy, [] ) + else: + cleanup( [] ) + get_source( user, tag, proxy, [] ) + + setup( comment, toolsets, book, bjam_toolset, pjl_toolset, monitored, proxy, + v2, [] ) + # Not specifying --toolset in command line is not enough + # that would mean to use Boost.Build default ones + # We can skip test only we were explictly + # told to have no toolsets in command line "--toolset=" + if toolsets != '': # --toolset=, + test( toolsets, bjam_options, monitored, timeout, v2, [] ) + collect_logs( tag, runner, platform, user, comment, incremental, [] ) + upload_logs( tag, runner, user, ftp_proxy, debug_level, send_bjam_log ) + if book: + build_book() + collect_book() + upload_book( tag, runner, ftp_proxy, debug_level ) + + update_itself( tag ) + + if mail: + log( 'Sending report to "%s"' % mail ) + end_time = time.localtime() + send_mail( + smtp_login + , mail + , '%s completed successfully at %s.' % ( mail_subject, format_time( end_time ) ) + , debug_level = debug_level + ) + except: + if mail: + log( 'Sending report to "%s"' % mail ) + traceback_ = '\n'.join( apply( traceback.format_exception, sys.exc_info() ) ) + end_time = time.localtime() + send_mail( + smtp_login + , mail + , '%s failed at %s.' % ( mail_subject, format_time( end_time ) ) + , traceback_ + , debug_level + ) + raise + + +def show_revision( **unused ): + modified = '$Date$' + revision = '$Revision$' + + import re + re_keyword_value = re.compile( r'^\$\w+:\s+(.*)\s+\$$' ) + print '\n\tResivion: %s' % re_keyword_value.match( revision ).group( 1 ) + print '\tLast modified on: %s\n' % re_keyword_value.match( modified ).group( 1 ) + + +def accept_args( args ): + args_spec = [ + 'tag=' + , 'local=' + , 'runner=' + , 'platform=' + , 'user=' + , 'comment=' + , 'toolsets=' + , 'book' + , 'bjam-options=' + , 'bjam-toolset=' + , 'pjl-toolset=' + , 'timeout=' + , 'mail=' + , 'smtp-login=' + , 'proxy=' + , 'ftp-proxy=' + , 'debug-level=' + , 'incremental' + , 'force-update' + , 'dont-send-bjam-log' + , 'monitored' + , 'help' + , 'v2' + , 'v1' + ] + + options = { + '--tag' : 'CVS-HEAD' + , '--local' : None + , '--platform' : platform_name() + , '--user' : None + , '--comment' : None + , '--toolsets' : None + , '--book' : False + , '--bjam-options' : '' + , '--bjam-toolset' : None + , '--pjl-toolset' : None + , '--timeout' : 5 + , '--mail' : None + , '--smtp-login' : None + , '--proxy' : None + , '--debug-level' : 0 + , '--ftp-proxy' : None + } + + ( option_pairs, other_args ) = getopt.getopt( args, '', args_spec ) + map( lambda x: options.__setitem__( x[0], x[1] ), option_pairs ) + + if not options.has_key( '--runner' ) or options.has_key( '--help' ): + usage() + sys.exit( 1 ) + + return { + 'tag' : options[ '--tag' ] + , 'local' : options[ '--local' ] + , 'runner' : options[ '--runner' ] + , 'platform' : options[ '--platform'] + , 'user' : options[ '--user' ] + , 'comment' : options[ '--comment' ] + , 'toolsets' : options[ '--toolsets' ] + , 'book' : options.has_key( '--book' ) + , 'bjam_options' : options[ '--bjam-options' ] + , 'bjam_toolset' : options[ '--bjam-toolset' ] + , 'pjl_toolset' : options[ '--pjl-toolset' ] + , 'incremental' : options.has_key( '--incremental' ) + , 'send_bjam_log' : not options.has_key( '--dont-send-bjam-log' ) + , 'force_update' : options.has_key( '--force-update' ) + , 'monitored' : options.has_key( '--monitored' ) + , 'timeout' : options[ '--timeout' ] + , 'mail' : options[ '--mail' ] + , 'smtp_login' : options[ '--smtp-login' ] + , 'proxy' : options[ '--proxy' ] + , 'ftp_proxy' : options[ '--ftp-proxy' ] + , 'debug_level' : int(options[ '--debug-level' ]) + , 'v2' : not options.has_key( '--v1' ) + , 'args' : other_args + } + +commands = { + 'cleanup' : cleanup + , 'get-source' : get_source + , 'update-source' : update_source + , 'setup' : setup + , 'install' : install + , 'test' : test + , 'build-book' : build_book + , 'collect-logs' : collect_logs + , 'collect-book' : collect_book + , 'upload-logs' : upload_logs + , 'upload-book' : upload_book + , 'update-itself' : update_itself + , 'regression' : regression + , 'show-revision' : show_revision + } + +def usage(): + print 'Usage:\n\t%s [command] options' % os.path.basename( sys.argv[0] ) + print ''' +Commands: +\t%s + +Options: +\t--runner runner ID (e.g. 'Metacomm') +\t--tag the tag for the results ('CVS-HEAD' by default) +\t--local the name of the boost tarball +\t--comment an HTML comment file to be inserted in the reports +\t ('comment.html' by default) +\t--incremental do incremental run (do not remove previous binaries) +\t--dont-send-bjam-log +\t do not send full bjam log of the regression run +\t--force-update do a CVS update (if applicable) instead of a clean +\t checkout, even when performing a full run +\t--monitored do a monitored run +\t--timeout specifies the timeout, in minutes, for a single test +\t run/compilation (enforced only in monitored runs, 5 by +\t default) +\t--user SourceForge user name for a shell/CVS account (optional) +\t--toolsets comma-separated list of toolsets to test with (optional) +\t--book build BoostBook (optional) +\t--bjam-options options to pass to the regression test (optional) +\t--bjam-toolset bootstrap toolset for 'bjam' executable (optional) +\t--pjl-toolset bootstrap toolset for 'process_jam_log' executable +\t (optional) +\t--mail email address to send run notification to (optional) +\t--smtp-login STMP server address/login information, in the following +\t form: :@[:] (optional). +\t--proxy HTTP proxy server address and port (e.g. +\t 'http://www.someproxy.com:3128', optional) +\t--ftp-proxy FTP proxy server (e.g. 'ftpproxy', optional) +\t--debug-level debugging level; controls the amount of debugging +\t output printed; 0 by default (no debug output) +\t--v1 Use Boost.Build V1 +\t--v2 Use Boost.Build V2 (default) +''' % '\n\t'.join( commands.keys() ) + + print 'Example:\n\t%s --runner=Metacomm\n' % os.path.basename( sys.argv[0] ) + print 'For more documentation, see http://tinyurl.com/4f2zp\n' + + +if __name__ == '__main__': + if len(sys.argv) > 1 and sys.argv[1] in commands: + command = sys.argv[1] + args = sys.argv[ 2: ] + if command not in [ 'collect-logs', 'upload-logs' ]: + args.insert( 0, '--runner=' ) + else: + command = 'regression' + args = sys.argv[ 1: ] + + commands[ command ]( **accept_args( args ) ) diff --git a/tools/regression/xsl_reports/test/common.py b/tools/regression/xsl_reports/test/common.py new file mode 100644 index 0000000000..1b2445fbdc --- /dev/null +++ b/tools/regression/xsl_reports/test/common.py @@ -0,0 +1,163 @@ +import xml.sax.saxutils +import time + +def make_test_name( library_idx, test_idx ): + return "test_%02d_%02d" % ( library_idx, test_idx ) + +def make_library_name( library_idx ): + if library_idx % 4 in ( 0, 1 ): + return "library_%02d/%02d" % ( int( library_idx / 4 ) * 4, library_idx % 4 ) + else: + return "library_%02d" % library_idx + +def make_toolset_name( toolset_idx ): + return "toolset_%02d" % toolset_idx + +def make_library_target_directory( library_idx, toolset_idx, variant = None ): + base = "lib/%s/%s" % ( make_library_name( library_idx ) + , make_toolset_name( toolset_idx ) ) + if variant is not None: + return "%s/%s" % ( base, variant ) + else: + return base + +def make_test_target_directory( library_idx, toolset_idx, test_name, variant ): + base = "%s/%s/%s" % ( make_library_name( library_idx ) + , make_toolset_name( toolset_idx ) + , test_name ) + if variant is not None: + return "%s/%s" % ( base, variant ) + else: + return base + +def format_timestamp( timestamp ): + return time.strftime( "%Y-%m-%dT%H:%M:%SZ", timestamp ) + +def make_test_log( xml_generator + , library_idx + , toolset_idx + , test_name + , test_type + , test_result + , show_run_output + , variant ): + library = make_library_name( library_idx ) + toolset_name = make_toolset_name( toolset_idx ) + + target_directory = "" + if test_type != "lib": + target_directory = make_test_target_directory( library_idx, toolset_idx, test_name, variant ) + else: + target_directory = make_library_target_directory( library_idx, toolset_idx, variant ) + + xml_generator.startElement( "test-log", { "library": library + , "test-name": test_name + , "toolset": toolset_name + , "test-type": test_type + , "test-program": "some_program" + , "target-directory": target_directory + , "show-run-output": show_run_output + } ) + + if test_type != "lib": + + if test_result == "success" and ( toolset_idx + 1 ) % 4: + xml_generator.startElement( "compile", { "result": "success" } ); + xml_generator.characters( "Compiling in %s" % target_directory ) + xml_generator.endElement( "compile" ) + + if test_type.find( "link" ) == 0 or test_type.find( "run" ) == 0 and toolset_idx % 4: + xml_generator.startElement( "lib", { "result": test_result } ); + xml_generator.characters( make_library_target_directory( library_idx, toolset_idx ) ) + xml_generator.endElement( "lib" ) + + xml_generator.startElement( "link", { "result": "success" } ); + xml_generator.characters( "Linking in %s" % target_directory ) + xml_generator.endElement( "link" ) + + if test_type.find( "run" ) == 0 and ( toolset_idx + 2 ) % 4: + xml_generator.startElement( "run", { "result": test_result } ); + xml_generator.characters( "Running in %s" % target_directory ) + xml_generator.endElement( "run" ) + + else: + xml_generator.startElement( "compile", { "result": test_result } ); + xml_generator.characters( "Compiling in %s" % make_library_target_directory( library_idx, toolset_idx ) ) + xml_generator.endElement( "compile" ) + + + + xml_generator.endElement( "test-log" ) + + +def make_expicit_failure_markup( num_of_libs, num_of_toolsets, num_of_tests ): + g = xml.sax.saxutils.XMLGenerator( open( "explicit-failures-markup.xml", "w" ) ) + g.startElement( "explicit-failures-markup", {} ); + + # required toolsets + for i_toolset in range( 0, num_of_toolsets ): + if i_toolset < 2: + g.startElement( "mark-toolset", { "name": "toolset_%02d" % i_toolset, "status":"required"} ) + g.endElement( "mark-toolset" ) + + for i_library in range( 0, num_of_libs ): + g.startElement( "library", { "name": make_library_name( i_library ) } ) + if i_library % 4 == 0: + g.startElement( "mark-unusable", {} ) + for i_toolset in range( 0, num_of_toolsets ): + if i_toolset % 2 == 1: + g.startElement( "toolset", { "name": make_toolset_name( i_toolset ) } ) + g.endElement( "toolset" ) + g.startElement( "note", { "author": "T. Test" } ) + g.characters( "Test note" ) + g.endElement( "note" ) + g.endElement( "mark-unusable" ) + + for i_test in range( 0, num_of_tests ): + + category = 0 + explicitly_marked_failure = 0 + unresearched = 0 + + if i_test % 2 == 0: + category = i_test % 3 + + if i_test % 3 == 0: + explicitly_marked_failure = 1 + if i_test % 2 == 0: + unresearched = 1 + + if category or explicitly_marked_failure: + test_attrs = { "name": make_test_name( i_library, i_test ) } + if category: + test_attrs[ "category" ] = "Category %s" % category + g.startElement( "test", test_attrs ) + if explicitly_marked_failure: + failure_attrs = {} + if unresearched: failure_attrs[ "reason" ] = "not-researched" + + g.startElement( "mark-failure", failure_attrs ) + + g.startElement( "toolset", { "name": make_toolset_name( 1 ) } ) + g.endElement( "toolset" ) + g.startElement( "toolset", { "name": make_toolset_name( 0 ) } ) + g.endElement( "toolset" ) + g.startElement( "toolset", { "name": make_toolset_name( 2 ) } ) + g.endElement( "toolset" ) + + g.startElement( "note", { "author": "V. Annotated" } ) + g.characters( "Some thoughtful note" ) + g.endElement( "note" ) + + g.endElement( "mark-failure" ) + + g.endElement( "test" ); + g.endElement( "library" ) + + + g.endElement( "explicit-failures-markup" ) + + +def make_expected_results( num_of_libs, num_of_toolsets, num_of_tests ): + pass + diff --git a/tools/regression/xsl_reports/test/expected_results.xml b/tools/regression/xsl_reports/test/expected_results.xml new file mode 100644 index 0000000000..d9fdd26cc9 --- /dev/null +++ b/tools/regression/xsl_reports/test/expected_results.xml @@ -0,0 +1,3 @@ + + + diff --git a/tools/regression/xsl_reports/test/generate_test_results.py b/tools/regression/xsl_reports/test/generate_test_results.py new file mode 100644 index 0000000000..db186ca937 --- /dev/null +++ b/tools/regression/xsl_reports/test/generate_test_results.py @@ -0,0 +1,158 @@ +# +# Generates test test results for testing of boost_wide_report.py +# +import common +import xml.sax.saxutils + +import os +import time + +num_of_libs = 5 +num_of_runners = 5 +num_of_toolsets = 3 +num_of_tests = 10 + +results_directory = "results/incoming/CVS-HEAD/processed" + + +# Generated results follow the rules: +# +# * odd runners are testing on Win32, even runners are testin on Unix +# * the third toolset has 2 variants +# + +# Generated expected markup: +# +# * First two toolset are required +# * Every fourth library is unusable on event toolsets +# * Last two tests are corner-ase tests +# * Every 4th test is explicitly marked up as expected-failure + + +def library_build_failed( library_idx ): + return library_idx % 2 + +def test_run_source( runner_idx ): + if runner_idx % 2: return "tarball" + else: return "cvs head" + +def test_run_type( runner_idx ): + if runner_idx % 2: return "incremental" + else: return "full" + + +def test_type( i ): + types = [ "compile", "compile_fail", "link", "link_fail", "run", "run_fail", "run_pyd" ] + return types[ i % len( types) ] + + +def make_test_results(): + if not os.path.exists( results_directory ): + os.makedirs( results_directory ) + + for i_runner in range( 0, num_of_runners ): + runner_id = "runner_%02d" % i_runner + g = xml.sax.saxutils.XMLGenerator( open( os.path.join( results_directory, runner_id + ".xml" ), "w" ) ) + if i_runner % 2: + platform = "Win32" + else: + platform = "Unix" + + g.startElement( "test-run", { "platform": platform + , "runner": runner_id + , "timestamp": common.format_timestamp( + time.gmtime( time.time() - i_runner * 24*60*60 ) + ) + , "source": test_run_source( i_runner ) + , "run-type": test_run_type( i_runner ) + } ) + + g.startElement( "comment", {} ) + g.characters( "Runner is who running does." ) + g.endElement( "comment" ) + + for i_lib in range( 0, num_of_libs ): + for i_toolset in range( num_of_toolsets ): + if library_build_failed( i_lib ): test_result = "fail" + else: test_result = "success" + + common.make_test_log( xml_generator = g + , library_idx = i_lib + , toolset_idx = i_toolset + , test_name = "" + , test_type = "lib" + , test_result = test_result + , show_run_output = "false" + , variant = None ) + + + for i_lib in range( 0, num_of_libs ): + library_name = "library_%02d" % i_lib + if num_of_runners - 1 == i_runner and i_lib % 2: + continue + + for i_toolset in range( num_of_toolsets ): + toolset_name = "toolset_%02d" % ( i_toolset ) + + if num_of_runners - 1 == i_runner and i_toolset % 2: + continue + + for i_test in range( num_of_tests ): + test_name = "test_%02d_%02d" % ( i_lib, i_test ) + test_result = "" + show_run_output = "false" + + if num_of_runners - 1 == i_runner and i_test % 2: + continue + + if i_runner % 2: test_result = "success" + else: test_result = "fail" + + if i_runner == 1 and i_toolset == 2 and i_test % 6 == 0: + test_result = "fail" + + if test_result == "success" and ( 0 == i_test % 5 ): + show_run_output = "true" + + if i_toolset == 2: + variants = [ "static-lib", "shared-lib" ] + else: + variants = [ None ] + + for variant in variants: + common.make_test_log( xml_generator = g + , library_idx = i_lib + , toolset_idx = i_toolset + , test_name = test_name + , test_type = test_type( i_test ) + , test_result = test_result + , show_run_output = show_run_output + , variant = variant ) + g.endElement( "test-run" ) + + + + +## +## + +## "C:\Progra~1\Borland\CBuilder6\bin\bcc32" -j5 -g255 -q -c -P -w -Ve -Vx -a8 -b- -v -Od -vi- -tWC -tWR -tWC -WM- -DBOOST_ALL_NO_LIB=1 -w-8001 -I"C:\Users\Administrator\boost\main\results\bin\boost\libs\algorithm\string\test" -I"C:\Users\Administrator\boost\main\boost" -I"C:\Progra~1\Borland\CBuilder6\include" -o"C:\Users\Administrator\boost\main\results\bin\boost\libs\algorithm\string\test\container.test\borland-5.6.4\debug\container_test.obj" "..\libs\algorithm\string\test\container_test.cpp" + +## ..\libs\algorithm\string\test\container_test.cpp: +## Warning W8091 C:\Users\Administrator\boost\main\boost\libs/test/src/unit_test_result.cpp 323: template argument _InputIter passed to 'for_each' is a output iterator: input iterator required in function unit_test_result::~unit_test_result() +## Warning W8091 C:\Users\Administrator\boost\main\boost\libs/test/src/unit_test_suite.cpp 63: template argument _InputIter passed to 'find_if' is a output iterator: input iterator required in function test_case::Impl::check_dependencies() +## Warning W8091 C:\Users\Administrator\boost\main\boost\libs/test/src/unit_test_suite.cpp 204: template argument _InputIter passed to 'for_each' is a output iterator: input iterator required in function test_suite::~test_suite() +## Error E2401 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 45: Invalid template argument list +## Error E2040 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 46: Declaration terminated incorrectly +## Error E2090 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 277: Qualifier 'algorithm' is not a class or namespace name +## Error E2272 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 277: Identifier expected +## Error E2090 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 278: Qualifier 'algorithm' is not a class or namespace name +## Error E2228 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 278: Too many error or warning messages +## *** 6 errors in Compile *** +## +## + + +make_test_results() +common.make_expicit_failure_markup( num_of_libs, num_of_toolsets, num_of_tests ) + diff --git a/tools/regression/xsl_reports/test/generate_test_results_v1.py b/tools/regression/xsl_reports/test/generate_test_results_v1.py new file mode 100644 index 0000000000..0f7f8f796a --- /dev/null +++ b/tools/regression/xsl_reports/test/generate_test_results_v1.py @@ -0,0 +1,85 @@ +import xml.sax.saxutils + +import common + +import os +import time + +num_of_libs = 2 +num_of_toolsets = 3 +num_of_tests = 10 + +tag = "1_30_0" + +def library_build_failed( library_idx ): + return library_idx % 2 + +def make_test_results(): + if not os.path.exists( tag ): + os.makedirs( tag ) + + g = xml.sax.saxutils.XMLGenerator( open( os.path.join( tag, "test.xml" ), "w" ) ) + platform = "Win32" + g.startElement( "test-results", {} ) + + for i_lib in range( 0, num_of_libs ): + for i_toolset in range( num_of_toolsets ): + if library_build_failed( i_lib ): test_result = "fail" + else: test_result = "success" + + common.make_test_log( xml_generator = g + , library_idx = i_lib + , toolset_idx = i_toolset + , test_name = "" + , test_type = "lib" + , test_result = test_result + , show_run_output = "false" ) + + + for i_lib in range( 0, num_of_libs ): + library_name = "library_%02d" % i_lib + + for i_toolset in range( num_of_toolsets ): + toolset_name = "toolset_%02d" % ( i_toolset ) + + for i_test in range( num_of_tests ): + test_name = "test_%02d_%02d" % ( i_lib, i_test ) + test_result = "" + test_type = "run" + show_run_output = "false" + + if i_lib % 2: test_result = "success" + else: test_result = "fail" + + if test_result == "success" and ( 0 == i_test % 5 ): + show_run_output = "true" + + common.make_test_log( g, i_lib, i_toolset, test_name, test_type, test_result, show_run_output ) + + g.endElement( "test-results" ) + + + + +## +## + +## "C:\Progra~1\Borland\CBuilder6\bin\bcc32" -j5 -g255 -q -c -P -w -Ve -Vx -a8 -b- -v -Od -vi- -tWC -tWR -tWC -WM- -DBOOST_ALL_NO_LIB=1 -w-8001 -I"C:\Users\Administrator\boost\main\results\bin\boost\libs\algorithm\string\test" -I"C:\Users\Administrator\boost\main\boost" -I"C:\Progra~1\Borland\CBuilder6\include" -o"C:\Users\Administrator\boost\main\results\bin\boost\libs\algorithm\string\test\container.test\borland-5.6.4\debug\container_test.obj" "..\libs\algorithm\string\test\container_test.cpp" + +## ..\libs\algorithm\string\test\container_test.cpp: +## Warning W8091 C:\Users\Administrator\boost\main\boost\libs/test/src/unit_test_result.cpp 323: template argument _InputIter passed to 'for_each' is a output iterator: input iterator required in function unit_test_result::~unit_test_result() +## Warning W8091 C:\Users\Administrator\boost\main\boost\libs/test/src/unit_test_suite.cpp 63: template argument _InputIter passed to 'find_if' is a output iterator: input iterator required in function test_case::Impl::check_dependencies() +## Warning W8091 C:\Users\Administrator\boost\main\boost\libs/test/src/unit_test_suite.cpp 204: template argument _InputIter passed to 'for_each' is a output iterator: input iterator required in function test_suite::~test_suite() +## Error E2401 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 45: Invalid template argument list +## Error E2040 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 46: Declaration terminated incorrectly +## Error E2090 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 277: Qualifier 'algorithm' is not a class or namespace name +## Error E2272 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 277: Identifier expected +## Error E2090 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 278: Qualifier 'algorithm' is not a class or namespace name +## Error E2228 C:\Users\Administrator\boost\main\boost\boost/algorithm/string/finder.hpp 278: Too many error or warning messages +## *** 6 errors in Compile *** +## +## + + +make_test_results( ) +common.make_expicit_failure_markup( num_of_libs, num_of_toolsets, num_of_tests ) diff --git a/tools/regression/xsl_reports/test/restrict_to_library.xsl b/tools/regression/xsl_reports/test/restrict_to_library.xsl new file mode 100644 index 0000000000..8de3354d84 --- /dev/null +++ b/tools/regression/xsl_reports/test/restrict_to_library.xsl @@ -0,0 +1,36 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/test/run_notes_regression.py b/tools/regression/xsl_reports/test/run_notes_regression.py new file mode 100644 index 0000000000..884dcfe9db --- /dev/null +++ b/tools/regression/xsl_reports/test/run_notes_regression.py @@ -0,0 +1,32 @@ +import sys + +sys.path.append( '..' ) + +import os + +import report +import merger +import utils + + +tag = "1_32_0" + +# utils.makedirs( "results" ) + +all_xml_file = "a.xml" + +report.make_result_pages( + test_results_file = os.path.abspath( all_xml_file ) + , expected_results_file = "" + , failures_markup_file = os.path.abspath( "../../../../status/explicit-failures-markup.xml" ) + , tag = tag + , run_date = "Today date" + , comment_file = os.path.abspath( "comment.html" ) + , results_dir = "results" + , result_prefix = "" + , reports = [ "dd" ] + , v2 = 1 + ) + + + diff --git a/tools/regression/xsl_reports/test/run_v1.py b/tools/regression/xsl_reports/test/run_v1.py new file mode 100644 index 0000000000..a995ed635d --- /dev/null +++ b/tools/regression/xsl_reports/test/run_v1.py @@ -0,0 +1,35 @@ +import sys + +sys.path.append( '..' ) + +import os + +import report +import merger +import utils + + +tag = "1_30_0" + +utils.makedirs( "results" ) + +all_xml_file = "results/all.xml" +all_xml_writer = open( all_xml_file, "w" ) +merger.merge_test_runs( ".", tag, all_xml_writer ) +all_xml_writer.close() + +report.make_result_pages( + test_results_file = os.path.abspath( all_xml_file ) + , expected_results_file = "" + , failures_markup_file = os.path.abspath( "explicit-failures-markup.xml" ) + , source = tag + , run_date = "Today date" + , comment_file = os.path.abspath( "comment.html" ) + , results_dir = os.path.abspath( "results" ) + , result_prefix = "" + , reports = [ "l", "dd" ] + , v2 = 0 + ) + + + diff --git a/tools/regression/xsl_reports/test/test-components/test.py b/tools/regression/xsl_reports/test/test-components/test.py new file mode 100644 index 0000000000..8204f72082 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test.py @@ -0,0 +1,87 @@ +import new +import os +import unittest +import sys + +sys.path.append( os.path.normpath( os.path.join( os.path.abspath( os.path.dirname( __file__ ) ), '../..' ) ) ) + +import utils.libxslt + +#1. collect test_cases +#2. Add test cases to test suite +#3. Run test cases + +class test_case_definition: + def __init__(self, root, name ): + self._root = root + self._name = name + + def root(self): + return self._root + + def name(self): + return self._name + + def path(self): + return os.path.join( self._root, self._name ) + + def xsl_driver( self ): + return os.path.join( self.path(), 'test-driver.xsl' ) + + def xml_data_files( self ): + data_files = [ x for x in os.listdir( self.path() ) if os.path.splitext( x )[1] == '.xml' ] + return data_files + +def collect_test_cases(): + test_cases_dir = os.path.join( os.path.dirname( __file__ ) ) + test_cases = os.listdir( test_cases_dir ) + def is_disabled( test_case ): + return os.path.exists( os.path.join( test_case, '.disabled' ) ) + return [ test_case_definition( test_cases_dir, x ) for x in test_cases if os.path.isdir( os.path.join( test_cases_dir, x ) ) and not is_disabled(x) ] + +def log( msg ): + print msg + +def read_file_lines( path ): + f = open( path ) + try: + return f.readlines() + finally: + f.close() + +def write_file_lines( path, content ): + f = open( path, 'w' ) + try: + return f.writelines( content ) + finally: + f.close() + +def make_test_case( test_case ): + def test_case_method( self ): + for test_case_xml in test_case.xml_data_files(): + print test_case_xml + result_file_name = os.path.splitext( os.path.basename( test_case_xml ) )[0] + '.xml' + ( result_file, expected_file ) = [ os.path.join( test_case.path(), x, result_file_name ) for x in ( 'actual', 'expected' ) ] + print ( result_file, expected_file ) + saved_cwd = os.getcwd() + try: + os.chdir( test_case.path() ) + utils.libxslt( log, test_case_xml, test_case.xsl_driver(), result_file ) + finally: + os.chdir( saved_cwd ) + self.failUnlessEqual( read_file_lines( expected_file ), read_file_lines( result_file ) ) + test_case_method.__name__ = test_case.name() + return test_case_method + +class test_components(unittest.TestCase): + pass + +if __name__ == '__main__': + for test_case in collect_test_cases(): + print test_case.name() + setattr( test_components, test_case.name(), make_test_case(test_case) ) + unittest.main() + + + + \ No newline at end of file diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/compile-fail.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/compile-fail.xml new file mode 100644 index 0000000000..f59d83ab53 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/compile-fail.xml @@ -0,0 +1,15 @@ + + + + + "/openpkg/bin/g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -fPIC -DBOOST_ALL_NO_LIB=1 -I".." -c -o "/home/cae/boost-regression/RC_1_34_0/results/boost/bin.v2/libs/mpl/test/apply.test/gcc-4.1.1_sunos_i86pc/debug/debug-symbols-off/apply.o" "../libs/mpl/test/apply.cpp" + +../boost/mpl/aux_/preprocessed/gcc/template_arity.hpp: In instantiation of 'boost::mpl::aux::template_arity<T1>': +../libs/mpl/test/apply.cpp:63: instantiated from here +../boost/mpl/aux_/preprocessed/gcc/template_arity.hpp:98: internal compiler error: Segmentation Fault +Please submit a full bug report, +with preprocessed source if appropriate. +See <URL:http://www.openpkg.org/> for instructions. + + + \ No newline at end of file diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/completed.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/completed.xml new file mode 100644 index 0000000000..ebd8639fbb --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/completed.xml @@ -0,0 +1,31 @@ + + + +call "c:\Program Files\Microsoft Visual Studio\VC98\Bin\VCVARS32.BAT" >nul +cl /Zm800 -nologo @"g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax_test.obj.rsp" + +minmax_test.cpp + +file g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe.rsp + +"g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax_test.obj" + + + +call "c:\Program Files\Microsoft Visual Studio\VC98\Bin\VCVARS32.BAT" >nul +link /NOLOGO /INCREMENTAL:NO /subsystem:console /out:"g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe" @"g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe.rsp" + if %ERRORLEVEL% NEQ 0 EXIT %ERRORLEVEL% + if exist "g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe.manifest" ( + mt -nologo -manifest "g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe.manifest" "-outputresource:g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe;1" + ) + + + +Running 1 test case... + +*** No errors detected + +EXIT STATUS: 0 + + + \ No newline at end of file diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/compile-fail.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/compile-fail.xml new file mode 100644 index 0000000000..83afaeee9c --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/compile-fail.xml @@ -0,0 +1,4 @@ + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/completed.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/completed.xml new file mode 100644 index 0000000000..2f0fb285cd --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/completed.xml @@ -0,0 +1,4 @@ + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/lib.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/lib.xml new file mode 100644 index 0000000000..d84643fdf4 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/lib.xml @@ -0,0 +1,5 @@ + + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/misfire.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/misfire.xml new file mode 100644 index 0000000000..17448b2f36 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/misfire.xml @@ -0,0 +1,4 @@ + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/no-run.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/no-run.xml new file mode 100644 index 0000000000..f024ec5fa9 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/no-run.xml @@ -0,0 +1,4 @@ + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/run_pyd.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/run_pyd.xml new file mode 100644 index 0000000000..551c8b8027 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/run_pyd.xml @@ -0,0 +1,6 @@ + + + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/test-case.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/test-case.xml new file mode 100644 index 0000000000..904ccbf989 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/test-case.xml @@ -0,0 +1,5 @@ + + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/lib.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/lib.xml new file mode 100644 index 0000000000..33627efe58 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/lib.xml @@ -0,0 +1,42 @@ + + + +"C:/Programme/Borland/BDS/4.0/Bin/bcc32.exe" -j5 -g255 -q -c -P -Ve -Vx -a8 -b- -IX:/spirit-1.6.3/boost -v -Od -tWC -tWR -tWC -tWD -WM- -DBOOST_ALL_DYN_LINK=1 -DBOOST_ALL_NO_LIB=1 -DDATE_TIME_INLINE -I".." -I"C:/Programme/Borland/BDS/4.0/include/" -o"X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\date_generators.obj" "..\libs\date_time\src\gregorian\date_generators.cpp" + +..\libs\date_time\src\gregorian\date_generators.cpp: + +file X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\boost_date_time-bcb-d-1_34.dll.rsp + +"X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\greg_month.obj" + +"X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\greg_weekday.obj" + +"X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\date_generators.obj" + + + + + set "PATH=C:/Programme/Borland/BDS/4.0/bin/;%PATH%" + "C:/Programme/Borland/BDS/4.0/Bin/bcc32.exe" -v -q -v -v -tWD -tWC -tWR -tWC -tWD -WM- -L"C:/Programme/Borland/BDS/4.0/lib" -e"X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\boost_date_time-bcb-d-1_34.dll" @"X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\boost_date_time-bcb-d-1_34.dll.rsp" && "C:/Programme/Borland/BDS/4.0/bin/implib" "X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\boost_date_time-bcb-d-1_34.lib" "X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\boost_date_time-bcb-d-1_34.dll" + + +Borland Implib Version 3.0.22 Copyright (c) 1991, 2000 Inprise Corporation + + + + +"C:/Programme/Borland/BDS/4.0/Bin/bcc32.exe" -j5 -g255 -q -c -P -Ve -Vx -a8 -b- -IX:/spirit-1.6.3/boost -v -Od -tWC -tWR -tWC -tWD -WM- -DBOOST_ALL_DYN_LINK=1 -DBOOST_ALL_NO_LIB=1 -DDATE_TIME_INLINE -I".." -I"C:/Programme/Borland/BDS/4.0/include/" -o"X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\date_generators.obj" "..\libs\date_time\src\gregorian\date_generators.cpp" + +..\libs\date_time\src\gregorian\date_generators.cpp: + +file X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\boost_date_time-bcb-d-1_34.dll.rsp + +"X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\greg_month.obj" + +"X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\greg_weekday.obj" + +"X:\boost-regression\results\boost\bin.v2\libs\date_time\build\borland-5.8.2\debug\date_generators.obj" + + + + \ No newline at end of file diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/misfire.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/misfire.xml new file mode 100644 index 0000000000..1337f78966 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/misfire.xml @@ -0,0 +1,16 @@ + + + +"c:/progra~1/borland/bds/4.0/bin/bcc32.exe" -j5 -g255 -q -c -P -Ve -Vx -a8 -b- -v -Od -tWC -tWR -tWC -WM- -DBOOST_ALL_NO_LIB=1 -DBOOST_CONFIG_NO_LIB=1 -DBOOST_DYN_LINK=1 -I".." -I"c:/progra~1/borland/bds/4.0/include/" -o"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\status\config_link_test.test\borland-5.8.2\debug\main.obj" "g:\boost\rc-1-34\boost\libs\config\test\link\main.cpp" + +g:\boost\rc-1-34\boost\libs\config\test\link\main.cpp: + + +set "PATH=c:/progra~1/borland/bds/4.0/bin/;%PATH%" + "c:/progra~1/borland/bds/4.0/bin/bcc32.exe" -v -q -v -v -tWD -tWC -tWR -tWC -WM- -L"c:/progra~1/borland/bds/4.0/lib" -e"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\status\config_link_test.test\borland-5.8.2\debug\config_link_test.exe" @"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\status\config_link_test.test\borland-5.8.2\debug\config_link_test.exe.rsp" + + + + + + \ No newline at end of file diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/no-run.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/no-run.xml new file mode 100644 index 0000000000..1c277576a7 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/no-run.xml @@ -0,0 +1,24 @@ + + + +call "c:\Program Files\Microsoft Visual Studio\VC98\Bin\VCVARS32.BAT" >nul +cl /Zm800 -nologo @"g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax_test.obj.rsp" + +minmax_test.cpp + +file g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe.rsp + +"g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax_test.obj" + + + +call "c:\Program Files\Microsoft Visual Studio\VC98\Bin\VCVARS32.BAT" >nul +link /NOLOGO /INCREMENTAL:NO /subsystem:console /out:"g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe" @"g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe.rsp" + if %ERRORLEVEL% NEQ 0 EXIT %ERRORLEVEL% + if exist "g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe.manifest" ( + mt -nologo -manifest "g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe.manifest" "-outputresource:g:\boost\rc-1-34\results\boost\bin.v2\libs\algorithm\minmax\test\minmax.test\msvc-6.5~release\release\threading-multi\minmax.exe;1" + ) + + + + \ No newline at end of file diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/run_pyd.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/run_pyd.xml new file mode 100644 index 0000000000..f2ccfa807c --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/run_pyd.xml @@ -0,0 +1,57 @@ + + + +call "C:\Program Files (x86)\Microsoft Visual Studio 8\VC\vcvarsall.bat" amd64 >nul +cl /Zm800 -nologo @"Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test.obj.rsp" + +python_test.cpp + +file Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd.rsp + +"Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test.obj" + +"Z:\results\boost\bin.v2\libs\python\build\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\boost_python-vc80-mt-1_34.lib" + + + +call "C:\Program Files (x86)\Microsoft Visual Studio 8\VC\vcvarsall.bat" amd64 >nul +link /NOLOGO /INCREMENTAL:NO /DLL /subsystem:console /out:"Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd" /IMPLIB:"Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext-vc80-mt-1_34.lib" /LIBPATH:"c:\python25\libs" @"Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd.rsp" + if %ERRORLEVEL% NEQ 0 EXIT %ERRORLEVEL% + if exist "Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd.manifest" ( + mt -nologo -manifest "Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd.manifest" "-outputresource:Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd;2" + ) + + Creating library Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext-vc80-mt-1_34.lib and object Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext-vc80-mt-1_34.exp + + + +EXIT STATUS: 0 + + + + +call "C:\Program Files (x86)\Microsoft Visual Studio 8\VC\vcvarsall.bat" amd64 >nul +cl /Zm800 -nologo @"Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test.obj.rsp" + +python_test.cpp + +file Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd.rsp + +"Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test.obj" + +"Z:\results\boost\bin.v2\libs\python\build\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\boost_python-vc80-mt-1_34.lib" + + + +call "C:\Program Files (x86)\Microsoft Visual Studio 8\VC\vcvarsall.bat" amd64 >nul +link /NOLOGO /INCREMENTAL:NO /DLL /subsystem:console /out:"Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd" /IMPLIB:"Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext-vc80-mt-1_34.lib" /LIBPATH:"c:\python25\libs" @"Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd.rsp" + if %ERRORLEVEL% NEQ 0 EXIT %ERRORLEVEL% + if exist "Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd.manifest" ( + mt -nologo -manifest "Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd.manifest" "-outputresource:Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext.pyd;2" + ) + + Creating library Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext-vc80-mt-1_34.lib and object Z:\results\boost\bin.v2\libs\parameter\test\python_test.test\msvc-8.0\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\python_test_ext-vc80-mt-1_34.exp + + + + \ No newline at end of file diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-case.xml b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-case.xml new file mode 100644 index 0000000000..4461b25ec7 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-case.xml @@ -0,0 +1,43 @@ + + + +"c:/progra~1/borland/bds/4.0/bin/bcc32.exe" -j5 -g255 -q -c -P -Ve -Vx -a8 -b- -v -Od -tWC -tWR -tWC -tWD -WM- -DBOOST_ALL_NO_LIB=1 -DBOOST_DYN_LINK=1 -I".." -I"c:/progra~1/borland/bds/4.0/include/" -o"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\libs\config\test\link\borland-5.8.2\debug\link_test.obj" "..\libs\config\test\link\link_test.cpp" + +..\libs\config\test\link\link_test.cpp: + +file C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.dll.rsp + +"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\libs\config\test\link\borland-5.8.2\debug\link_test.obj" + + + + + set "PATH=c:/progra~1/borland/bds/4.0/bin/;%PATH%" + "c:/progra~1/borland/bds/4.0/bin/bcc32.exe" -v -q -v -v -tWD -tWC -tWR -tWC -tWD -WM- -L"c:/progra~1/borland/bds/4.0/lib" -e"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.dll" @"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.dll.rsp" && "c:/progra~1/borland/bds/4.0/bin/implib" "C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.lib" "C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.dll" + + +Borland Implib Version 3.0.22 Copyright (c) 1991, 2000 Inprise Corporation + +file C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\status\config_link_test.test\borland-5.8.2\debug\config_link_test.exe.rsp + +"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\status\config_link_test.test\borland-5.8.2\debug\main.obj" + +"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\libs\config\test\link\borland-5.8.2\debug\link_test-bcb-d-1_34.lib" + + + + + +"c:/progra~1/borland/bds/4.0/bin/bcc32.exe" -j5 -g255 -q -c -P -Ve -Vx -a8 -b- -v -Od -tWC -tWR -tWC -WM- -DBOOST_ALL_NO_LIB=1 -DBOOST_CONFIG_NO_LIB=1 -DBOOST_DYN_LINK=1 -I".." -I"c:/progra~1/borland/bds/4.0/include/" -o"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\status\config_link_test.test\borland-5.8.2\debug\main.obj" "g:\boost\rc-1-34\boost\libs\config\test\link\main.cpp" + +g:\boost\rc-1-34\boost\libs\config\test\link\main.cpp: + + +set "PATH=c:/progra~1/borland/bds/4.0/bin/;%PATH%" + "c:/progra~1/borland/bds/4.0/bin/bcc32.exe" -v -q -v -v -tWD -tWC -tWR -tWC -WM- -L"c:/progra~1/borland/bds/4.0/lib" -e"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\status\config_link_test.test\borland-5.8.2\debug\config_link_test.exe" @"C:\Users\Misha\Stuff\boost\RC_1_34_0\boost\tools\regression\test\test-cases\borland\actual\status\config_link_test.test\borland-5.8.2\debug\config_link_test.exe.rsp" + + + + + + \ No newline at end of file diff --git a/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-driver.xsl b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-driver.xsl new file mode 100644 index 0000000000..4db218926a --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-driver.xsl @@ -0,0 +1,19 @@ + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_re_match/expected/test_re_match.xml b/tools/regression/xsl_reports/test/test-components/test_re_match/expected/test_re_match.xml new file mode 100644 index 0000000000..9e959887c0 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_re_match/expected/test_re_match.xml @@ -0,0 +1,48 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_re_match/test-driver.xsl b/tools/regression/xsl_reports/test/test-components/test_re_match/test-driver.xsl new file mode 100644 index 0000000000..83409521fa --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_re_match/test-driver.xsl @@ -0,0 +1,33 @@ + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_re_match/test_re_match.xml b/tools/regression/xsl_reports/test/test-components/test_re_match/test_re_match.xml new file mode 100644 index 0000000000..3841f782d7 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_re_match/test_re_match.xml @@ -0,0 +1,57 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_test_case_status/a.xml b/tools/regression/xsl_reports/test/test-components/test_test_case_status/a.xml new file mode 100644 index 0000000000..dd1535442a --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_test_case_status/a.xml @@ -0,0 +1,10 @@ + + + + + + + + + + \ No newline at end of file diff --git a/tools/regression/xsl_reports/test/test-components/test_test_case_status/expected/a.xml b/tools/regression/xsl_reports/test/test-components/test_test_case_status/expected/a.xml new file mode 100644 index 0000000000..77cfcb857f --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_test_case_status/expected/a.xml @@ -0,0 +1,2 @@ + +expectedexpectedexpectedsuccess-unexpectedfail-unexpectedunusable diff --git a/tools/regression/xsl_reports/test/test-components/test_test_case_status/explicit-failures-markup.xml.test b/tools/regression/xsl_reports/test/test-components/test_test_case_status/explicit-failures-markup.xml.test new file mode 100644 index 0000000000..f0a71b1cb9 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_test_case_status/explicit-failures-markup.xml.test @@ -0,0 +1,12 @@ + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_test_case_status/test-driver.xsl b/tools/regression/xsl_reports/test/test-components/test_test_case_status/test-driver.xsl new file mode 100644 index 0000000000..b1212939a9 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_test_case_status/test-driver.xsl @@ -0,0 +1,27 @@ + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_test_structure/a.xml b/tools/regression/xsl_reports/test/test-components/test_test_structure/a.xml new file mode 100644 index 0000000000..c2fba7f225 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_test_structure/a.xml @@ -0,0 +1,6 @@ + + + some_comment + + + \ No newline at end of file diff --git a/tools/regression/xsl_reports/test/test-components/test_test_structure/expected/a.xml b/tools/regression/xsl_reports/test/test-components/test_test_structure/expected/a.xml new file mode 100644 index 0000000000..67090fdb21 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_test_structure/expected/a.xml @@ -0,0 +1,2 @@ + +some_commentsome_comment diff --git a/tools/regression/xsl_reports/test/test-components/test_test_structure/explicit-failures-markup.xml.test b/tools/regression/xsl_reports/test/test-components/test_test_structure/explicit-failures-markup.xml.test new file mode 100644 index 0000000000..4872ee439f --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_test_structure/explicit-failures-markup.xml.test @@ -0,0 +1,6 @@ + + + + + diff --git a/tools/regression/xsl_reports/test/test-components/test_test_structure/test-driver.xsl b/tools/regression/xsl_reports/test/test-components/test_test_structure/test-driver.xsl new file mode 100644 index 0000000000..8739edb486 --- /dev/null +++ b/tools/regression/xsl_reports/test/test-components/test_test_structure/test-driver.xsl @@ -0,0 +1,22 @@ + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/test/test.py b/tools/regression/xsl_reports/test/test.py new file mode 100644 index 0000000000..0a19491b94 --- /dev/null +++ b/tools/regression/xsl_reports/test/test.py @@ -0,0 +1,34 @@ +import sys + +sys.path.append( '..' ) + +import os + +import boost_wide_report +import common +import utils +import shutil +import time + +tag = "CVS-HEAD" + +if os.path.exists( "results/incoming/CVS-HEAD/processed/merged" ): + shutil.rmtree( "results/incoming/CVS-HEAD/processed/merged" ) + +boost_wide_report.ftp_task = lambda ftp_site, site_path, incoming_dir: 1 +boost_wide_report.unzip_archives_task = lambda incoming_dir, processed_dir, unzip: 1 + +boost_wide_report.execute_tasks( + tag = tag + , user = None + , run_date = common.format_timestamp( time.gmtime() ) + , comment_file = os.path.abspath( "comment.html" ) + , results_dir = os.path.abspath( "results" ) + , output_dir = os.path.abspath( "output" ) + , reports = [ "x", "ds", "dd", "dsr", "ddr", "us", "ud", "usr", "udr" ] + , warnings = [ 'Warning text 1', 'Warning text 2' ] + , extended_test_results = os.path.abspath( "output/extended_test_results.xml" ) + , dont_collect_logs = 1 + , expected_results_file = os.path.abspath( "expected_results.xml" ) + , failures_markup_file = os.path.abspath( "explicit-failures-markup.xml" ) + ) diff --git a/tools/regression/xsl_reports/test/test_boost_wide_report.py b/tools/regression/xsl_reports/test/test_boost_wide_report.py new file mode 100644 index 0000000000..f7d52fc2ff --- /dev/null +++ b/tools/regression/xsl_reports/test/test_boost_wide_report.py @@ -0,0 +1,36 @@ +import unittest +import sys +import time + +sys.path.append( ".." ) + +import boost_wide_report + +class test_boost_wide_report(unittest.TestCase): + def test_diff( self ): + test_cases = [ + ( [] + , [] + , ( [], [] ) ) + , ( [ boost_wide_report.file_info( "a", 1, time.localtime( 0 ) ) ] + , [] + , ( [ "a" ], [] ) ) + , ( [] + , [ boost_wide_report.file_info( "a", 1, time.localtime( 0 ) ) ] + , ( [], [ "a" ] ) ) + , ( [ boost_wide_report.file_info( "a", 1, time.localtime( 0 ) ) ] + , [ boost_wide_report.file_info( "a", 1, time.localtime( 1 ) ) ] + , ( [ "a" ], [] ) ) + ] + + for test_case in test_cases: + source_dir_content = test_case[0] + destination_dir_content = test_case[1] + expected_result = test_case[2] + d = boost_wide_report.diff( source_dir_content, destination_dir_content ) + self.failUnlessEqual( d, expected_result ) + +if __name__ == '__main__': + unittest.main() + + diff --git a/tools/regression/xsl_reports/test_results.xsd b/tools/regression/xsl_reports/test_results.xsd new file mode 100644 index 0000000000..bd54208488 --- /dev/null +++ b/tools/regression/xsl_reports/test_results.xsd @@ -0,0 +1,107 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/utils/__init__.py b/tools/regression/xsl_reports/utils/__init__.py new file mode 100644 index 0000000000..1400c638e3 --- /dev/null +++ b/tools/regression/xsl_reports/utils/__init__.py @@ -0,0 +1,12 @@ + +from accept_args import * +from char_translation_table import * +from check_existance import * +from checked_system import * +from libxslt import * +from log import * +from makedirs import * +from tar import * +from zip import * + +import sourceforge diff --git a/tools/regression/xsl_reports/utils/accept_args.py b/tools/regression/xsl_reports/utils/accept_args.py new file mode 100644 index 0000000000..b08739f40b --- /dev/null +++ b/tools/regression/xsl_reports/utils/accept_args.py @@ -0,0 +1,30 @@ + +import getopt +import re +import sys + +def accept_args( args_spec, args, options, usage ): + + defaults_num = len(options) + + ( option_pairs, rest_args ) = getopt.getopt( args, '', args_spec ) + map( lambda x: options.__setitem__( x[0], x[1] ), option_pairs ) + + if ( options.has_key( '--help' ) or len( options.keys() ) == defaults_num ): + usage() + sys.exit( 1 ) + + if len( rest_args ) > 0 and rest_args[0][0] == '@': + f = open( rest_args[0][1:], 'r' ) + config_lines = f.read().splitlines() + f.close() + for l in config_lines: + if re.search( r'^\s*#', l ): continue + if re.search( r'^\s*$', l ): continue + m = re.match( r'^(?P.*?)=(?P.*)', l ) + if m: + options[ '--%s' % m.group( 'name' ) ] = m.group( 'value' ) + else: + raise 'Invalid format of config line "%s"' % l + + return rest_args diff --git a/tools/regression/xsl_reports/utils/char_translation_table.py b/tools/regression/xsl_reports/utils/char_translation_table.py new file mode 100644 index 0000000000..c2d8fb6c95 --- /dev/null +++ b/tools/regression/xsl_reports/utils/char_translation_table.py @@ -0,0 +1,13 @@ + +import string + +def chr_or_question_mark( c ): + if chr(c) in string.printable and c < 128 and c not in ( 0x09, 0x0b, 0x0c ): + return chr(c) + else: + return '?' + +char_translation_table = string.maketrans( + ''.join( map( chr, range(0, 256) ) ) + , ''.join( map( chr_or_question_mark, range(0, 256) ) ) + ) diff --git a/tools/regression/xsl_reports/utils/check_existance.py b/tools/regression/xsl_reports/utils/check_existance.py new file mode 100644 index 0000000000..9e3d0e7b21 --- /dev/null +++ b/tools/regression/xsl_reports/utils/check_existance.py @@ -0,0 +1,9 @@ + +import os + +def check_existance( name ): + a = os.popen( '%s --version' % name ) + output = a.read() + rc = a.close() + if rc is not None: + raise Exception( '"%s" is required' % name ) diff --git a/tools/regression/xsl_reports/utils/checked_system.py b/tools/regression/xsl_reports/utils/checked_system.py new file mode 100644 index 0000000000..bdb8e8f8e6 --- /dev/null +++ b/tools/regression/xsl_reports/utils/checked_system.py @@ -0,0 +1,22 @@ + +import os +import string +import sys + +def system( commands ): + if sys.platform == 'win32': + f = open( 'tmp.cmd', 'w' ) + f.write( string.join( commands, '\n' ) ) + f.close() + rc = os.system( 'tmp.cmd' ) + return rc + else: + rc = os.system( '&&'.join( commands ) ) + return rc + + +def checked_system( commands, valid_return_codes = [ 0 ] ): + rc = system( commands ) + if rc not in [ 0 ] + valid_return_codes: + raise Exception( 'Command sequence "%s" failed with return code %d' % ( commands, rc ) ) + return rc diff --git a/tools/regression/xsl_reports/utils/libxslt.py b/tools/regression/xsl_reports/utils/libxslt.py new file mode 100644 index 0000000000..3ed13e6d08 --- /dev/null +++ b/tools/regression/xsl_reports/utils/libxslt.py @@ -0,0 +1,37 @@ + +import utils.makedirs +import os.path +import os +import sys + + +def xslt_param( path ): + path = path.replace( '\\', '/' ) + if sys.platform == 'win32': + path = path.replace( ' ', '%20' ) + return path + + +def libxslt( log, xml_file, xsl_file, output_file, parameters = None ): + + utils.makedirs( os.path.dirname( output_file ) ) + + if sys.platform == 'win32': + os.chdir( os.path.dirname( xsl_file ) ) + + transform_command = 'xsltproc' + transform_command = transform_command + ' -o ' + '"%s"' % xslt_param( output_file ) + + if parameters is not None: + for i in parameters: + if parameters[i]: + parameters[i] = xslt_param( parameters[i] ) + transform_command = transform_command + ' --param %s "\'%s\'" ' % ( i, parameters[ i ] ) + + transform_command = transform_command + ' "%s" ' % xslt_param( xsl_file ) + transform_command = transform_command + ' "%s" ' % xslt_param( xml_file ) + log( transform_command ) + rc = os.system( transform_command ) + if rc != 0: + raise Exception( '"%s" failed with return code %d' % ( transform_command, rc ) ) + diff --git a/tools/regression/xsl_reports/utils/log.py b/tools/regression/xsl_reports/utils/log.py new file mode 100644 index 0000000000..28b1366f88 --- /dev/null +++ b/tools/regression/xsl_reports/utils/log.py @@ -0,0 +1,18 @@ + +import inspect +import sys + +def log_level(): + frames = inspect.stack() + level = 0 + for i in frames[ 3: ]: + if i[0].f_locals.has_key( '__log__' ): + level = level + i[0].f_locals[ '__log__' ] + return level + + +def stdlog( message ): + sys.stderr.write( '# ' + ' ' * log_level() + message + '\n' ) + sys.stderr.flush() + +log = stdlog diff --git a/tools/regression/xsl_reports/utils/makedirs.py b/tools/regression/xsl_reports/utils/makedirs.py new file mode 100644 index 0000000000..94b68d32f1 --- /dev/null +++ b/tools/regression/xsl_reports/utils/makedirs.py @@ -0,0 +1,7 @@ + +import os.path +import os + +def makedirs( path ): + if not os.path.exists( path ): + os.makedirs( path ) diff --git a/tools/regression/xsl_reports/utils/send_mail.py b/tools/regression/xsl_reports/utils/send_mail.py new file mode 100644 index 0000000000..d0ed98fd18 --- /dev/null +++ b/tools/regression/xsl_reports/utils/send_mail.py @@ -0,0 +1,13 @@ + +import smtplib + +def send_mail( mail, subject, msg = '' ): + smtp_server = smtplib.SMTP( 'mail.%s' % mail.split( '@' )[-1] ) + smtp_server.sendmail( + mail + , [ mail ] + , 'Subject: %s\n' % subject + + 'To: %s\n' % mail + + '\n' + + msg + ) diff --git a/tools/regression/xsl_reports/utils/sourceforge.py b/tools/regression/xsl_reports/utils/sourceforge.py new file mode 100644 index 0000000000..0c6b085286 --- /dev/null +++ b/tools/regression/xsl_reports/utils/sourceforge.py @@ -0,0 +1,48 @@ + +import utils.checked_system +import os +import sys + +site_dir = '/home/groups/b/bo/boost/htdocs/' + +def download( source, destination, user ): + if sys.platform == 'win32': + destination = os.popen( 'cygpath "%s"' % destination ).read().splitlines()[0] + + utils.checked_system( [ + 'rsync -v -r -z --progress %(user)s@shell.sourceforge.net:%(site_dir)s%(source)s %(dest)s' + % { 'user': user, 'site_dir': site_dir, 'source': source, 'dest': destination } + ] ) + + +def upload( source, destination, user ): + if sys.platform == 'win32': + source = os.popen( 'cygpath "%s"' % source ).read().splitlines()[0] + + utils.checked_system( [ + 'rsync -v -r -z --progress %(source)s %(user)s@shell.sourceforge.net:%(site_dir)s%(dest)s' + % { 'user': user, 'site_dir': site_dir, 'source': source, 'dest': destination } + ] ) + + +def checked_system( commands, user, background = False ): + if not background: + cmd = 'ssh -l %s shell.sourceforge.net "%s"' + else: + cmd = 'ssh -f -l %s shell.sourceforge.net "%s"' + + utils.checked_system( + [ cmd % ( user, '&&'.join( commands ) ) ] + ) + + +def untar( archive, user, background ): + checked_system( + [ + 'cd %s' % os.path.join( site_dir, os.path.dirname( archive ) ) + , 'tar -x -z --overwrite --mode=+w -f %s' % os.path.basename( archive ) + , 'rm -f %s' % archive + ] + , user = user + , background = background + ) diff --git a/tools/regression/xsl_reports/utils/tar.py b/tools/regression/xsl_reports/utils/tar.py new file mode 100644 index 0000000000..19deb1992b --- /dev/null +++ b/tools/regression/xsl_reports/utils/tar.py @@ -0,0 +1,16 @@ + +import utils.checked_system +import os.path + +def tar( source_dir, archive_name ): + utils.checked_system( [ + 'cd %s' % source_dir + , 'tar -c -f ../%s -z *' % archive_name + ] ) + +def untar( archive_path ): + #utils.checked_system( [ 'tar -xjf "%s"' % archive_path ] ) + utils.checked_system( [ + 'cd %s' % os.path.dirname( archive_path ) + , 'tar -xjf "%s"' % os.path.basename( archive_path ) + ] ) diff --git a/tools/regression/xsl_reports/utils/zip.py b/tools/regression/xsl_reports/utils/zip.py new file mode 100644 index 0000000000..7473aa0051 --- /dev/null +++ b/tools/regression/xsl_reports/utils/zip.py @@ -0,0 +1,12 @@ + +import zipfile +import os.path + +def unzip( archive_path, result_dir ): + z = zipfile.ZipFile( archive_path, 'r', zipfile.ZIP_DEFLATED ) + for f in z.infolist(): + result = open( os.path.join( result_dir, f.filename ), 'wb' ) + result.write( z.read( f.filename ) ) + result.close() + + z.close() diff --git a/tools/regression/xsl_reports/xsl/add_expected_results.xsl b/tools/regression/xsl_reports/xsl/add_expected_results.xsl new file mode 100644 index 0000000000..6771f0034f --- /dev/null +++ b/tools/regression/xsl_reports/xsl/add_expected_results.xsl @@ -0,0 +1,144 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + success + + + fail + + + success + + + + + + + + + + + no + + yes + + + + + + + fail + + + + + + fail + + + success + + + + + + + + + + expected + unexpected + + + + + + expected + unexpected + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/common.xsl b/tools/regression/xsl_reports/xsl/common.xsl new file mode 100644 index 0000000000..0029eeaebb --- /dev/null +++ b/tools/regression/xsl_reports/xsl/common.xsl @@ -0,0 +1,182 @@ + + + + + + + + + + + + + + + + + + + yes + a + + + no + z + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ + + + + +
+ +
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + [   ] + + + [  ] + + + [  ] + + + + + + + + + +
+ + + diff --git a/tools/regression/xsl_reports/xsl/html/issues_legend.html b/tools/regression/xsl_reports/xsl/html/issues_legend.html new file mode 100644 index 0000000000..6274048b55 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/html/issues_legend.html @@ -0,0 +1,36 @@ + + +
+ + + + +
+ + + + + + + + + +
+ + +
<toolset>
+ 		Failure on a newly added test/compiler.
+ + +
<toolset>
+ 		Unexpected failure.
+
+
diff --git a/tools/regression/xsl_reports/xsl/html/library_developer_legend.html b/tools/regression/xsl_reports/xsl/html/library_developer_legend.html new file mode 100644 index 0000000000..405e52ab4b --- /dev/null +++ b/tools/regression/xsl_reports/xsl/html/library_developer_legend.html @@ -0,0 +1,72 @@ + + +
+ + + + + +
+ + + + + + + + + + + + + +
+ + +
pass
+ 		Success.
+ + +
pass
+ 		Unexpected success.
+ + +
fail
+ 		Expected failure.
+ 		+ + + + + + + + + + + + + +
+ + +
fail
+ 		Failure on a newly added test/compiler.
+ + +
fail
+ 		Unexpected failure.
+ + +
n/a
+ 		The library author marked it as unusable on particular platform/toolset.
+
+
diff --git a/tools/regression/xsl_reports/xsl/html/library_user_legend.html b/tools/regression/xsl_reports/xsl/html/library_user_legend.html new file mode 100644 index 0000000000..5175f04271 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/html/library_user_legend.html @@ -0,0 +1,65 @@ + + +
+ + + + + +
+ + + + + + + + + +
+ + +
pass
+ 		+ The test passes. +
+ + +
fail
+ 		+ A known test failure; click on the link to see the log. +
+ 		+ + + + + + + + + +
+ + +
unexp.
+ 		+ The test is known to pass, but is currently failing; + click on the link to see the log. +
+ + +
n/a
+ 		+ The library author marked it as unusable on particular platform/toolset. +
+
+
diff --git a/tools/regression/xsl_reports/xsl/html/make_tinyurl.html b/tools/regression/xsl_reports/xsl/html/make_tinyurl.html new file mode 100644 index 0000000000..2de8830106 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/html/make_tinyurl.html @@ -0,0 +1,24 @@ + + +
+ + + +TinyUrl + +
diff --git a/tools/regression/xsl_reports/xsl/html/master.css b/tools/regression/xsl_reports/xsl/html/master.css new file mode 100644 index 0000000000..8e643efebf --- /dev/null +++ b/tools/regression/xsl_reports/xsl/html/master.css @@ -0,0 +1,525 @@ +/* + +Copyright MetaCommunications, Inc. 2003-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) + +*/ + +/* All reports */ + +body +{ + background-color: white; +} + +body.user-toc +{ + background-color: #f0f0f0; +} + +body.developer-toc +{ + background-color: #f0f5ff; +} + +span.super +{ + vertical-align: super; + font-size: 80%; + margin-left: 3pt; +} + +h1.page-title +{ + text-align: left; + text-transform: capitalize; + margin-top: 10pt; + margin-bottom: 10pt; +} + +img +{ + display: inline; +} + + a.hover-link:link +,a.hover-link:visited +,a.hover-link:active +{ + color: black; + text-decoration: none; +} + +a.hover-link:hover +{ + color: black; + text-decoration: underline; +} + +div.legend +{ + width: 80%; + background-color: #f5f5f5; + margin-top: 10pt; +} + +div.comment +{ + width: 80%; + background-color: #f5f5f5; + padding-left: 10pt; + padding-right: 10pt; + padding-bottom: 10pt; +} + +div.tinyurl +{ + margin-top: 10pt; +} + +table.header-table +{ + margin-left: 10pt; + margin-top: 20pt; + margin-bottom: 10pt; + width: 80%; +} + +td.header-item +{ + text-align: left; + vertical-align: top; + font-weight: bold; +} + +td.header-item-content +{ + padding-left: 20pt; + padding-bottom: 10pt; +} + +td.legend-item +{ + padding-left: 5pt; +/* padding-top: 2pt;*/ +} + +div.acknowledgement +{ + text-align: left; + margin-top: 10pt; + margin-left: 5pt; + margin-bottom: 10pt; +} + +div.report-info +{ + text-align: left; + margin-bottom: 10pt; + width: 80%; +} + +div.purpose +{ + text-align: left; + margin-left: 5pt; + margin-top: 10pt; +} + + +div.library-name +{ + margin-top: 20pt; + margin-bottom: 10pt; + text-align: left; + font-size: 125%; + font-weight: bold; +} + +table.summary-table +,table.library-table +{ + border-collapse: collapse; + border: 2px solid black; + margin: 5px; +} + + table.summary-table td +,table.library-table td +{ + text-align: center; + border-left: 1px solid black; + border-right: 1px solid black; +} + + a.log-link:link +,a.log-link:visited +{ + color: black; +/* text-decoration: none; */ +} + + a.log-link:active +,a.log-link:hover +,a.legend-link:link +,a.legend-link:visited +,a.legend-link:active +,a.legend-link:hover +{ + color: black; + text-decoration: underline; +} + + td.toolset-name +,td.required-toolset-name +{ + vertical-align: middle; + padding-left: 3pt; + padding-right: 3pt; + word-spacing: -3pt; +} + +td.required-toolset-name +{ + font-weight: bold; +} + +td.library-corner-case-header +{ +} + +tr.summary-row-first td +, tr.library-row-first td +{ + border-top: 1px solid gray; + border-bottom: 0px; +} + +tr.summary-row-last td +, tr.library-row-last td +{ + border-top: 0px; + border-bottom: 1px solid gray; +} + +tr.summary-row-single td +, tr.library-row-single td +{ + border-top: 1px solid gray; + border-bottom: 1px solid gray; +} + +tr.summary-row td +, tr.library-row td +{ + border-bottom: 0px; + border-top: 0px; +} + + td.library-success-expected +,td.library-fail-expected +,td.library-user-fail-expected +,td.library-user-success +,td.summary-expected +,td.summary-user-fail-expected +,td.summary-user-success +,td.summary-unknown-status +{ + width: 60pt; + text-align: center; + background-color: lightgreen; + border-left: 1px solid black; + border-right: 1px solid black; + padding-left: 2pt; + padding-right: 2pt; +} + +td.summary-unknown-status +{ + background-color: white; +} + + td.library-success-unexpected +,td.summary-success-unexpected +{ + width: 60pt; + text-align: center; + background-color: green; + font-weight: bold; + color: white; + border: 0px; + padding-left: 2pt; + padding-right: 2pt; +} + + + tr.summary-row td.summary-fail-unexpected +,tr.summary-row-first td.summary-fail-unexpected +,tr.summary-row-last td.summary-fail-unexpected +,tr.summary-row-single td.summary-fail-unexpected + +,tr.summary-row td.summary-user-fail-unexpected +,tr.summary-row-first td.summary-user-fail-unexpected +,tr.summary-row-last td.summary-user-fail-unexpected +,tr.summary-row-single td.summary-user-fail-unexpected + +,tr.library-row td.library-user-fail-unexpected +,tr.library-row-first td.library-user-fail-unexpected +,tr.library-row-last td.library-user-fail-unexpected +,tr.library-row-single td.library-user-fail-unexpected +{ + width: 60pt; + text-align: center; + background-color: red; + color: black; + border: 2px solid black; + padding-left: 2pt; + padding-right: 2pt; +} + + tr.summary-row td.summary-missing +, tr.summary-row-first td.summary-missing +, tr.summary-row-last td.summary-missing +, tr.summary-row-single td.summary-missing + +, tr.library-row td.library-missing +, tr.library-row-first td.library-missing +, tr.library-row-last td.library-missing +, tr.library-row-single td.library-missing +{ + width: 60pt; + text-align: center; + background-color: white; + color: black; + border: 2px solid black; + padding-left: 2pt; + padding-right: 2pt; +} + + tr.summary-row td.summary-unusable +, tr.summary-row-first td.summary-unusable +, tr.summary-row-last td.summary-unusable +, tr.summary-row-single td.summary-unusable + +, tr.library-row td.library-unusable +, tr.library-row-first td.library-unusable +, tr.library-row-last td.library-unusable +, tr.library-row-single td.library-unusable +{ + width: 60pt; + text-align: center; + background-color: silver; + color: black; + border-top: 2px solid black; + border-bottom: 2px solid black; + border-left: 2px solid black; + border-right: 2px solid black; + padding-left: 2pt; + padding-right: 2pt; +} + +/* Summary */ + +table.summary-table td.library-name +{ + width: 100pt; + padding: 0pt; + border-top: 1px solid gray; + border-bottom: 1px solid gray; +} + + tr.summary-row td.summary-user-fail-unexpected +, tr.summary-row-first td.summary-user-fail-unexpected +, tr.summary-row-last td.summary-user-fail-unexpected +, tr.summary-row-single td.summary-user-fail-unexpected +{ + width: 60pt; + text-align: center; + background-color: yellow; + color: black; + border: 2px solid black; + padding-left: 2pt; + padding-right: 2pt; +} + + tr.summary-row td.summary-fail-unexpected-new +, tr.summary-row-first td.summary-fail-unexpected-new +, tr.summary-row-last td.summary-fail-unexpected-new +, tr.summary-row-single td.summary-fail-unexpected-new + +, tr.library-row td.library-fail-unexpected-new +, tr.library-row-first td.library-fail-unexpected-new +, tr.library-row-last td.library-fail-unexpected-new +, tr.library-row-single td.library-fail-unexpected-new +{ + width: 60pt; + text-align: center; + background-color: yellow; + color: black; + border: 2px solid black; +} + +/* Detailed */ + +.library-conf-problem +{ + font-size: 70%; + font-weight: normal; +} + +div.library-toc +{ + margin: 5pt; +} + + +li.library-toc-entry +{ + margin-left: 5pt; + list-style-type: square; +} + + +div.library-footer +{ + margin: 5px; +} + + +table.library-table td.test-name +{ + width: 150pt; + padding-left: 6pt; + padding-right: 6pt; + border-right: 0; + border-top: 1px solid gray; + border-bottom: 1px solid gray; +} + +table.library-table td.test-type +{ + padding-right: 5px; + border-left: 0; + border-right: 0; + border-top: 1px solid gray; + border-bottom: 1px solid gray; + text-align: right; +} + + tr.library-row td.library-fail-unexpected +, tr.library-row-first td.library-fail-unexpected +, tr.library-row-last td.library-fail-unexpected +, tr.library-row-single td.library-fail-unexpected +{ + width: 60pt; + text-align: center; + background-color: red; + font-weight: bold; + color: black; + border: 2px solid black; +} + +td.library-user-fail-expectected +{ + width: 60pt; + text-align: center; + background-color: yellow; + color: black; + border: 0px solid black; +} + +table.library-library-notes +{ + background-color: LemonChiffon; + width: 640px; + margin-left: 5px; + margin-right: 5px; +} + +tr.library-library-note +{ +} + +div.note +{ + padding: 3pt; +} + + +span.note-header +{ + font-weight: bold; +} + +/* Log */ + +div.log-test-title +{ + font-size: 1.5em; + font-weight: bold; + border-bottom: 1px solid black; +} + +div.notes-title +{ + font-weight: bold; + background-color: #ffffcc; +} + +div.notes +{ + padding: 3pt; + background-color: #ffffcc; +} + +div.notes-title +{ + font-weight: bold; +} + +div.log-compiler-output-title +{ + font-weight: bold; +} + +div.log-linker-output-title +{ + font-weight: bold; +} + +div.log-run-output-title +{ + font-weight: bold; +} + + +/* Issues page */ + +table.library-issues-table +{ + border-collapse: collapse; + border: 2px solid black; +} + +table.library-issues-table td +{ + border: 1px solid #c0c0c0; + text-align: center; + margin-right: 5px; +} + +table.library-issues-table td.failures-row +{ + text-align: left; + padding: 0px; +} + + table.issue-box tr.library-row-single td.library-fail-unexpected-new +,table.issue-box tr.library-row-single td.library-fail-unexpected +{ + border: 0px; + font-weight: normal; +} diff --git a/tools/regression/xsl_reports/xsl/html/summary_developer_legend.html b/tools/regression/xsl_reports/xsl/html/summary_developer_legend.html new file mode 100644 index 0000000000..0f82828228 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/html/summary_developer_legend.html @@ -0,0 +1,75 @@ + + +
+ + + + + +
+ + + + + + + + + + + + + +
+ + +
OK
+ 		+ All expected tests pass. +
+ + +
OK
+ 		+ All expected tests pass, and some other tests that were expected to fail + unexpectedly pass as well. +
+ + +
fail
+ 		+ There are some failures on the newly added tests/compiler(s). +
+ 		+ + + + + + + + + +
+ + +
broken
+ 		+ Tests that the library author expects to pass are currently failing. +
+ + +
n/a
+ 		+ The library author marked it as unusable on particular platform/toolset. +
+
+
diff --git a/tools/regression/xsl_reports/xsl/html/summary_user_legend.html b/tools/regression/xsl_reports/xsl/html/summary_user_legend.html new file mode 100644 index 0000000000..4407608120 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/html/summary_user_legend.html @@ -0,0 +1,65 @@ + + +
+ + + + + +
+ + + + + + + + + +
+ + +
 
+ 		+ All library tests are passing. +
+ + +
details
+ 		+ There are some known failures in the tests, click on the link to see the details. +
+ 		+ + + + + + + + + +
+ + +
unexp.
+ 		+ Some tests that the library author expects to pass are currently failing, + click on the link to see the details. +
+ + +
n/a
+ 		+ The library author marked it as unusable on particular platform/toolset. +
+
+
diff --git a/tools/regression/xsl_reports/xsl/issues_page.xsl b/tools/regression/xsl_reports/xsl/issues_page.xsl new file mode 100644 index 0000000000..4faa410d0d --- /dev/null +++ b/tools/regression/xsl_reports/xsl/issues_page.xsl @@ -0,0 +1,223 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Boost regression unresolved issues: <xsl:value-of select="$source"/> + + + + + + + + + Writing document + + + + + + + + + +

+ Unresolved Issues: + +

+ +
+
+ Report Time: +
+
+ Purpose: Provides a list of current unresolved test failures. +
+
+ + + + + + + + + + +

+ + + +

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
testfailures
testfailures
+ + + + + + + + + + + + + + + + library-fail-unexpected-new + + + library-fail-unexpected + + + + + + + + +
+ + + + + +
+
+ + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/links_page.xsl b/tools/regression/xsl_reports/xsl/links_page.xsl new file mode 100644 index 0000000000..ebc4488f50 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/links_page.xsl @@ -0,0 +1,134 @@ + + + + + + + + + + + + + + + + + + + + Writing log file document + + + + + + + +
+ +
+ + + + + + + + + + Boost regression - test run output: <xsl:value-of select="$component"/> + + + +
+
+ Boost regression - test run output: +
+ + + +

+

Notes
+ + + + +

+ + + +

+

Compiler output:
+ 
+                    
+
+

+ + + +

+

Linker output:
+ 
+                    
+
+

+ + + +

+

Lib output:
+

+ See + + +

+

+ + + +

+

Run output:
+ 
+                    
+
+

+ + +
+ + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/produce_expected_results.xsl b/tools/regression/xsl_reports/xsl/produce_expected_results.xsl new file mode 100644 index 0000000000..a47a3acfed --- /dev/null +++ b/tools/regression/xsl_reports/xsl/produce_expected_results.xsl @@ -0,0 +1,31 @@ + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/result_page.xsl b/tools/regression/xsl_reports/xsl/result_page.xsl new file mode 100644 index 0000000000..dbd0fbf919 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/result_page.xsl @@ -0,0 +1,702 @@ + + + + + + + + + + + + + + + + + + + + + + + + developer + user + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + test / toolset + + + + + !!!!!!!!!!!!!!!!!!!1 + + + + + + + + + + + + + required-toolset-name + + + toolset-name + + + + + + + + + + + + + + + + + + + + , + + + + + + + + + + toolset / test + + + + + + + + + r + r + rf + c + cf + + Incorrect test type "" + + + + + + + + + + + + + + + Boost regression: <xsl:value-of select="$source"/> + + + + + + + + Writing document + + + + + + + + + + Boost logo + +

+ + report: + +

+ +
+
+ Report Time: +
+ +
+ Purpose: + + + The purpose of this report is to help a user to find out whether a particular library + works on the particular compiler(s). For CVS "health report", see + developer summary. + + + Provides Boost developers with visual indication of the CVS "health". For user-level + report, see user summary. + + +
+
+ +
+ + + +
+ + + + + + + + + + + + + Writing document + + + + + + + + +
+ Report info +
+
+ Summary +
+ + +
+ Unresolved issues +
+ +
+ + + + +
+ + + +
+ + + + + + + + + + + + + + + + + Writing document + + + + + + + Boost regression: <xsl:value-of select="$library"/>/<xsl:value-of select="$source"/> + + + + + + + + + + Writing document + + + + + + + + + + +

+ + + + / + +

+ +
+ Report Time: +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Corner-case tests
+ + + + + + + + +
+ + + + + + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + library-missing + + + library-unusable + + + + + + + + + + + missing + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
conf. problem
+ + + + + + + + + + + + + library-missing + + + library-unusable + + + library-user-fail-unexpected + + + library-user-fail-expected + + + library-user-success + + + + Unknown status + + + + + + + + + + missing + + + + fail + + + + + unexp. + + + + pass + + + + +
conf. problem
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Writing log file document + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + -single + + + -first + + + -last + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/summary_page.xsl b/tools/regression/xsl_reports/xsl/summary_page.xsl new file mode 100644 index 0000000000..7bf3818c29 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/summary_page.xsl @@ -0,0 +1,361 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Boost regression summary: <xsl:value-of select="$source"/> + + + + + + + + + Writing document + + + + + + + + + +

+ Summary: + +

+ +
+ Report Time: +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + -single + + + -first + + + -last + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + + + + + + + + + + + + + + + + + + summary-unusable + + + summary-missing + + + summary-fail-unexpected + + + summary-fail-unexpected-new + + + summary-success-unexpected + + + summary-expected + + + summary-unknown-status + + + + + + + + + + + n/a + + + + missing + + + + broken + + + + + fail + + + + OK + + + + + + + + + + + + + + + + + summary-unusable + + + summary-missing + + + summary-user-fail-unexpected + + + summary-user-fail-expected + + + summary-user-success + + + summary-unknown-status + + + + + + + + + + + unusable + + + + + missing + + + + + unexp. + + + + + + details + + + + +   + + + + + + + + + + library / toolset + + + + + + required-toolset-name + + + toolset-name + + + + + + + + toolset / library + + + + diff --git a/tools/regression/xsl_reports/xsl/test/test_re_match.xml b/tools/regression/xsl_reports/xsl/test/test_re_match.xml new file mode 100644 index 0000000000..3841f782d7 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/test/test_re_match.xml @@ -0,0 +1,57 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/test/test_re_match.xsl b/tools/regression/xsl_reports/xsl/test/test_re_match.xsl new file mode 100644 index 0000000000..eefd313166 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/test/test_re_match.xsl @@ -0,0 +1,60 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/v2/add_expected_results.xsl b/tools/regression/xsl_reports/xsl/v2/add_expected_results.xsl new file mode 100644 index 0000000000..646b413203 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/add_expected_results.xsl @@ -0,0 +1,269 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Unknown test type "" + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + fail + + + success + + + + + + + + + + + + + + + + + + + + + + + + + + + 0 + + + + + + + + no + + yes + + + + + + + + + + fail + + + + + + fail + + success + + + + + + + + expected + unexpected + + + + + + + + + + + + + + + + + + + + + + + This test case was explicitly marked up in + + status/explicit-failures-markup.xml file in the Boost CVS as "expected to fail", + but is passing. Please consult the notes/output below for more details. + + + + + + + + + + No explanation was provided for this markup. Please contact the library + author(s)/maintainer(s) for more details. + + + + + + + This failure was explicitly marked as expected in + + status/explicit-failures-markup.xml file in the Boost CVS. + Please contact the library author(s)/maintainer(s) for the explanation of this markup. + + + + + + + + + + + + + + + + + + + + + + + + + This test case used to fail in the reference ("last-known-good") release. + + + + + + + This failure was present in the reference ("last-known-good") release. + + + + + + + + + + [Reporting Tools Internal Error] This test case's XML is missing one or more log entries + of the regression run's steps associated with the test case's type (""). + Please contact reporting tools + maintainers about this problem. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/v2/boostbook_log.xsl b/tools/regression/xsl_reports/xsl/v2/boostbook_log.xsl new file mode 100644 index 0000000000..009f0eb27c --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/boostbook_log.xsl @@ -0,0 +1,42 @@ + + + + + + + + + BoostBook build log for <xsl:value-of select="build/@timestamp"/> + + + + + + + + + 
+            
+
+ + + +
+ + \ No newline at end of file diff --git a/tools/regression/xsl_reports/xsl/v2/common.xsl b/tools/regression/xsl_reports/xsl/v2/common.xsl new file mode 100644 index 0000000000..83da5df7ad --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/common.xsl @@ -0,0 +1,657 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + yes + no + + + + + sort hint A + sort hint B + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + unusable + + + fail-unexpected + + + fail-unexpected-new + + + success-unexpected + + + expected + + + other + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + unusable + + + + missing + + + + fail-unexpected + + + + fail-unexpected-new + + + + + fail-expected-unresearched + + + + fail-expected + + + + + success-unexpected + + + + success-expected + + + + unknown + + + + + + + + + + +
+
+ Report Time: +
+ + +
+ Purpose: +
+ + + + +
+ Warning: + + + +
+ + + +
+ + + + + + + + + + + + + Full View + + + + + Release View + + + + + + + + + + + + +
+ +  |  + + + + + + + + _release + + +  |  + + View + + +  |  + + Legend + + +
+ + + + + + + + + + + + + 1 + 2 + + + + + + +   + + + + + + + +   + + + + +   + + + + + + + +   + + + +   + + + + + + + + + + +   + + + + +   + + + + + + + +   + + + + + + + + + + + + + + + 1 + 2 + + + + + +  library / toolset  +  test / toolset  + + + + + + + + + + + + + required-toolset-name + + + toolset-name + + + + + + + + + + + + + - + + + + + + + + + + + + + + + + + + + , + + + + + + + + + + + + + + + + + + + +
+ +
+ + + + + +
+ +
+ + + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + [   ] + + + [  ] + + + [  ] + + + + + + + + + + + + + + + + + + + + + + + +
+ + + diff --git a/tools/regression/xsl_reports/xsl/v2/dump_toolsets.xsl b/tools/regression/xsl_reports/xsl/v2/dump_toolsets.xsl new file mode 100644 index 0000000000..b9058e35d0 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/dump_toolsets.xsl @@ -0,0 +1,39 @@ + + + + + + + + + + + + + + + aka + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/v2/expected_to_1_33_format.xsl b/tools/regression/xsl_reports/xsl/v2/expected_to_1_33_format.xsl new file mode 100644 index 0000000000..71f33d2c1c --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/expected_to_1_33_format.xsl @@ -0,0 +1,32 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/v2/html/issues_legend.html b/tools/regression/xsl_reports/xsl/v2/html/issues_legend.html new file mode 100644 index 0000000000..6274048b55 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/html/issues_legend.html @@ -0,0 +1,36 @@ + + +
+ + + + +
+ + + + + + + + + +
+ + +
<toolset>
+ 		Failure on a newly added test/compiler.
+ + +
<toolset>
+ 		Unexpected failure.
+
+
diff --git a/tools/regression/xsl_reports/xsl/v2/html/library_developer_legend.html b/tools/regression/xsl_reports/xsl/v2/html/library_developer_legend.html new file mode 100644 index 0000000000..009211ac19 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/html/library_developer_legend.html @@ -0,0 +1,82 @@ + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + +
pass
+ 		Success.
+ + +
pass
+ 		Unexpected success; follow the link for more details.
+ + +
fail*
+ 		Expected failure; follow the link for more details.
+ + +
n/a
+ 		The library author marked it as unusable on this particular platform/toolset.
+ + +
fail?
+ 		Unsearched failure; follow the link for more details.
+ + +
fail
+ 		Failure on a newly added test/compiler.
+ + +
fail
+ 		Unexpected failure/regression.
+
+
+ + + + + +
iAn incremental run.
+
diff --git a/tools/regression/xsl_reports/xsl/v2/html/library_user_legend.html b/tools/regression/xsl_reports/xsl/v2/html/library_user_legend.html new file mode 100644 index 0000000000..bae1742e94 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/html/library_user_legend.html @@ -0,0 +1,89 @@ + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + +
pass
+ 		The test successfully passes.
+ + +
fail*
+ 		+ A known failure that the library maintainers are aware about. Please follow the link to + find out how it affects the library's functionality. +
+ + +
unusable
+ 		+ The library author marked it as unusable on this particular platform/toolset. Please + see the corresponding footnote. +
+ + +
fail?
+ 		+ An unsearched failure: the library maintainers are aware of it, but need help with + investigating/addressing it for future releases. Please follow the link to + access the details and find out how it affects library functionality.
+ + +
fail
+ 		+ A new failure on the test/compiler added in this release that hasn't been accounted for yet. + Please follow the link to access the details. +
+ + +
fail
+ 		+ A regression comparing to the previous release. Please follow the link to + access the details. +
+
+
+ + + + + +
iAn incremental run.
+
diff --git a/tools/regression/xsl_reports/xsl/v2/html/make_tinyurl.html b/tools/regression/xsl_reports/xsl/v2/html/make_tinyurl.html new file mode 100644 index 0000000000..e57fb06a4f --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/html/make_tinyurl.html @@ -0,0 +1,22 @@ + + + + + +TinyUrl + diff --git a/tools/regression/xsl_reports/xsl/v2/html/master.css b/tools/regression/xsl_reports/xsl/v2/html/master.css new file mode 100644 index 0000000000..6bc90b22c4 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/html/master.css @@ -0,0 +1,649 @@ +/* + +Copyright MetaCommunications, Inc. 2003-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) + +*/ + +/* All reports */ + +body +{ + background-color: white; +} + +body.user-toc +{ + background-color: #f0f0f0; +} + +body.developer-toc +{ + background-color: #f0f5ff; +} + +span.super +{ + vertical-align: super; + font-size: 80%; + margin-left: 3pt; +} + +h1.page-title +{ + text-align: left; + text-transform: capitalize; + margin-top: 5pt; + margin-bottom: 10pt; +} + +img +{ + display: inline; +} + + a.hover-link:link +,a.hover-link:visited +,a.hover-link:active +{ + color: black; + text-decoration: none; +} + +a.hover-link:hover +{ + color: black; + text-decoration: underline; +} + + a.warning-link:link +,a.warning-link:visited +,a.warning-link:active +{ + color: red; + text-decoration: none; +} + +a.warning-link:hover +{ + color: red; + text-decoration: underline; +} + +a.view-link +{ + text-transform: capitalize; +} + +div.statistics +{ + width: 80%; + padding-bottom: 5pt; +} + +div.legend +{ + width: 80%; + background-color: #f5f5f5; + margin-top: 10pt; + margin-bottom: 10pt; +} + +div.comment +{ + width: 80%; + background-color: #f5f5f5; + padding-left: 10pt; + padding-right: 10pt; + padding-bottom: 10pt; +} + +div.links +{ + margin-top: 0pt; + margin-bottom: 0pt; +} + +table.header-table +{ + margin-left: 10pt; + margin-top: 20pt; + margin-bottom: 10pt; + width: 80%; +} + +td.header-item +{ + text-align: left; + vertical-align: top; + font-weight: bold; +} + +td.header-item-content +{ + padding-left: 20pt; + padding-bottom: 10pt; +} + +td.legend-item +{ + padding: 0pt; + width: 50pt; +} + +td.legend-explanation +{ + padding-left: 5pt; +} + +div.acknowledgement +{ + text-align: left; + margin-top: 10pt; + margin-left: 5pt; + margin-bottom: 10pt; +} + +div.report-info +{ + text-align: left; + margin-bottom: 10pt; + width: 80%; +} + +div.report-warning +{ + color: red; +} + +div.library-name +{ + margin-top: 20pt; + margin-bottom: 10pt; + text-align: left; + font-size: 125%; + font-weight: bold; +} + +span.run-type-incremental +{ + margin-left: 3pt; + padding-left: 1pt; + padding-right: 1pt; + background-color: yellow; +} + + span.timestamp-1 +,span.timestamp-2 +{ + color: #555555; +} + + span.timestamp-3 +,span.timestamp-4 +,span.timestamp-5 +,span.timestamp-6 +,span.timestamp-7 +{ + color: #999999; +} + + span.timestamp-8 +,span.timestamp-9 +,span.timestamp-10 +,span.timestamp-11 +,span.timestamp-12 +,span.timestamp-13 +,span.timestamp-14 +,span.timestamp-15 +,span.timestamp-16 +,span.timestamp-17 +,span.timestamp-18 +,span.timestamp-19 +,span.timestamp-20 +,span.timestamp-21 +,span.timestamp-22 +,span.timestamp-23 +,span.timestamp-24 +,span.timestamp-25 +,span.timestamp-26 +,span.timestamp-27 +,span.timestamp-28 +,span.timestamp-29 +,span.timestamp-30 +{ + color: #dddddd; +} + + +table.summary-table +,table.library-table +{ + border-collapse: collapse; + border: 2px solid black; + margin: 5px; +} + + table.summary-table td +,table.library-table td +{ + text-align: center; + border-left: 1px solid black; + border-right: 1px solid black; +} + + a.log-link:link +,a.log-link:visited +{ + color: black; +} + + a.log-link:active +,a.log-link:hover +,a.legend-link:link +,a.legend-link:visited +,a.legend-link:active +,a.legend-link:hover +{ + color: black; + text-decoration: underline; +} + +td.runner +{ + color: black; + font-weight: bold; + border-top: 1px solid black; + padding-left: 3pt; + padding-right: 3pt; + +} + +td.timestamp +{ + color: black; + border-bottom: 1px solid black; + padding-left: 3pt; + padding-right: 3pt; +} + + td.toolset-name +,td.required-toolset-name +{ + vertical-align: middle; + padding-left: 3pt; + padding-right: 3pt; + word-spacing: -3pt; +} + +td.required-toolset-name +{ + font-weight: bold; +} + +td.library-test-category-header +{ + border-top: 1px solid gray; +} + +tr.summary-row-first td +, tr.library-row-first td +{ + border-top: 1px solid gray; + border-bottom: 0px; +} + +tr.summary-row-last td +, tr.library-row-last td +{ + border-top: 0px; + border-bottom: 1px solid gray; +} + +tr.summary-row-single td +, tr.library-row-single td +{ + border-top: 1px solid gray; + border-bottom: 1px solid gray; +} + +tr.summary-row td +, tr.library-row td +{ + border-bottom: 0px; + border-top: 0px; +} + + td.library-success-expected +, td.summary-success-expected +, td.summary-fail-expected +, td.summary-unknown-status +, td.summary-fail-expected-unresearched +{ + width: 60pt; + text-align: center; + background-color: lightgreen; + border-left: 1px solid black; + border-right: 1px solid black; + padding-left: 2pt; + padding-right: 2pt; +} + + td.summary-unknown-status +{ + background-color: white; +} + + td.library-success-unexpected +,td.summary-success-unexpected +{ + width: 60pt; + text-align: center; + background-color: green; + color: white; + border: 0px; + padding-left: 2pt; + padding-right: 2pt; +} + + td.user-library-success-unexpected +, td.user-summary-success-unexpected +{ + background-color: lightgreen; + color: black; +} + + td.library-success-unexpected a.log-link:link +,td.library-success-unexpected a.log-link:visited +,td.library-success-unexpected a.log-link:active +,td.library-success-unexpected a.log-link:hover +{ + color: white; +} + + td.user-library-success-unexpected a.log-link:link +, td.user-library-success-unexpected a.log-link:visited +, td.user-library-success-unexpected a.log-link:active +, td.user-library-success-unexpected a.log-link:hover +{ + color: black; +} + + td.summary-unusable +, td.library-unusable +, td.library-fail-expected +{ + width: 60pt; + text-align: center; + background-color: silver; + color: black; + border: 0px; + padding-left: 2pt; + padding-right: 2pt; +} + + + tr.summary-row td.summary-fail-unexpected +,tr.summary-row-first td.summary-fail-unexpected +,tr.summary-row-last td.summary-fail-unexpected +,tr.summary-row-single td.summary-fail-unexpected +{ + width: 60pt; + text-align: center; + background-color: red; + color: black; + border: 2px solid black; + padding-left: 2pt; + padding-right: 2pt; +} + + td.summary-missing +, td.library-missing +{ + width: 60pt; + text-align: center; + background-color: white; + color: black; + border: 0px; + padding-left: 2pt; + padding-right: 2pt; +} + +td.library-fail-expected-unresearched +{ + width: 60pt; + text-align: center; + background-color: white; + color: black; + border: 1px solid black; + padding-left: 2pt; + padding-right: 2pt; +} + + + tr.summary-row-first td.summary-missing +, tr.summary-row-single td.summary-missing +, tr.library-row-first td.library-missing +, tr.library-row-single td.library-missing +{ + border-top: 1px solid black; +} + + tr.summary-row-last td.summary-missing +, tr.summary-row-single td.summary-missing +, tr.library-row-last td.library-missing +, tr.library-row-single td.library-missing +{ + border-bottom: 1px solid black; +} + + +/* Summary */ + +table.summary-table td.library-name +{ + width: 100pt; + padding-left: 6pt; + padding-right: 6pt; + border-top: 1px solid gray; + border-bottom: 1px solid gray; + text-align: left; +} + + tr.summary-row td.summary-fail-unexpected-new +, tr.summary-row-first td.summary-fail-unexpected-new +, tr.summary-row-last td.summary-fail-unexpected-new +, tr.summary-row-single td.summary-fail-unexpected-new + +, tr.library-row td.library-fail-unexpected-new +, tr.library-row-first td.library-fail-unexpected-new +, tr.library-row-last td.library-fail-unexpected-new +, tr.library-row-single td.library-fail-unexpected-new + +, tr.summary-row td.user-summary-fail-expected-unresearched +, tr.summary-row-first td.user-summary-fail-expected-unresearched +, tr.summary-row-last td.user-summary-fail-expected-unresearched +, tr.summary-row-single td.user-summary-fail-expected-unresearched + +, tr.library-row td.user-library-fail-expected-unresearched +, tr.library-row-first td.user-library-fail-expected-unresearched +, tr.library-row-last td.user-library-fail-expected-unresearched +, tr.library-row-single td.user-library-fail-expected-unresearched +{ + width: 60pt; + text-align: center; + background-color: yellow; + color: black; + border: 2px solid black; +} + +/* Detailed */ + +.library-conf-problem +{ + font-size: 70%; + font-weight: normal; +} + +div.library-toc +{ + margin: 5pt; +} + + +li.library-toc-entry +{ + margin-left: 5pt; + list-style-type: square; +} + + +div.library-footer +{ + margin: 5px; +} + + +table.library-table td.test-name +{ + width: 150pt; + padding-left: 6pt; + padding-right: 6pt; + border-right: 0; + border-top: 1px solid gray; + border-bottom: 1px solid gray; + text-align: left; +} + +table.library-table td.test-type +{ + padding-right: 5px; + border-left: 0; + border-right: 0; + border-top: 1px solid gray; + border-bottom: 1px solid gray; + text-align: right; +} + + tr.library-row td.library-fail-unexpected +, tr.library-row-first td.library-fail-unexpected +, tr.library-row-last td.library-fail-unexpected +, tr.library-row-single td.library-fail-unexpected +{ + width: 60pt; + text-align: center; + background-color: red; + font-weight: bold; + color: black; + border: 2px solid black; +} + +table.library-library-notes +{ + background-color: LemonChiffon; + width: 80%; + margin-left: 5px; + margin-right: 5px; +} + +tr.library-library-note +{ +} + +div.note +{ + padding: 3pt; +} + +span.note-header +{ + font-weight: bold; +} + +span.auto-note +{ + font-style: italic; +} + +span.internal-error-note +{ + color: red; +} + +/* Log */ + +div.log-test-title +{ + font-size: 1.5em; + font-weight: bold; + border-bottom: 1px solid black; +} + +div.notes-title +{ + font-weight: bold; + background-color: #ffffcc; +} + +div.notes +{ + padding: 3pt; + background-color: #ffffcc; +} + +div.notes-title +{ + font-weight: bold; +} + +div.log-compiler-output-title +{ + font-weight: bold; +} + +div.log-linker-output-title +{ + font-weight: bold; +} + +div.log-run-output-title +{ + font-weight: bold; +} + +span.output-fail +{ + color: red; +} + + +/* Issues page */ + +table.library-issues-table +{ + border-collapse: collapse; + border: 2px solid black; +} + +table.library-issues-table td +{ + border: 1px solid #c0c0c0; + text-align: center; + margin-right: 5px; +} + +table.library-issues-table td.failures-row +{ + text-align: left; + padding: 0px; +} + + table.issue-box tr.library-row-single td.library-fail-unexpected-new +,table.issue-box tr.library-row-single td.library-fail-unexpected +{ + border: 0px; + font-weight: normal; +} diff --git a/tools/regression/xsl_reports/xsl/v2/html/summary_developer_legend.html b/tools/regression/xsl_reports/xsl/v2/html/summary_developer_legend.html new file mode 100644 index 0000000000..b85a6403fa --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/html/summary_developer_legend.html @@ -0,0 +1,72 @@ + + +
+ + + + + + + + + + + + + + + + + + + + + +
+ + +
OK
+ 		+ All expected tests pass. +
+ + +
OK
+ 		+ All expected tests pass, and some other tests that were expected to fail + unexpectedly pass as well. +
+ + +
fail
+ 		+ There are some failures on the newly added tests/compiler(s). +
+ + +
broken
+ 		+ Tests that the library author expects to pass are currently failing. +
+ + +
n/a
+ 		+ The library author marked it as unusable on particular platform/toolset. +
+
+ + + + + +
iAn incremental run.
+
diff --git a/tools/regression/xsl_reports/xsl/v2/html/summary_user_legend.html b/tools/regression/xsl_reports/xsl/v2/html/summary_user_legend.html new file mode 100644 index 0000000000..1fbf68a4cd --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/html/summary_user_legend.html @@ -0,0 +1,76 @@ + + +
+ + + + + + + + + + + + + + + + + + + + + +
+ + +
 pass 
+ 		+ All library's tests pass. +
+ + +
details
+ 		+ Most of the library's tests pass, but there are some known failures which might affect the library's + functionality. Please follow the link to see the detailed report. +
+ + +
details
+ 		+ Some of the newly added library's tests fail, or some of the library's tests fail on + the newly added compiler, or some of the tests fail due to unresearched + reasons. Please follow the link to see the detailed report. +
+ + +
regress.
+ 		+ There are some regressions in the library comparing to the previous release. + Please follow the link to see the detailed report. +
+ + +
unusable
+ 		+ The library author marked it as unusable on the particular platform/toolset. + Please follow the link to see the detailed report. +
+
+ + + + + +
iAn incremental run.
+
diff --git a/tools/regression/xsl_reports/xsl/v2/issues_page.xsl b/tools/regression/xsl_reports/xsl/v2/issues_page.xsl new file mode 100644 index 0000000000..58b6ce537a --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/issues_page.xsl @@ -0,0 +1,327 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + _release + + + + + + + + + + + + + + + + + + + + + + + + + + + + Boost regression unresolved issues: <xsl:value-of select="$source"/> + + + + + + + + + Writing document + + + + + + + + + +

+ Unresolved Issues: + +

+ + + + + + + + +

Libraries with unresolved failures

+
+ + + + + + + + +
+ + + + + + + + +

+ + + + ( + + failure + + s + + ) + +

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
testfailures
testfailures
+ + + + + + + + + + + + + + + + + + +
+
+ + + + + + + + Writing document issues-email.txt + + Boost regression test failures +------------------------------ +Report time: + + + + + +This report lists all regression test failures on release platforms. + +Detailed report: + http://engineering.meta-comm.com/boost-regression/ + + /developer/issues.html + + + + failure + + s + + in + + librar + + + ies + + + y + + + : + + + + + + + ( + + ) + + + + + + + + + + + +| + + | + + + + + + + + + + + + : + + + + + + + + + + + + + + + + + + + + + + + + + library-fail-unexpected-new + + + library-fail-unexpected + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/v2/links_page.xsl b/tools/regression/xsl_reports/xsl/v2/links_page.xsl new file mode 100644 index 0000000000..364b51e629 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/links_page.xsl @@ -0,0 +1,377 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Processing test "///" + + + Processing variants + + + + + + + + + + + + + + + + + + + + + + + + + + Processing test-log + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Writing variants reference file + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Writing variants file + + + + + + + + Test output: <xsl:value-of select="$component"/> + + + +
+
+ Test output: +
+
+ +
+ Report Time: +
+ +

Output by test variants:

+ + + + + + +
+ + + + + + + + + + +
+ + + + + + + + + + Writing log file document + + + + + + + + + Test output: <xsl:value-of select="$component"/> + + + +
+ Test output: +
+ +
+ Report Time: +
+ + +

+

Notes
+ + + + +

+ + + +

+

Compile []:
+
+

+ + + +

+

Link []:
+
+

+ + + +

+

Lib []:
+

+ See + + +

+

+ + + +

+

Run []:
+ 
+                                
+
+

+ + + + + + + + + + + + + + Writing log frame document + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/v2/produce_expected_results.xsl b/tools/regression/xsl_reports/xsl/v2/produce_expected_results.xsl new file mode 100644 index 0000000000..8574c59361 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/produce_expected_results.xsl @@ -0,0 +1,36 @@ + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/v2/result_page.xsl b/tools/regression/xsl_reports/xsl/v2/result_page.xsl new file mode 100644 index 0000000000..bfb70dd6bf --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/result_page.xsl @@ -0,0 +1,690 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + developer + user + + + + + _release + + + + + + + + + + r + r + rf + c + cf + l + lf + + Incorrect test type "" + + + + + + + + + + + + + + + + + + + + + + + + + Wrote debug + + + + + + Boost regression: <xsl:value-of select="$source"/> + + + + + + + + Writing document + + + + + + + + + + Boost logo + +

+ + report: + +

+ + + + + The purpose of this report is to help a user to find out whether a particular library + works on the particular compiler(s). For CVS "health report", see + developer summary. + + + Provides Boost developers with visual indication of the CVS "health". For user-level + report, see user summary. + + + + + + + + + + +
+ + + +
+ + + + + + + + + + + + + Writing document + + + + + + + + +
+ Report info +
+
+ Summary +
+ + +
+ Unresolved issues +
+ + +
+ + + + + +
+ +
+ + + + +
+ + + +
+ + + + + + + + + + + + + + + + + Writing document + + + + + + + Boost regression: <xsl:value-of select="$library"/>/<xsl:value-of select="$source"/> + + + + + + + + + + Writing document + + + + + + + + + + + + + + + + +

+ + + + / + +

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + + + + + + +
+ + + + + + + + + +
+ + +
+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + +    + + + +    + + +    + +    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +      + + + + + + + + fail? + + + fail* + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +      + + + + + + + + fail? + + + fail* + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + -single + -first + -last + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/tools/regression/xsl_reports/xsl/v2/runners.xsl b/tools/regression/xsl_reports/xsl/v2/runners.xsl new file mode 100644 index 0000000000..9bda7db8d3 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/runners.xsl @@ -0,0 +1,56 @@ + + + + + + + + + + + + + + + + + + + + +
+ Writing runner document + + + + + <xsl:value-of select="@runner"/> + + +

+
+ + + + +
+ + + + diff --git a/tools/regression/xsl_reports/xsl/v2/summary_page.xsl b/tools/regression/xsl_reports/xsl/v2/summary_page.xsl new file mode 100644 index 0000000000..b0e1deb477 --- /dev/null +++ b/tools/regression/xsl_reports/xsl/v2/summary_page.xsl @@ -0,0 +1,367 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + developer + user + + + + + + _release + + + + + + + + + + + + Boost regression summary: <xsl:value-of select="$source"/> + + + + + + + + + Writing document + + + + + + + + + + + + + + + +

+ Summary: + +

+ + + + + + +
+ Unusable: +  |  + Regressions: +  |  + New failures: +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + -single + + + -first + + + -last + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ +
+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +    + + n/a + +    + + +      + + + + broken + + + +    + + fail + +    + + +   OK   + + + + + + + + + + + + + + + + + + + + + +   + + unusable + +   + + +  no results  + + +   + + regress. + +   + + +   + + details + +   + + +  pass  + + + + + + + diff --git a/tools/release/make_tarballs.py b/tools/release/make_tarballs.py new file mode 100644 index 0000000000..10c1bd6acb --- /dev/null +++ b/tools/release/make_tarballs.py @@ -0,0 +1,373 @@ +# Copyright (c) MetaCommunications, Inc. 2003-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) + +import sys +import os +import shutil +import optparse + + +import utils + +my_location = os.path.abspath( os.path.dirname( sys.argv[0] ) ) + +def accept_args( args ): + #( release_version, cvs_tag, sf_user, temp_dir, start_step ) = accept_args( sys.argv[ 1: ] ) + parser = optparse.OptionParser() + parser.add_option( "-v", "--release-version", dest="release_version", metavar="release-version", help="release version (e.g. 1.32.0)") + parser.add_option( "", "--tag", dest="tag", help="CVS tag" ) + parser.add_option( "-r", "--cvs-branch", dest="cvs_branch", metavar="cvs-branch" + , help = "cvs branch to get the sources from (e.g RC_1_32_0). Important: it is case sensitive" ) + parser.add_option( "-u", "--sf-user", dest="sf_user", metavar="sf-user" + , help = "SourceForge user name (for CVS)" ) + parser.add_option( "-t", "--toolset", dest="toolset", help="toolset to use to build needed tools" ) + parser.add_option( "-s", "--start-step", dest="start_step" ) + parser.usage = "make_tarballs [options] target_directory \n\n" + \ + "Requirements:\n" + \ + " CVS:\n"+ \ + " cvs - (windows) to export sources with windows newlines \n" + \ + " /usr/bin/cvs - (cygwin) to export sources with posix newlines\n" + \ + " Utilities:\n" + \ + " mv - (cygwin) posix move\n" + \ + " /usr/bin/find - (cygwin) to export sources with posix newlines\n" + \ + " 7z - to create zipball\n" + \ + " BoostBook generation:\n" + \ + " bjam\n" + \ + " user-config.jam - in user directory ($HOME/%HOME%) for BoostBook generation\n" + \ + " java\n" + \ + " doxygen\n" + + + + ( options, args ) = parser.parse_args( args ) + + temp_dir = None + start_step = None + if ( len( args ) > 0 ): temp_dir = args[0] + + + ( version, tag, user, toolset, start_step ) = ( options.release_version + , options.cvs_branch + , options.sf_user + , options.toolset + , options.start_step ) + + if ( start_step is None ): start_step = "" + + def required( value, name ): + if ( value is None ): + print "%s should be specified." % name + parser.print_help() + sys.exit( 1 ) + + required( version, "version" ) + required( tag, "tag" ) + required( user, "user" ) + required( temp_dir, "temp_dir" ) + required( toolset, "toolset" ) + + return ( version, tag, user, toolset, temp_dir, start_step ) + + +def remove_directory( directory ): + if os.path.exists( directory ): + print " Removing directory %s" % directory + os.system( 'rd /s /q "%s"' % directory ) + +def clean_directory( directory ): + remove_directory( directory ) + print " Creating directory %s" % directory + os.makedirs( directory ) + +def listdir_recursively( root, path="" ): + # recursive listdir + files = [] + try: + for file in os.listdir(os.path.join(root, path)): + pathname = os.path.join(path, file) + if os.path.isdir(os.path.join(root, pathname)): + files.extend(listdir_recursively(root, pathname)) + else: + files.append(pathname) + except OSError: + pass + return files + +def find_file( root, name ): + print root + files = listdir_recursively( root ) + for file in files: + # print file + if os.path.basename( file ) == name: + return os.path.join( root, file ) + return None + +start_dir = os.getcwd() + +class make_tarballs( utils.step_controller ): + def __init__( self, release_version, cvs_tag, sf_user, toolset, temp_dir, start_step ): + utils.step_controller.__init__( self, start_step ) + self.release_version_ = release_version + self.cvs_tag_ = cvs_tag + self.sf_user_ = sf_user + self.toolset_ = toolset + self.temp_dir_ = temp_dir + + def run( self ): + archives = [] + + win_build_results = self.build_win( self.release_version_ + , self.cvs_tag_ + , self.sf_user_ + , self.temp_dir_ ) + archives.extend( win_build_results[1] ) + + archives.extend( self.build_unix( self.release_version_ + , self.cvs_tag_ + , self.sf_user_ + , self.temp_dir_ + , win_build_results[0] ) ) + + + # os.chdir( start_dir ) + # for archive in archives: + # shutil.copy( archive, start_dir ) + + + def make_temp_platform( self, temp, platform ): + temp_platform = os.path.join( temp, platform ) + if not self.is_skipping(): + clean_directory( temp_platform ) + return temp_platform + + def cvs_export( self, sf_user, cvs_tag, release_version, shell = "%s" ): + if not self.is_skipping(): + print " Exporting..." + cvs_export_template = 'cvs -d:ext:%(user)s@cvs.sourceforge.net:/cvsroot/boost -z9 export -r %(branch)s boost' + + cmd = cvs_export_template % { "user": sf_user + , "branch" : cvs_tag } + + print cmd + os.system( shell % cmd ) + os.system( "del /S/F/Q .cvsignore >nul" ) + # have to use mv instead of os.rename - cygwin cvs sets strange directory permssions + # which Windows rename or Python's os.rename cannot deal with + os.system( "mv boost boost_%s" % release_version ) + return "boost_%s" % release_version + + def build_win( self, release_version, cvs_tag, sf_user, temp_dir ): + + if "win.export": + self.start_step( "win.export", "Exporting windows copy" ) + + temp_win = self.make_temp_platform( temp_dir, "win" ) + os.chdir( temp_win ) + + exported_dir = self.cvs_export( sf_user, cvs_tag, release_version ) + self.finish_step( "win.export" ) + + self.make_docs( os.path.abspath( exported_dir ), temp_dir ) + + if self.start_step( "win.make_readonly", "Making all files writable" ): + os.chdir( temp_win ) + utils.checked_system( [ "attrib /S -R *.*" ] ) + self.finish_step( "win.make_readonly" ) + + zip_name = "boost_%s.zip" % release_version + os.chdir( temp_win ) + + + if self.start_step( "win.zip", " Zipping" ): + print " Zipping" + if os.path.exists( zip_name ): os.unlink( zip_name ) + + utils.checked_system( ["7z a -r -tzip %s %s\* > %s" % ( zip_name, "boost_%s" % release_version, zip_name + ".log" ) ] ) + self.finish_step( "win.zip" ) + + + return ( os.path.abspath( exported_dir ), [ os.path.abspath( zip_name ) ] ) + + def make_docs( self, boost_directory, temp_dir ): + boostbook_temp = os.path.join( boost_directory, "bin.v2" ) + tools_directory = os.path.join( temp_dir, "tools" ) + if not os.path.exists( tools_directory ): + os.makedirs( tools_directory ) + + if self.start_step( "win.make_docs.setup_tools", "Setting up BoostBook tools" ): + sys.path.append( sys.path[0] + "/../boostbook" ) + print sys.path + import setup_boostbook + os.environ[ "BOOST_ROOT" ] = boost_directory + setup_boostbook.setup_boostbook( os.path.join( temp_dir, "tools" ) ) + + if self.start_step( "win.make_docs.clean", "Clearing \"bin.v2" ): + if os.path.exists( boostbook_temp ): + shutil.rmtree( boostbook_temp ) + self.finish_step( "win.make_docs.clean" ) + + + cd = os.getcwd() + os.chdir( os.path.join( boost_directory, "doc" ) ) + + if self.start_step( "win.make_docs.correct_permissions", "Making html's writable" ): + utils.checked_system( + [ + "cd html" + , "attrib -R *" + , "cd .." + ] ) + self.finish_step( "win.make_docs.correct_permissions" ) + + def generate( output_format ): + if self.start_step( "win.make_docs.%s" % output_format, ' Generating %s' % output_format ): + utils.checked_system( [ + # "set HOME=%s" % my_location + "%s -d2 --v2 %s " % ( bjam_path(), output_format ) + ] ) + self.finish_step( "win.make_docs.%s" % output_format ) + + generate( "html" ) + generate( "docbook" ) + generate( "fo" ) + + if self.start_step( "win.make_docs.copy_docs", "Copying docs into doc directory" ): + shutil.copy( os.path.join( boostbook_temp, "doc", self.toolset_, "debug", "boost.docbook" ), "boost.docbook" ) + shutil.copy( os.path.join( boostbook_temp, "doc", self.toolset_, "debug", "boost.fo" ), "boost.fo" ) + self.finish_step( "win.make_docs.copy_docs" ) + + + if self.start_step( "win.make_docs.clean2", "Copying docs into doc directory" ): + shutil.rmtree( boostbook_temp ) + shutil.rmtree( "xml" ) + self.finish_step( "win.make_docs.clean2" ) + + if self.start_step( "win.make_docs.bb_userman", "Creating Boost.Build user manual" ): + os.chdir( os.path.join( boost_directory, "tools", "build", "v2", "doc" ) ) + + utils.checked_system( [ +# "set HOME=%s" % my_location + "%s -d2 --v2 pdf" % bjam_path() + ] ) + + for f in [ "userman.pdf" ]: + shutil.copy( find_file( os.path.join( boostbook_temp ), f ), f ) + + shutil.rmtree( boostbook_temp ) + self.finish_step( "win.make_docs.bb_userman" ) + + if self.start_step( "win.make_docs.clean3", boost_directory ): + for i in os.walk( boost_directory ): + for f in i[2]: + full_path = os.path.join( i[0], f ) + if os.path.splitext( f )[1] in [ ".boostbook" ] \ + and os.access( full_path, os.W_OK ): + os.unlink( full_path ) + self.finish_step( "win.make_docs.clean3" ) + + + def correct_executable_permissions( self, path ): + if not self.is_skipping(): + print " Correcting permissions" + for i in os.walk( path ): + for f in i[2]: + if os.path.splitext( f )[1] in ( ".css", ".hpp", ".cpp",\ + ".html", ".htm", ".rst", \ + ".pdf", ".xml", ".png",\ + ".jpg", ".vcproj", ".pattern2", \ + ".jam", ".bat", ".sty", ".diff" ) \ + or os.path.basename( f ).lower() in ( "jamfile", "todo", "makefile", "jamrules", "gnumakefile" ): + print os.path.join( i[0], f ) + os.system( "chmod a-x %s" % os.path.join( i[0], f ) ) + + + def build_unix( self, release_version, cvs_tag, sf_user, temp_dir, win_build_dir ): + + self.start_step( "unix.export", "Exporting unix copy" ) + + temp_unix = self.make_temp_platform( temp_dir, "unix" ) + os.chdir( temp_unix ) + + exported_dir = self.cvs_export( sf_user, cvs_tag, release_version, "bash -c \"/usr/bin/%s\"" ) + self.correct_executable_permissions( "." ) + self.finish_step( "unix.export" ) + + self.copy_docs_to_unix( os.path.abspath( exported_dir ) + , win_build_dir ) + + if self.start_step( "unix.make_readonly", "Making all files readonly" ): + utils.checked_system( [ "chmod -R a-w+r,u+w %s" % temp_unix ] ) + utils.checked_system( [ "bash -c /usr/bin/find %s -type d -exec chmod u+w {} ;" % temp_unix ] ) + self.finish_step( "unix.make_readonly" ) + + gz_archive_name = "boost_%s" % release_version + ".tar.gz" + if self.start_step( "unix.gz", " Making .gz" ): + if os.path.exists( gz_archive_name ): os.unlink( gz_archive_name ) + os.system( "tar cfz %s %s" % ( gz_archive_name, "boost_%s" % release_version ) ) + self.finish_step( "unix.gz" ) + + bz2_archive_name = "boost_%s" % release_version + ".tar.bz2" + if self.start_step( "unix.bz2", " Making .bz2" ): + if os.path.exists( bz2_archive_name ): os.unlink( bz2_archive_name ) + os.system( 'bash -c "gunzip -c %s | bzip2 > %s"' % ( gz_archive_name, bz2_archive_name ) ) + self.finish_step( "unix.bz2" ) + + return [ os.path.abspath( x ) for x in ( gz_archive_name, bz2_archive_name ) ] + + def remove_x_permission( self, directory ): + for i in os.walk( directory ): + for f in i[1]: + os.system( "chmod a=xr,u=rwx %s" % os.path.join( i[0], f ) ) + for f in i[2]: + os.system( "chmod a=r,u=rw %s" % os.path.join( i[0], f ) ) + + def copy_docs_to_unix( self, unix_boost_directory, win_boost_directory ): + if self.start_step( "unix.copy_docs", "Copying docs to unix copy" ): + doc_directory = os.path.join( unix_boost_directory, "doc" ) + doc_html_directory = os.path.join( doc_directory, "html" ) + remove_directory( doc_html_directory ) + utils.checked_system( [ + "cp -R %s %s " % ( os.path.join( win_boost_directory, "doc", "html" ) + , doc_html_directory ) + ] ) + for f in [ "boost.docbook", "boost.fo" ]: + utils.checked_system( [ + "cp %s %s" % ( os.path.join( win_boost_directory, "doc", f ) + , os.path.join( doc_directory, f ) ) + ] ) + + self.remove_x_permission( doc_directory ) + + boost_build_doc_directory = os.path.join( unix_boost_directory, "tools", "build", "v2", "doc" ) + boost_build_doc_html_directory = os.path.join( boost_build_doc_directory, "html" ) + + remove_directory( boost_build_doc_html_directory ) + utils.checked_system( [ + "cp -R %s %s " % ( os.path.join( win_boost_directory, "tools", "build", "v2", "doc", "html" ) + , boost_build_doc_html_directory ) ] ) + + for f in [ "userman.pdf" ]: + utils.checked_system( [ + "cp %s %s " % ( os.path.join( win_boost_directory, "tools", "build", "v2", "doc", f ) + , os.path.join( boost_build_doc_directory, f ) ) ] ) + + self.remove_x_permission( boost_build_doc_directory ) + self.finish_step( "unix.copy_docs" ) + + +def bjam_path(): + if os.path.exists( os.path.join( my_location, "bjam.exe" ) ): + return os.path.join( my_location, "bjam.exe" ) + else: + return "bjam.exe" + +def main(): + ( release_version, cvs_tag, sf_user, toolset, temp_dir, start_step ) = accept_args( sys.argv[ 1: ] ) + + make_tarballs( release_version, cvs_tag, sf_user, toolset, temp_dir, start_step ).run() + +if __name__ == "__main__": + main() diff --git a/tools/release/user-config.jam b/tools/release/user-config.jam new file mode 100644 index 0000000000..09b667991a --- /dev/null +++ b/tools/release/user-config.jam @@ -0,0 +1,73 @@ +# Copyright 2003 Vladimir Prus +# Distributed under the Boost Software License, Version 1.0. +# (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) + +# This file is used to configure your Boost.Build installation. Please read +# the user manual to find out where to put it. + +# Toolset declarations are most important in this file. The tell Boost.Build +# what compilers are available and where to look for them. The first toolset +# will become "default" one. +# Some important libraries can also be configured. +# Uncomment relevant parts to suite your local configuration and preferences. + +import toolset : using ; + +# GCC configuration + +# Configure gcc (default version) +# using gcc ; + +# Configure specific gcc version, giving alternative name to use +# using gcc : 3.2 g++-3.2 ; + +# MSVC configuration + +# Configure msvc (default version, searched in standard location +# and PATH). +# using msvc ; + +# Borland configuration +# using borland ; + + +# STLPort configuration + +# Configure, specifying location of STLPort headers. +# Libraries must be either not needed, or available to +# the compiler by default +# using stlport : /usr/include/stlport ; + +# Configure, specifying locatioh of both headers and libraries +# using stlport : /usr/include/stlport : /usr/lib ; + + +# QT configuration + +# Configure, assuming QTDIR gives the installation prefix +# using qt ; + +# Configure with explicit installation prefix +# using qt : /usr/opt/qt ; + +# xsltproc (from libxslt) configuration +using xsltproc ; + +# BoostBook configuration +# using boostbook ; + using boostbook : C:/Progra~1/docbook-xsl/docbook-xsl-1.66.1 + : C:/Progra~1/docbook/4.2 + ; + using doxygen : C:/Progra~1/doxygen/bin/doxygen.exe ; + + using fop : C:/PROGRA~1/fop/FOP-02~1.4 + : C:/WINDOWS/system32/java.exe + ; + + + + + + + + diff --git a/tools/release/utils.py b/tools/release/utils.py new file mode 100644 index 0000000000..c72ab2d91f --- /dev/null +++ b/tools/release/utils.py @@ -0,0 +1,52 @@ +import string + +import os + +class failure_exception: + def __init__( self, rc ): + self.rc_ = rc + + def __str__( self ): + return "rc: %d" % self.rc_ + +def system( commands ): + if os.path.exists( "tmp.cmd" ): + os.chmod( "tmp.cmd", 0777 ) + os.unlink( "tmp.cmd" ) + + f = open( "tmp.cmd", "w" ) + f.write( string.join( commands, "\n" ) ) + f.close() + rc = os.system( "tmp.cmd" ) + os.chmod( "tmp.cmd", 0777 ) + os.unlink( "tmp.cmd" ) + return rc + +def checked_system( commands, valid_return_codes = [ 0 ] ): + rc = system( commands ) + if rc not in [ 0 ] + valid_return_codes: raise failure_exception( rc ) + return rc + +class step_controller: + def __init__( self, start_step ): + self.current_step_ = None; + self.skip_to_step_ = start_step + + def start_step( self, step_name, start_message ): + self.current_step_ = step_name + if self.is_skipping( step_name ): + print "[%s] Skipping." % step_name + return 0 + else: + self.skip_to_step_ = "" + print "[%s] %s" % ( step_name, start_message ) + return 1 + + def finish_step( self, step_name ): + print "[%s] Finished" % step_name + + def is_skipping( self, step_name = None ): + if step_name is None: step_name = self.current_step_ + return self.skip_to_step_ != "" and self.skip_to_step_ != step_name + + diff --git a/wiki/index.html b/wiki/index.html new file mode 100755 index 0000000000..a4275f9534 --- /dev/null +++ b/wiki/index.html @@ -0,0 +1,13 @@ + + + + + + + + + +Take me to the +Boost Wiki. + +