|
|
Boost-Commit : |
From: daniel_james_at_[hidden]
Date: 2008-05-14 16:38:36
Author: danieljames
Date: 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
New Revision: 45364
URL: http://svn.boost.org/trac/boost/changeset/45364
Log:
Use root links in quickbook.
Binary files modified:
branches/doc/libs/range/doc/boost_range.qbk
Text files modified:
branches/doc/libs/accumulators/doc/accumulators.qbk | 10 ++--
branches/doc/libs/bimap/doc/bimap_and_boost.qbk | 16 ++++----
branches/doc/libs/bimap/doc/examples.qbk | 68 ++++++++++++++++++------------------
branches/doc/libs/bimap/doc/quick_tutorial.qbk | 2
branches/doc/libs/bimap/doc/test_suite.qbk | 60 ++++++++++++++++----------------
branches/doc/libs/bimap/doc/tutorial.qbk | 26 +++++++-------
branches/doc/libs/config/doc/config.qbk | 8 ++--
branches/doc/libs/config/doc/configuring_boost.qbk | 14 +++---
branches/doc/libs/config/doc/guidelines.qbk | 8 ++--
branches/doc/libs/config/doc/macro_reference.qbk | 6 +-
branches/doc/libs/foreach/doc/foreach.qbk | 16 ++++----
branches/doc/libs/function_types/doc/function_types.qbk | 38 ++++++++++----------
branches/doc/libs/functional/hash/doc/intro.qbk | 6 +-
branches/doc/libs/functional/hash/doc/portability.qbk | 2
branches/doc/libs/functional/hash/doc/tutorial.qbk | 8 ++--
branches/doc/libs/interprocess/doc/interprocess.qbk | 6 +-
branches/doc/libs/intrusive/doc/intrusive.qbk | 2
branches/doc/libs/iterator/doc/quickbook/adaptor.qbk | 2
branches/doc/libs/iterator/doc/quickbook/counting_iterator.qbk | 2
branches/doc/libs/iterator/doc/quickbook/facade_tutorial.qbk | 4 +-
branches/doc/libs/iterator/doc/quickbook/filter_iterator.qbk | 2
branches/doc/libs/iterator/doc/quickbook/indirect_iterator.qbk | 2
branches/doc/libs/iterator/doc/quickbook/iterator.qbk | 6 +-
branches/doc/libs/iterator/doc/quickbook/permutation_iterator.qbk | 2
branches/doc/libs/iterator/doc/quickbook/reverse_iterator.qbk | 2
branches/doc/libs/iterator/doc/quickbook/shared_container_iterator.qbk | 8 ++--
branches/doc/libs/iterator/doc/quickbook/traits.qbk | 4 +-
branches/doc/libs/iterator/doc/quickbook/transform_iterator.qbk | 2
branches/doc/libs/iterator/doc/quickbook/utilities.qbk | 2
branches/doc/libs/math/doc/gcd/math-gcd.qbk | 14 +++---
branches/doc/libs/math/doc/math.qbk | 40 ++++++++++----------
branches/doc/libs/math/doc/octonion/math-octonion.qbk | 18 ++++----
branches/doc/libs/math/doc/quaternion/math-quaternion.qbk | 28 +++++++-------
branches/doc/libs/math/doc/sf_and_dist/common_overviews.qbk | 4 +-
branches/doc/libs/math/doc/sf_and_dist/concepts.qbk | 22 +++++-----
branches/doc/libs/math/doc/sf_and_dist/distributions/binomial_example.qbk | 8 ++--
branches/doc/libs/math/doc/sf_and_dist/distributions/chi_squared_examples.qbk | 6 +-
branches/doc/libs/math/doc/sf_and_dist/distributions/distribution_construction.qbk | 2
branches/doc/libs/math/doc/sf_and_dist/distributions/f_dist_example.qbk | 2
branches/doc/libs/math/doc/sf_and_dist/distributions/find_location_and_scale.qbk | 6 +-
branches/doc/libs/math/doc/sf_and_dist/distributions/nag_library.qbk | 2
branches/doc/libs/math/doc/sf_and_dist/distributions/negative_binomial_example.qbk | 6 +-
branches/doc/libs/math/doc/sf_and_dist/distributions/normal_example.qbk | 2
branches/doc/libs/math/doc/sf_and_dist/distributions/students_t_examples.qbk | 8 ++--
branches/doc/libs/math/doc/sf_and_dist/distributions/triangular.qbk | 6 +-
branches/doc/libs/math/doc/sf_and_dist/error_handling.qbk | 2
branches/doc/libs/math/doc/sf_and_dist/implementation.qbk | 2
branches/doc/libs/math/doc/sf_and_dist/math.qbk | 2
branches/doc/libs/math/doc/sf_and_dist/policy.qbk | 2
branches/doc/libs/math/doc/sf_and_dist/policy_tutorial.qbk | 2
branches/doc/libs/math/doc/sf_and_dist/pow.qbk | 2
branches/doc/libs/numeric/conversion/doc/conversion.qbk | 2
branches/doc/libs/optional/doc/optional.qbk | 16 ++++----
branches/doc/libs/python/doc/tutorial/doc/tutorial.qbk | 26 +++++++-------
branches/doc/libs/regex/doc/configuration.qbk | 6 +-
branches/doc/libs/regex/doc/examples.qbk | 56 +++++++++++++++---------------
branches/doc/libs/regex/doc/install.qbk | 6 +-
branches/doc/libs/regex/doc/performance.qbk | 4 +-
branches/doc/libs/regex/doc/redistributables.qbk | 2
branches/doc/libs/regex/doc/regex_traits.qbk | 2
branches/doc/libs/spirit/doc/lex/lexer_quickstart1.qbk | 2
branches/doc/libs/spirit/doc/lex/lexer_quickstart2.qbk | 2
branches/doc/libs/spirit/doc/lex/lexer_quickstart3.qbk | 2
branches/doc/libs/spirit/doc/lex/lexer_static_model.qbk | 10 ++--
branches/doc/libs/spirit/doc/lex/tokens_values.qbk | 2
branches/doc/libs/spirit/phoenix/doc/users_manual.qbk | 20 +++++-----
branches/doc/libs/static_assert/doc/static_assert.qbk | 26 +++++++-------
branches/doc/libs/tr1/doc/tr1.qbk | 74 ++++++++++++++++++++--------------------
branches/doc/libs/type_traits/doc/credits.qbk | 4 +-
branches/doc/libs/type_traits/doc/examples.qbk | 10 ++--
branches/doc/libs/type_traits/doc/intrinsics.qbk | 2
branches/doc/libs/type_traits/doc/mpl.qbk | 8 ++--
branches/doc/libs/unordered/doc/hash_equality.qbk | 2
branches/doc/libs/xpressive/doc/xpressive.qbk | 4 +-
branches/doc/libs/xpressive/proto/doc/proto.qbk | 2
branches/doc/tools/quickbook/doc/quickbook.qbk | 8 ++--
76 files changed, 409 insertions(+), 409 deletions(-)
Modified: branches/doc/libs/accumulators/doc/accumulators.qbk
==============================================================================
--- branches/doc/libs/accumulators/doc/accumulators.qbk (original)
+++ branches/doc/libs/accumulators/doc/accumulators.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -32,9 +32,9 @@
[def _left_or_right_ '''<replaceable>left-or-right</replaceable>''']
[def _implementation_defined_ '''<replaceable>implementation-defined</replaceable>''']
[def _boost_ [@http://www.boost.org Boost]]
-[def _mpl_ [@../../libs/mpl MPL]]
-[def _mpl_lambda_expression_ [@../../libs/mpl/doc/refmanual/lambda-expression.html MPL Lambda Expression]]
-[def _parameter_ [@../../libs/parameter Boost.Parameter]]
+[def _mpl_ [@/libs/mpl MPL]]
+[def _mpl_lambda_expression_ [@/libs/mpl/doc/refmanual/lambda-expression.html MPL Lambda Expression]]
+[def _parameter_ [@/libs/parameter Boost.Parameter]]
[def _accumulator_set_ [classref boost::accumulators::accumulator_set `accumulator_set<>`]]
[def _accumulator_base_ [classref boost::accumulators::accumulator_base `accumulator_base`]]
[def _depends_on_ [classref boost::accumulators::depends_on `depends_on<>`]]
@@ -732,7 +732,7 @@
};
};
-Here, `impl` is a binary [@../../libs/mpl/doc/refmanual/metafunction-class.html
+Here, `impl` is a binary [@/libs/mpl/doc/refmanual/metafunction-class.html
MPL Metafunction Class], which is a kind of _mpl_lambda_expression_. The nested
`apply<>` template is part of the metafunction class protocol and tells MPL how
to to build the accumulator type given the sample and weight types.
@@ -803,7 +803,7 @@
}}
The return type deserves some explanation. Every _accumulator_set_ type
-is actually a unary [@../../libs/mpl/doc/refmanual/metafunction-class.html
+is actually a unary [@/libs/mpl/doc/refmanual/metafunction-class.html
MPL Metafunction Class]. When you `mpl::apply<>` an _accumulator_set_ and
a feature, the result is the type of the accumulator within the set that
implements that feature. And every accumulator provides a nested `result_type`
Modified: branches/doc/libs/bimap/doc/bimap_and_boost.qbk
==============================================================================
--- branches/doc/libs/bimap/doc/bimap_and_boost.qbk (original)
+++ branches/doc/libs/bimap/doc/bimap_and_boost.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -152,7 +152,7 @@
[import ../example/bimap_and_boost/serialization.cpp]
-[@../../example/bimap_and_boost/serialization.cpp Go to source code]
+[@/libs/bimap/example/bimap_and_boost/serialization.cpp Go to source code]
[code_bimap_and_boost_serialization]
@@ -203,7 +203,7 @@
[import ../example/bimap_and_boost/assign.cpp]
-[@../../example/bimap_and_boost/assign.cpp Go to source code]
+[@/libs/bimap/example/bimap_and_boost/assign.cpp Go to source code]
[code_bimap_and_boost_assign]
@@ -241,7 +241,7 @@
[import ../example/bimap_and_boost/lambda.cpp]
-[@../../example/bimap_and_boost/lambda.cpp Go to source code]
+[@/libs/bimap/example/bimap_and_boost/lambda.cpp Go to source code]
[code_bimap_and_boost_lambda]
@@ -273,7 +273,7 @@
[code_bimap_and_boost_range]
-[@../../example/bimap_and_boost/range.cpp Go to source code]
+[@/libs/bimap/example/bimap_and_boost/range.cpp Go to source code]
[endsect]
@@ -301,7 +301,7 @@
[code_bimap_and_boost_foreach_using_range]
-[@../../example/bimap_and_boost/foreach.cpp Go to source code]
+[@/libs/bimap/example/bimap_and_boost/foreach.cpp Go to source code]
[endsect]
@@ -332,7 +332,7 @@
[code_bimap_and_boost_typeof_using_auto]
-[@../../example/bimap_and_boost/typeof.cpp Go to source code]
+[@/libs/bimap/example/bimap_and_boost/typeof.cpp Go to source code]
[endsect]
@@ -346,7 +346,7 @@
[code_bimap_and_boost_xpressive]
-[@../../example/bimap_and_boost/xpressive.cpp Go to source code]
+[@/libs/bimap/example/bimap_and_boost/xpressive.cpp Go to source code]
[endsect]
@@ -378,7 +378,7 @@
[import ../example/bimap_and_boost/property_map.cpp]
-[@../../example/bimap_and_boost/property_map.cpp Go to source code]
+[@/libs/bimap/example/bimap_and_boost/property_map.cpp Go to source code]
[code_bimap_and_boost_property_map]
Modified: branches/doc/libs/bimap/doc/examples.qbk
==============================================================================
--- branches/doc/libs/bimap/doc/examples.qbk (original)
+++ branches/doc/libs/bimap/doc/examples.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -16,62 +16,62 @@
[section Examples list]
-In the folder [@../../example libs/bimap/example] you can find all the examples
+In the folder [@/libs/bimap/example libs/bimap/example] you can find all the examples
used in bimap documentation. Here is a list of them:
[table Tutorial examples
[[Program ][Description ]]
-[[[@../../example/simple_bimap.cpp
+[[[@/libs/bimap/example/simple_bimap.cpp
simple_bimap.cpp ]]
[Soccer world cup example ]]
-[[[@../../example/tagged_simple_bimap.cpp
+[[[@/libs/bimap/example/tagged_simple_bimap.cpp
tagged_simple_bimap.cpp ]]
[Soccer world cup example using user defined names ]]
-[[[@../../example/step_by_step.cpp
+[[[@/libs/bimap/example/step_by_step.cpp
step_by_step.cpp ]]
[Basic example of the three views of bimap ]]
-[[[@../../example/population_bimap.cpp
+[[[@/libs/bimap/example/population_bimap.cpp
population_bimap.cpp ]]
[Countries populations, using `unordered_set_of` and `multiset_of` ]]
-[[[@../../example/repetitions_counter.cpp
+[[[@/libs/bimap/example/repetitions_counter.cpp
repetitions_counter.cpp ]]
[Word repetitions counter, using `unordered_set_of` and `list_of` ]]
-[[[@../../example/mighty_bimap.cpp
+[[[@/libs/bimap/example/mighty_bimap.cpp
mighty_bimap.cpp ]]
[Dictionary using `list_of_relation` ]]
-[[[@../../example/user_defined_names.cpp
+[[[@/libs/bimap/example/user_defined_names.cpp
user_defined_names.cpp ]]
[Equivalence between code with tagged and untagged code ]]
-[[[@../../example/standard_map_comparison.cpp
+[[[@/libs/bimap/example/standard_map_comparison.cpp
standard_map_comparison.cpp ]]
[Comparison between standard maps and bimap map views ]]
-[[[@../../example/at_function_examples.cpp
+[[[@/libs/bimap/example/at_function_examples.cpp
at_function_examples.cpp ]]
[Functions `at(key)` and `operator[](key)` examples ]]
-[[[@../../example/tutorial_modify_and_replace.cpp
+[[[@/libs/bimap/example/tutorial_modify_and_replace.cpp
tutorial_modify_and_replace.cpp ]]
[`modify` and `replace` examples ]]
-[[[@../../example/tutorial_range.cpp
+[[[@/libs/bimap/example/tutorial_range.cpp
tutorial_range.cpp ]]
[`range()` tutorial ]]
-[[[@../../example/tutorial_info_hook.cpp
+[[[@/libs/bimap/example/tutorial_info_hook.cpp
tutorial_info_hook.cpp ]]
[Additional information hooking ]]
-[[[@../../example/unconstrained_collection.cpp
+[[[@/libs/bimap/example/unconstrained_collection.cpp
unconstrained_collection.cpp ]]
[Using `unconstrained_set_of` collection type ]]
]
@@ -80,35 +80,35 @@
[table Bimap and Boost examples
[[Program ][Description ]]
-[[[@../../example/bimap_and_boost/assign.cpp
+[[[@/libs/bimap/example/bimap_and_boost/assign.cpp
assign.cpp ]]
[Bimap and Boost.Assign: Methods to insert elements ]]
-[[[@../../example/bimap_and_boost/lambda.cpp
+[[[@/libs/bimap/example/bimap_and_boost/lambda.cpp
lambda.cpp ]]
[Bimap and Boost.Lambda: new lambda placeholders ]]
-[[[@../../example/bimap_and_boost/property_map.cpp
+[[[@/libs/bimap/example/bimap_and_boost/property_map.cpp
property_map.cpp ]]
[Bimap and Boost.PropertyMap: PropertyMap support ]]
-[[[@../../example/bimap_and_boost/range.cpp
+[[[@/libs/bimap/example/bimap_and_boost/range.cpp
range.cpp ]]
[Bimap and Boost.Range: Using bimaps in the new range framework ]]
-[[[@../../example/bimap_and_boost/foreach.cpp
+[[[@/libs/bimap/example/bimap_and_boost/foreach.cpp
foreach.cpp ]]
[Bimap and Boost.Foreach: Iterating over bimaps ]]
-[[[@../../example/bimap_and_boost/typeof.cpp
+[[[@/libs/bimap/example/bimap_and_boost/typeof.cpp
typeof.cpp ]]
[Bimap and Boost.Typeof: using BOOST_AUTO while we wait for C++0x ]]
-[[[@../../example/bimap_and_boost/xpressive.cpp
+[[[@/libs/bimap/example/bimap_and_boost/xpressive.cpp
xpressive.cpp ]]
[Bimap and Boost.Xpressive: Inserting elements in a bimap ]]
-[[[@../../example/bimap_and_boost/serialization.cpp
+[[[@/libs/bimap/example/bimap_and_boost/serialization.cpp
serialization.cpp: ]]
[Bimap and Boost.Serialization: Load and save bimaps and iterators ]]
]
@@ -117,15 +117,15 @@
[table Boost.MultiIndex to Boost.Bimap path examples
[[Program ][Description ]]
-[[[@../../example/mi_to_b_path/bidirectional_map.cpp
+[[[@/libs/bimap/example/mi_to_b_path/bidirectional_map.cpp
bidirectional_map.cpp ]]
[Boost.MultiIndex to Boost.Bimap path example ]]
-[[[@../../example/mi_to_b_path/hashed_indices.cpp
+[[[@/libs/bimap/example/mi_to_b_path/hashed_indices.cpp
hashed_indices.cpp ]]
[Boost.MultiIndex to Boost.Bimap path example ]]
-[[[@../../example/mi_to_b_path/tagged_bidirectional_map.cpp
+[[[@/libs/bimap/example/mi_to_b_path/tagged_bidirectional_map.cpp
tagged_bidirectional_map.cpp ]]
[Boost.MultiIndex to Boost.Bimap path example ]]
@@ -137,13 +137,13 @@
This is the example from the one minute tutorial section.
-[@../../example/simple_bimap.cpp Go to source code]
+[@/libs/bimap/example/simple_bimap.cpp Go to source code]
[code_simple_bimap]
You can rewrite it using tags to gain readability.
-[@../../example/tagged_simple_bimap.cpp Go to source code]
+[@/libs/bimap/example/tagged_simple_bimap.cpp Go to source code]
[import ../example/tagged_simple_bimap.cpp]
@@ -158,7 +158,7 @@
In this example the collection type of relation is changed to allow the iteration
of the container.
-[@../../example/mighty_bimap.cpp Go to source code]
+[@/libs/bimap/example/mighty_bimap.cpp Go to source code]
[code_mighty_bimap]
@@ -180,7 +180,7 @@
[heading Boost.MultiIndex]
-[@../../example/mi_to_b_path/mi_bidirectional_map.cpp Go to source code]
+[@/libs/bimap/example/mi_to_b_path/mi_bidirectional_map.cpp Go to source code]
[import ../example/mi_to_b_path/mi_bidirectional_map.cpp]
@@ -188,7 +188,7 @@
[heading Boost.Bimap]
-[@../../example/mi_to_b_path/bidirectional_map.cpp Go to source code]
+[@/libs/bimap/example/mi_to_b_path/bidirectional_map.cpp Go to source code]
[import ../example/mi_to_b_path/bidirectional_map.cpp]
@@ -196,7 +196,7 @@
Or better, using tags...
-[@../../example/mi_to_b_path/tagged_bidirectional_map.cpp Go to source code]
+[@/libs/bimap/example/mi_to_b_path/tagged_bidirectional_map.cpp Go to source code]
[import ../example/mi_to_b_path/tagged_bidirectional_map.cpp]
@@ -216,7 +216,7 @@
[heading Boost.MultiIndex]
-[@../../example/mi_to_b_path/mi_hashed_indices.cpp Go to source code]
+[@/libs/bimap/example/mi_to_b_path/mi_hashed_indices.cpp Go to source code]
[import ../example/mi_to_b_path/mi_hashed_indices.cpp]
@@ -224,7 +224,7 @@
[heading Boost.Bimap]
-[@../../example/mi_to_b_path/hashed_indices.cpp Go to source code]
+[@/libs/bimap/example/mi_to_b_path/hashed_indices.cpp Go to source code]
[import ../example/mi_to_b_path/hashed_indices.cpp]
@@ -233,4 +233,4 @@
[endsect]
-[endsect]
\ No newline at end of file
+[endsect]
Modified: branches/doc/libs/bimap/doc/quick_tutorial.qbk
==============================================================================
--- branches/doc/libs/bimap/doc/quick_tutorial.qbk (original)
+++ branches/doc/libs/bimap/doc/quick_tutorial.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -139,7 +139,7 @@
Look how you can reuse code that is intend to be used with std::maps, like the
print_map function in this example.
-[@../../example/simple_bimap.cpp Go to source code]
+[@/libs/bimap/example/simple_bimap.cpp Go to source code]
[code_simple_bimap]
Modified: branches/doc/libs/bimap/doc/test_suite.qbk
==============================================================================
--- branches/doc/libs/bimap/doc/test_suite.qbk (original)
+++ branches/doc/libs/bimap/doc/test_suite.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -22,123 +22,123 @@
[table
[[Program ][Description ]
]
-[[[@../../test/test_tagged.cpp
+[[[@/libs/bimap/test/test_tagged.cpp
test_tagged.cpp ]]
[Tagged idiom checks ]]
-[[[@../../test/test_mutant.cpp
+[[[@/libs/bimap/test/test_mutant.cpp
test_mutant.cpp ]]
[Test the mutant idiom ]]
-[[[@../../test/test_structured_pair.cpp
+[[[@/libs/bimap/test/test_structured_pair.cpp
test_structured_pair.cpp ]]
[Test structured pair class ]]
-[[[@../../test/test_mutant_relation.cpp
+[[[@/libs/bimap/test/test_mutant_relation.cpp
test_mutant_relation.cpp ]]
[Test the relation class ]]
-[[[@../../test/test_bimap_set_of.cpp
+[[[@/libs/bimap/test/test_bimap_set_of.cpp
test_bimap_set_of.cpp ]]
[Library interface check ]]
-[[[@../../test/test_bimap_multiset_of.cpp
+[[[@/libs/bimap/test/test_bimap_multiset_of.cpp
test_bimap_multiset_of.cpp ]]
[Library interface check ]]
-[[[@../../test/test_bimap_unordered_set_of.cpp
+[[[@/libs/bimap/test/test_bimap_unordered_set_of.cpp
test_bimap_unordered_set_of.cpp ]]
[Library interface check ]]
-[[[@../../test/test_bimap_unordered_multiset_of.cpp
+[[[@/libs/bimap/test/test_bimap_unordered_multiset_of.cpp
test_bimap_unordered_multiset_of.cpp ]]
[Library interface check ]]
-[[[@../../test/test_bimap_list_of.cpp
+[[[@/libs/bimap/test/test_bimap_list_of.cpp
test_bimap_list_of.cpp ]]
[Library interface check ]]
-[[[@../../test/test_bimap_vector_of.cpp
+[[[@/libs/bimap/test/test_bimap_vector_of.cpp
test_bimap_vector_of.cpp ]]
[Library interface check ]]
-[[[@../../test/test_bimap_convenience_header.cpp
+[[[@/libs/bimap/test/test_bimap_convenience_header.cpp
test_bimap_convenience_header.cpp ]]
[Library interface check ]]
-[[[@../../test/test_bimap_ordered.cpp
+[[[@/libs/bimap/test/test_bimap_ordered.cpp
test_bimap_ordered.cpp ]]
[Test set and multiset based bimaps ]]
-[[[@../../test/test_bimap_unordered.cpp
+[[[@/libs/bimap/test/test_bimap_unordered.cpp
test_bimap_unordered.cpp ]]
[Test unordered_set and unordered_multiset based bimaps ]]
-[[[@../../test/test_bimap_sequenced.cpp
+[[[@/libs/bimap/test/test_bimap_sequenced.cpp
test_bimap_sequenced.cpp ]]
[Test list and vector based bimaps ]]
-[[[@../../test/test_bimap_unconstrained.cpp
+[[[@/libs/bimap/test/test_bimap_unconstrained.cpp
test_bimap_unconstrained.cpp ]]
[Test bimaps with unconstrained views ]]
-[[[@../../test/test_bimap_serialization.cpp
+[[[@/libs/bimap/test/test_bimap_serialization.cpp
test_bimap_serialization.cpp ]]
[Serialization support checks ]]
-[[[@../../test/test_bimap_property_map.cpp
+[[[@/libs/bimap/test/test_bimap_property_map.cpp
test_bimap_property_map.cpp ]]
[Property map concepts for the set and unordered set views ]]
-[[[@../../test/test_bimap_modify.cpp
+[[[@/libs/bimap/test/test_bimap_modify.cpp
test_bimap_modify.cpp ]]
[`replace`, `modify` and `operator[]` ]]
-[[[@../../test/test_bimap_lambda.cpp
+[[[@/libs/bimap/test/test_bimap_lambda.cpp
test_bimap_lambda.cpp ]]
[Test lambda modified idom support ]]
-[[[@../../test/test_bimap_assign.cpp
+[[[@/libs/bimap/test/test_bimap_assign.cpp
test_bimap_assign.cpp ]]
[Test Boost.Assign support ]]
-[[[@../../test/test_bimap_project.cpp
+[[[@/libs/bimap/test/test_bimap_project.cpp
test_bimap_project.cpp ]]
[Projection of iterators support ]]
-[[[@../../test/test_bimap_operator_bracket.cpp
+[[[@/libs/bimap/test/test_bimap_operator_bracket.cpp
test_bimap_operator_bracket.cpp ]]
[`operator[]` and `at()` functions ]]
-[[[@../../test/test_bimap_info.cpp
+[[[@/libs/bimap/test/test_bimap_info.cpp
test_bimap_info.cpp ]]
[Information hooking support ]]
-[[[@../../test/test_bimap_extra.cpp
+[[[@/libs/bimap/test/test_bimap_extra.cpp
test_bimap_extra.cpp ]]
[Additional checks ]]
-[[[@../../test/compile_fail/test_bimap_info_1.cpp
+[[[@/libs/bimap/test/compile_fail/test_bimap_info_1.cpp
test_bimap_info_1.cpp ]]
[Information hooking compilation fail test ]]
-[[[@../../test/compile_fail/test_bimap_info_2.cpp
+[[[@/libs/bimap/test/compile_fail/test_bimap_info_2.cpp
test_bimap_info_2.cpp ]]
[Information hooking compilation fail test ]]
-[[[@../../test/compile_fail/test_bimap_info_3.cpp
+[[[@/libs/bimap/test/compile_fail/test_bimap_info_3.cpp
test_bimap_info_3.cpp ]]
[Information hooking compilation fail test ]]
-[[[@../../test/compile_fail/test_bimap_mutable_1.cpp
+[[[@/libs/bimap/test/compile_fail/test_bimap_mutable_1.cpp
test_bimap_mutable_1.cpp ]]
[Mutable members compilation fail test ]]
-[[[@../../test/compile_fail/test_bimap_mutable_2.cpp
+[[[@/libs/bimap/test/compile_fail/test_bimap_mutable_2.cpp
test_bimap_mutable_2.cpp ]]
[Mutable members compilation fail test ]]
-[[[@../../test/compile_fail/test_bimap_mutable_3.cpp
+[[[@/libs/bimap/test/compile_fail/test_bimap_mutable_3.cpp
test_bimap_mutable_3.cpp ]]
[Mutable members compilation fail test ]]
Modified: branches/doc/libs/bimap/doc/tutorial.qbk
==============================================================================
--- branches/doc/libs/bimap/doc/tutorial.qbk (original)
+++ branches/doc/libs/bimap/doc/tutorial.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -141,7 +141,7 @@
This is a common source of errors in user code.
]
-[@../../example/standard_map_comparison.cpp Go to source code]
+[@/libs/bimap/example/standard_map_comparison.cpp Go to source code]
[import ../example/standard_map_comparison.cpp]
@@ -270,7 +270,7 @@
And now lets use it in a complete example
-[@../../example/population_bimap.cpp Go to source code]
+[@/libs/bimap/example/population_bimap.cpp Go to source code]
[import ../example/population_bimap.cpp]
@@ -282,7 +282,7 @@
We want to count the repetitions for each word in a text and print them
in order of appearance.
-[@../../example/repetitions_counter.cpp Go to source code]
+[@/libs/bimap/example/repetitions_counter.cpp Go to source code]
[import ../example/repetitions_counter.cpp]
@@ -339,7 +339,7 @@
trades insertion and deletion time against fast search capabilities and
the possibility of bidirectional iteration.
-[@../../example/mighty_bimap.cpp Go to source code]
+[@/libs/bimap/example/mighty_bimap.cpp Go to source code]
[code_mighty_bimap]
@@ -564,7 +564,7 @@
The following examples shows the behaviour of `at(key)`
-[@../../example/at_function_examples.cpp Go to source code]
+[@/libs/bimap/example/at_function_examples.cpp Go to source code]
[import ../example/at_function_examples.cpp]
@@ -644,7 +644,7 @@
Here is an example that uses projection:
-[@../../example/projection.cpp Go to source code]
+[@/libs/bimap/example/projection.cpp Go to source code]
[code_projection_years]
@@ -660,7 +660,7 @@
The `replace` family member functions performs in-place replacement of a given
element as the following example shows:
-[@../../example/tutorial_modify_and_replace.cpp Go to source code]
+[@/libs/bimap/example/tutorial_modify_and_replace.cpp Go to source code]
[code_tutorial_replace]
@@ -706,7 +706,7 @@
for a relation, two more complete the set: `_left` and `_right`.
]
-[@../../example/tutorial_modify_and_replace.cpp Go to source code]
+[@/libs/bimap/example/tutorial_modify_and_replace.cpp Go to source code]
[code_tutorial_modify]
@@ -750,7 +750,7 @@
[code_tutorial_range_unbounded]
-[@../../example/tutorial_range.cpp Go to source code]
+[@/libs/bimap/example/tutorial_range.cpp Go to source code]
[endsect]
@@ -763,7 +763,7 @@
In the following example, the library user inserted comments to guide
future programmers:
-[@../../example/user_defined_names.cpp Go to source code]
+[@/libs/bimap/example/user_defined_names.cpp Go to source code]
[code_user_defined_names_untagged_version]
@@ -785,7 +785,7 @@
Now we can rewrite the example:
-[@../../example/user_defined_names.cpp Go to source code]
+[@/libs/bimap/example/user_defined_names.cpp Go to source code]
[code_user_defined_names_tagged_version]
@@ -866,7 +866,7 @@
[code_unconstrained_collection_only_for_bimap]
-[@../../example/unconstrained_collection.cpp Go to source code]
+[@/libs/bimap/example/unconstrained_collection.cpp Go to source code]
[endsect]
@@ -931,7 +931,7 @@
[code_tutorial_info_hook_tagged_info]
-[@../../example/tutorial_info_hook.cpp Go to source code]
+[@/libs/bimap/example/tutorial_info_hook.cpp Go to source code]
[endsect]
Modified: branches/doc/libs/config/doc/config.qbk
==============================================================================
--- branches/doc/libs/config/doc/config.qbk (original)
+++ branches/doc/libs/config/doc/config.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -19,10 +19,10 @@
[/ Cited Boost resources ]
-[def __BOOST_REGRESSION_TEST_DRIVER__ [@../../../../tools/regression/doc/index.html boost regression test driver]]
-[def __BOOST_CONFIG_HEADER__ [@../../../../boost/config.hpp <boost/config.hpp>]]
-[def __BOOST_CONFIG_USER_HEADER__ [@../../../../boost/config/user.hpp <boost/config/user.hpp>]]
-[def __BOOST_CONFIG_SUFFIX_HEADER__ [@../../../../boost/config/user.hpp <boost/config/suffix.hpp>]]
+[def __BOOST_REGRESSION_TEST_DRIVER__ [@/tools/regression/doc/index.html boost regression test driver]]
+[def __BOOST_CONFIG_HEADER__ [@/boost/config.hpp <boost/config.hpp>]]
+[def __BOOST_CONFIG_USER_HEADER__ [@/boost/config/user.hpp <boost/config/user.hpp>]]
+[def __BOOST_CONFIG_SUFFIX_HEADER__ [@/boost/config/user.hpp <boost/config/suffix.hpp>]]
[def __BOOST_CONFIG_DIR__ ['<boost-root>]`/boost/config/`]
Modified: branches/doc/libs/config/doc/configuring_boost.qbk
==============================================================================
--- branches/doc/libs/config/doc/configuring_boost.qbk (original)
+++ branches/doc/libs/config/doc/configuring_boost.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -146,14 +146,14 @@
[[`BOOST_USER_CONFIG`][
When defined, it should point to the name of the user configuration file
to include prior to any boost configuration files. When not defined,
-defaults to [@../../../../boost/config/user.hpp `<boost/config/user.hpp>`].
+defaults to [@/boost/config/user.hpp `<boost/config/user.hpp>`].
]]
[[`BOOST_COMPILER_CONFIG`][
When defined, it should point to the name of the compiler configuration
file to use. Defining this cuts out the compiler selection logic, and
eliminates the dependency on the header containing that logic. For
example if you are using gcc, then you could define BOOST_COMPILER_CONFIG
-to [@../../../../boost/config/compiler/gcc.hpp `<boost/config/compiler/gcc.hpp>`].
+to [@/boost/config/compiler/gcc.hpp `<boost/config/compiler/gcc.hpp>`].
]]
[[`BOOST_STDLIB_CONFIG`][
When defined, it should point to the name of the standard library
@@ -161,14 +161,14 @@
selection logic, and eliminates the dependency on the header containing
that logic. For example if you are using STLport, then you could define
`BOOST_STDLIB_CONFIG` to
-[@../../../../boost/config/stdlib/stlport.hpp `<boost/config/stdlib/stlport.hpp>`].
+[@/boost/config/stdlib/stlport.hpp `<boost/config/stdlib/stlport.hpp>`].
]]
[[`BOOST_PLATFORM_CONFIG`][
When defined, it should point to the name of the platform configuration
file to use. Defining this cuts out the platform selection logic, and
eliminates the dependency on the header containing that logic. For example
if you are compiling on linux, then you could define `BOOST_PLATFORM_CONFIG`
-to [@../../../../boost/config/platform/linux.hpp `<boost/config/platform/linux.hpp>`].
+to [@/boost/config/platform/linux.hpp `<boost/config/platform/linux.hpp>`].
]]
[[`BOOST_NO_COMPILER_CONFIG`][
When defined, no compiler configuration file is selected or included,
@@ -316,11 +316,11 @@
rebuild our project if the boost code itself has changed, and not because the
boost config has been updated for more recent versions of Visual C++ or STLport.
We'll start by realising that the configuration files in use are:
-[@../../../../boost/config/compiler/visualc.hpp `<boost/config/compiler/visualc.hpp>`]
+[@/boost/config/compiler/visualc.hpp `<boost/config/compiler/visualc.hpp>`]
for the compiler,
-[@../../../../boost/config/stdlib/stlport.hpp `<boost/config/stdlib/stlport.hpp>`]
+[@/boost/config/stdlib/stlport.hpp `<boost/config/stdlib/stlport.hpp>`]
for the standard library, and
-[@../../../../boost/config/platform/win32.hpp `<boost/config/platform/win32.hpp>`]
+[@/boost/config/platform/win32.hpp `<boost/config/platform/win32.hpp>`]
for the platform. Next we'll create our own private configuration directory:
`boost/config/mysetup/`, and copy the configuration files into there. Finally,
open up __BOOST_CONFIG_USER_HEADER__ and edit the following defines:
Modified: branches/doc/libs/config/doc/guidelines.qbk
==============================================================================
--- branches/doc/libs/config/doc/guidelines.qbk (original)
+++ branches/doc/libs/config/doc/guidelines.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -180,16 +180,16 @@
__BOOST_CONFIG_USER_HEADER__ is included by default, don't add extra code to
this file unless you have to. If you do, please remember to update
-[@../../tools/configure.in libs/config/tools/configure.in] as well.
+[@/libs/config/tools/configure.in libs/config/tools/configure.in] as well.
__BOOST_CONFIG_SUFFIX_HEADER__ is always included so be careful about
modifying this file as it breaks dependencies for everyone. This file should
include only "boilerplate" configuration code, and generally should change
only when new macros are added.
-[@../../../../boost/config/select_compiler_config.hpp <boost/config/select_compiler_config.hpp>],
-[@../../../../boost/config/select_platform_config.hpp <boost/config/select_platform_config.hpp>] and
-[@../../../../boost/config/select_stdlib_config.hpp <boost/config/select_stdlib_config.hpp>]
+[@/boost/config/select_compiler_config.hpp <boost/config/select_compiler_config.hpp>],
+[@/boost/config/select_platform_config.hpp <boost/config/select_platform_config.hpp>] and
+[@/boost/config/select_stdlib_config.hpp <boost/config/select_stdlib_config.hpp>]
are included by default and should change only if support for a new
compiler/standard library/platform is added.
Modified: branches/doc/libs/config/doc/macro_reference.qbk
==============================================================================
--- branches/doc/libs/config/doc/macro_reference.qbk (original)
+++ branches/doc/libs/config/doc/macro_reference.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -174,7 +174,7 @@
[[`BOOST_NO_OPERATORS_IN_NAMESPACE`][Compiler][
Compiler requires inherited operator friend functions to be defined at
namespace scope, then using'ed to boost. Probably GCC specific. See
-[@../../../../boost/operators.hpp `<boost/operators.hpp>`] for example.
+[@/boost/operators.hpp `<boost/operators.hpp>`] for example.
]]
[[`BOOST_NO_PARTIAL_SPECIALIZATION_IMPLICIT_DEFAULT_ARGS`][Compiler][
The compiler does not correctly handle partial specializations
@@ -183,7 +183,7 @@
[[`BOOST_NO_POINTER_TO_MEMBER_CONST`][Compiler][
The compiler does not correctly handle pointers to const member functions,
preventing use of these in overloaded function templates. See
-[@../../../../boost/functional.hpp `<boost/functional.hpp>`] for example.
+[@/boost/functional.hpp `<boost/functional.hpp>`] for example.
]]
[[`BOOST_NO_POINTER_TO_MEMBER_TEMPLATE_PARAMETERS`][Compiler][
Pointers to members don't work when used as template parameters.
@@ -356,7 +356,7 @@
[[`BOOST_HAS_NRVO`][Compiler][
Indicated that the compiler supports the named return value optimization
(NRVO). Used to select the most efficient implementation for some function.
-See [@../../../../boost/operators.hpp `<boost/operators.hpp>`] for example.
+See [@/boost/operators.hpp `<boost/operators.hpp>`] for example.
]]
[[`BOOST_HAS_PARTIAL_STD_ALLOCATOR`][Standard Library][
The standard library has a partially conforming `std::allocator` class, but
Modified: branches/doc/libs/foreach/doc/foreach.qbk
==============================================================================
--- branches/doc/libs/foreach/doc/foreach.qbk (original)
+++ branches/doc/libs/foreach/doc/foreach.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -27,14 +27,14 @@
[/ Links ]
[def _foreach_ [^BOOST_FOREACH]]
-[def _range_ [@../../libs/range/index.html Boost.Range]]
-[def _iterator_range_ [@../../libs/range/doc/utility_class.html#iter_range `boost::iterator_range<>`]]
-[def _sub_range_ [@../../libs/range/doc/utility_class.html#sub_range `boost::sub_range<>`]]
-[def _extending_range_ [@../../libs/range/doc/boost_range.html#minimal_interface Extending Boost.Range]]
-[def _single_pass_range_concept_ [@../../libs/range/doc/range.html#single_pass_range Single Pass Range Concept]]
-[def _range_portability_ [@../../libs/range/doc/portability.html Boost.Range Portability]]
-[def _noncopyable_ [@../../libs/utility/utility.htm#Class_noncopyable `boost::noncopyable`]]
-[def _iterator_ [@../../libs/iterator/doc/index.html Boost.Iterator]]
+[def _range_ [@/libs/range/index.html Boost.Range]]
+[def _iterator_range_ [@/libs/range/doc/utility_class.html#iter_range `boost::iterator_range<>`]]
+[def _sub_range_ [@/libs/range/doc/utility_class.html#sub_range `boost::sub_range<>`]]
+[def _extending_range_ [@/libs/range/doc/boost_range.html#minimal_interface Extending Boost.Range]]
+[def _single_pass_range_concept_ [@/libs/range/doc/range.html#single_pass_range Single Pass Range Concept]]
+[def _range_portability_ [@/libs/range/doc/portability.html Boost.Range Portability]]
+[def _noncopyable_ [@/libs/utility/utility.htm#Class_noncopyable `boost::noncopyable`]]
+[def _iterator_ [@/libs/iterator/doc/index.html Boost.Iterator]]
[section Introduction]
Modified: branches/doc/libs/function_types/doc/function_types.qbk
==============================================================================
--- branches/doc/libs/function_types/doc/function_types.qbk (original)
+++ branches/doc/libs/function_types/doc/function_types.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -16,11 +16,11 @@
[def __unspecified__ /unspecified/]
-[def __mpl__ [@../../../mpl/index.html MPL]]
-[def __mpl_integral_constant__ __mpl__ - [@../../../mpl/doc/refmanual/integral-constant.html Integral Constant]]
-[def __mpl_fwd_seq__ __mpl__ - [@../../../mpl/doc/refmanual/forward-sequence.html Forward Sequence]]
-[def __mpl_fb_ext_ra_seq__ __mpl__ - [@../../../mpl/doc/refmanual/front-extensible-sequence.html Front] / [@../../../mpl/doc/refmanual/back-extensible-sequence.html Back ][@../../../mpl/doc/refmanual/extensible-sequence.html Extensible ][@../../../mpl/doc/refmanual/random-access-sequence.html Random Access Sequence]]
-[def __mpl_lambda_expression__ __mpl__ - [@../../../mpl/doc/refmanual/lambda-expression.html Lambda Expression]]
+[def __mpl__ [@/libs/mpl/index.html MPL]]
+[def __mpl_integral_constant__ __mpl__ - [@/libs/mpl/doc/refmanual/integral-constant.html Integral Constant]]
+[def __mpl_fwd_seq__ __mpl__ - [@/libs/mpl/doc/refmanual/forward-sequence.html Forward Sequence]]
+[def __mpl_fb_ext_ra_seq__ __mpl__ - [@/libs/mpl/doc/refmanual/front-extensible-sequence.html Front] / [@/libs/mpl/doc/refmanual/back-extensible-sequence.html Back ][@/libs/mpl/doc/refmanual/extensible-sequence.html Extensible ][@/libs/mpl/doc/refmanual/random-access-sequence.html Random Access Sequence]]
+[def __mpl_lambda_expression__ __mpl__ - [@/libs/mpl/doc/refmanual/lambda-expression.html Lambda Expression]]
[def __is_function [link boost_functiontypes.reference.classification.is_function is_function]]
[def __is_function_pointer [link boost_functiontypes.reference.classification.is_function_pointer is_function_pointer]]
@@ -148,9 +148,9 @@
}
The combination with a tuples library that provides an invoker component, such
-as [@../../../fusion/index.html Boost.Fusion], allows to build flexible callback
+as [@/libs/fusion/index.html Boost.Fusion], allows to build flexible callback
facilities that are entirely free of repetitive code as shown by the
-[@../../../function_types/example/interpreter.hpp interpreter example].
+[@/libs/function_types/example/interpreter.hpp interpreter example].
When taking the address of an overloaded function or function template, the
type of the function must be known from the context the expression is used
@@ -192,15 +192,15 @@
deduction from a function call because the exact types from the sequence
are used to specialize the template (including possibly cv-qualified
reference types and the result type). It is applied twice in the
-[@../../../function_types/example/interface.hpp interface example].
+[@/libs/function_types/example/interface.hpp interface example].
Another interersting property of callable, builtin types is that they can be
valid types for non-type template parameters. This way, a function can be
pinpointed at compile time, allowing the compiler to eliminate the call by
inlining.
-The [@../../../function_types/example/fast_mem_fn.hpp fast_mem_fn example]
+The [@/libs/function_types/example/fast_mem_fn.hpp fast_mem_fn example]
exploits this characteristic and implements a potentially inlining version of
-[@../../../bind/mem_fn.html boost::mem_fn]
+[@/libs/bind/mem_fn.html boost::mem_fn]
limited to member functions that are known at compile time.
[endsect]
@@ -862,9 +862,9 @@
[section:BOOST_FT_CC_NAMES BOOST_FT_CC_NAMES]
-Expands to a [@../../../preprocessor/doc/data/sequences.html sequence] of
-ternary [@../../../preprocessor/doc/data/tuples.html tuples] (these data
-types are defined in the [@../../../preprocessor/doc/index.html
+Expands to a [@/libs/preprocessor/doc/data/sequences.html sequence] of
+ternary [@/libs/preprocessor/doc/data/tuples.html tuples] (these data
+types are defined in the [@/libs/preprocessor/doc/index.html
documentation of the Boost Preprocessor library]).
Each sequence element describes one calling convention specifier.
The first element in each tuple is the macro suffix for
@@ -872,8 +872,8 @@
the second element is the name of the tag that describes the calling
convention and the third is the name of the specifier.
The specifier is allowed to be an empty string, so the third tuple element
-is either [@../../../preprocessor/doc/ref/empty.html [^BOOST_PP_EMPTY]] or
-[@../../../preprocessor/doc/ref/identity.html [^BOOST_PP_IDENTITY]][^(['name])].
+is either [@/libs/preprocessor/doc/ref/empty.html [^BOOST_PP_EMPTY]] or
+[@/libs/preprocessor/doc/ref/identity.html [^BOOST_PP_IDENTITY]][^(['name])].
Define this macro to extend the set of possible names for custom calling
conventions. The macro expands to nothing by default.
@@ -1013,10 +1013,10 @@
MPL provides algorithms on Sequences, so transformations (such as turning
by-value parameter types into const references for optimized forwarding
or computing a signature to specialize
-[@../../../function/index.html [^boost::function]] after applying
-[@../../../bind/index.html [^boost::bind]]) can be expressed more
+[@/libs/function/index.html [^boost::function]] after applying
+[@/libs/bind/index.html [^boost::bind]]) can be expressed more
easily. The MPL Sequence concept is compatible with several other Boost
-libraries (most importantly [@../../../fusion/index.html Fusion]),
+libraries (most importantly [@/libs/fusion/index.html Fusion]),
so another reason is interoperability.
@@ -1075,7 +1075,7 @@
A cv-qualified pointer is still a pointer. It usually doesn't matter and
even if it does, it's a job for
-[@../../../type_traits/index.html Boost.TypeTraits].
+[@/libs/type_traits/index.html Boost.TypeTraits].
[endsect]
Modified: branches/doc/libs/functional/hash/doc/intro.qbk
==============================================================================
--- branches/doc/libs/functional/hash/doc/intro.qbk (original)
+++ branches/doc/libs/functional/hash/doc/intro.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -13,11 +13,11 @@
TR1]]
[def __unordered__ [link unordered Boost.Unordered]]
[def __intrusive__ [link intrusive.unordered_set_unordered_multiset Boost.Intrusive]]
-[def __multi-index__ [@../../libs/multi_index/doc/index.html
+[def __multi-index__ [@/libs/multi_index/doc/index.html
Boost Multi-Index Containers Library]]
-[def __multi-index-short__ [@../../libs/multi_index/doc/index.html
+[def __multi-index-short__ [@/libs/multi_index/doc/index.html
Boost.MultiIndex]]
-[def __bimap__ [@../../libs/bimap/index.html Boost.Bimap]]
+[def __bimap__ [@/libs/bimap/index.html Boost.Bimap]]
[def __issues__
[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1837.pdf
Library Extension Technical Report Issues List]]
Modified: branches/doc/libs/functional/hash/doc/portability.qbk
==============================================================================
--- branches/doc/libs/functional/hash/doc/portability.qbk (original)
+++ branches/doc/libs/functional/hash/doc/portability.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -88,7 +88,7 @@
}
Full code for this example is at
-[@../../libs/functional/hash/examples/portable.cpp /libs/functional/hash/examples/portable.cpp].
+[@/libs/functional/hash/examples/portable.cpp /libs/functional/hash/examples/portable.cpp].
[h2 Other Issues]
Modified: branches/doc/libs/functional/hash/doc/tutorial.qbk
==============================================================================
--- branches/doc/libs/functional/hash/doc/tutorial.qbk (original)
+++ branches/doc/libs/functional/hash/doc/tutorial.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -3,7 +3,7 @@
/ 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) ]
-[def __multi-index-short__ [@../../libs/multi_index/doc/index.html
+[def __multi-index-short__ [@/libs/multi_index/doc/index.html
Boost.MultiIndex]]
[section:tutorial Tutorial]
@@ -110,9 +110,9 @@
assert(books.find(dandelion) == books.end());
The full example can be found in:
-[@../../libs/functional/hash/examples/books.cpp /libs/functional/hash/examples/books.hpp]
+[@/libs/functional/hash/examples/books.cpp /libs/functional/hash/examples/books.hpp]
and
-[@../../libs/functional/hash/examples/books.cpp /libs/functional/hash/examples/books.cpp].
+[@/libs/functional/hash/examples/books.cpp /libs/functional/hash/examples/books.cpp].
[tip
When writing a hash function, first look at how the equality function works.
@@ -170,7 +170,7 @@
[funcref boost::hash_value hash_value] on the supplied element, and combines it with the seed.
Full code for this example is at
-[@../../libs/functional/hash/examples/point.cpp /libs/functional/hash/examples/point.cpp].
+[@/libs/functional/hash/examples/point.cpp /libs/functional/hash/examples/point.cpp].
[note
When using [funcref boost::hash_combine] the order of the
Modified: branches/doc/libs/interprocess/doc/interprocess.qbk
==============================================================================
--- branches/doc/libs/interprocess/doc/interprocess.qbk (original)
+++ branches/doc/libs/interprocess/doc/interprocess.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -5704,7 +5704,7 @@
to the segment manager. Because of this,
in [*Boost.Interprocess] all managed memory segments derive from a common class that
implements memory-independent (shared memory, memory mapped files) functions:
-[@../../boost/interprocess/detail/managed_memory_impl.hpp
+[@/boost/interprocess/detail/managed_memory_impl.hpp
boost::interprocess::detail::basic_managed_memory_impl]
Deriving from this class, [*Boost.Interprocess] implements several managed memory
@@ -5766,7 +5766,7 @@
to the segment manager.
The pool is implemented by the
-[@../../boost/interprocess/allocators/detail/node_pool.hpp
+[@/boost/interprocess/allocators/detail/node_pool.hpp
private_node_pool and shared_node_pool] classes.
[endsect]
@@ -5809,7 +5809,7 @@
to the segment manager.
The adaptive pool is implemented by the
-[@../../boost/interprocess/allocators/detail/adaptive_node_pool.hpp
+[@/boost/interprocess/allocators/detail/adaptive_node_pool.hpp
private_adaptive_node_pool and adaptive_node_pool] classes.
[endsect]
Modified: branches/doc/libs/intrusive/doc/intrusive.qbk
==============================================================================
--- branches/doc/libs/intrusive/doc/intrusive.qbk (original)
+++ branches/doc/libs/intrusive/doc/intrusive.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -3011,7 +3011,7 @@
`test_list` objects to funtion objects taking pointers to them.
You can find the full test code code in the
-[@../../libs/intrusive/perf/perf_list.cpp perf_list.cpp] source file.
+[@/libs/intrusive/perf/perf_list.cpp perf_list.cpp] source file.
[section:performance_results_push_back Back insertion and destruction]
Modified: branches/doc/libs/iterator/doc/quickbook/adaptor.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/adaptor.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/adaptor.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -288,7 +288,7 @@
You can see an example program that exercises this version of the
node iterators
-[@../example/node_iterator3.cpp `here`].
+[@/libs/iterator/example/node_iterator3.cpp `here`].
In the case of `node_iter`, it's not very compelling to pass
Modified: branches/doc/libs/iterator/doc/quickbook/counting_iterator.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/counting_iterator.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/counting_iterator.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -39,7 +39,7 @@
indirectly printing out the numbers from 0 to 7
0 1 2 3 4 5 6
-The source code for this example can be found [@../example/counting_iterator_example.cpp here].
+The source code for this example can be found [@/libs/iterator/example/counting_iterator_example.cpp here].
[h2 Reference]
Modified: branches/doc/libs/iterator/doc/quickbook/facade_tutorial.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/facade_tutorial.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/facade_tutorial.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -255,7 +255,7 @@
Voila; a complete and conforming readable, forward-traversal
iterator! For a working example of its use, see
-[@../example/node_iterator1.cpp `this program`].
+[@/libs/iterator/example/node_iterator1.cpp `this program`].
__ ../example/node_iterator1.cpp
@@ -432,7 +432,7 @@
You can see an example program which exercises our interoperable
iterators
-[@../example/node_iterator2.cpp `here`].
+[@/libs/iterator/example/node_iterator2.cpp `here`].
[h2 Telling the Truth]
Modified: branches/doc/libs/iterator/doc/quickbook/filter_iterator.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/filter_iterator.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/filter_iterator.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -75,7 +75,7 @@
0 -1 4 5 8
-The source code for this example can be found [@../example/filter_iterator_example.cpp here].
+The source code for this example can be found [@/libs/iterator/example/filter_iterator_example.cpp here].
[h2 Reference]
Modified: branches/doc/libs/iterator/doc/quickbook/indirect_iterator.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/indirect_iterator.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/indirect_iterator.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -73,7 +73,7 @@
The source code for this example can be found
-[@../example/indirect_iterator_example.cpp here].
+[@/libs/iterator/example/indirect_iterator_example.cpp here].
[h2 Reference]
Modified: branches/doc/libs/iterator/doc/quickbook/iterator.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/iterator.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/iterator.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -28,7 +28,7 @@
[/ Links ]
-[def _iterator_ [@../../libs/iterator/doc/index.html Boost.Iterator]]
+[def _iterator_ [@/libs/iterator/doc/index.html Boost.Iterator]]
[section:intro Introduction]
@@ -112,7 +112,7 @@
[def _transform_ [@./transform_iterator.html `transform_iterator`]]
[def _zip_ [@./zip_iterator.html `zip_iterator`]]
-[def _shared_ptr_ [@../../smart_ptr/shared_ptr.htm `shared_ptr`]]
+[def _shared_ptr_ [@/libs/smart_ptr/shared_ptr.htm `shared_ptr`]]
* _counting_: an iterator over a sequence of consecutive values.
Implements a "lazy sequence"
@@ -152,7 +152,7 @@
[def _pointee_ [@./pointee.html `pointee.hpp`]]
[def _iterator_traits_ [@./iterator_traits.html `iterator_traits.hpp`]]
[def _interoperable_ [@./interoperable.html `interoperable.hpp`]]
-[def _MPL_ [@../../mpl/doc/index.html [*MPL]]]
+[def _MPL_ [@/libs/mpl/doc/index.html [*MPL]]]
* _pointee_: Provides the capability to deduce the referent types
of pointers, smart pointers and iterators in generic code. Used
Modified: branches/doc/libs/iterator/doc/quickbook/permutation_iterator.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/permutation_iterator.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/permutation_iterator.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -84,7 +84,7 @@
The source code for this example can be found
-[@../example/permutation_iter_example.cpp here].
+[@/libs/iterator/example/permutation_iter_example.cpp here].
[h2 Reference]
Modified: branches/doc/libs/iterator/doc/quickbook/reverse_iterator.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/reverse_iterator.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/reverse_iterator.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -41,7 +41,7 @@
The source code for this example can be found
-[@../example/reverse_iterator_example.cpp here].
+[@/libs/iterator/example/reverse_iterator_example.cpp here].
[h2 Reference]
Modified: branches/doc/libs/iterator/doc/quickbook/shared_container_iterator.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/shared_container_iterator.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/shared_container_iterator.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -1,7 +1,7 @@
[section:shared_container Shared Container Iterator]
-Defined in header [@../../../boost/shared_container_iterator.hpp `boost/shared_container_iterator.hpp`].
+Defined in header [@/boost/shared_container_iterator.hpp `boost/shared_container_iterator.hpp`].
The purpose of the shared container iterator is to attach the lifetime
of a container to the lifetime of its iterators. In other words, the
@@ -56,7 +56,7 @@
returns, the `shared_counter_iterator` objects maintain references to
the underlying vector and thereby extend the container's lifetime.
-[@../../../libs/utility/shared_iterator_example1.cpp `shared_iterator_example1.cpp`]:
+[@/libs/utility/shared_iterator_example1.cpp `shared_iterator_example1.cpp`]:
#include "shared_container_iterator.hpp"
#include "boost/shared_ptr.hpp"
@@ -139,7 +139,7 @@
This example, similar to the previous,
uses `make_shared_container_iterator()` to create the iterators.
-[@../../../libs/utility/shared_iterator_example2.cpp `shared_iterator_example2.cpp`]:
+[@/libs/utility/shared_iterator_example2.cpp `shared_iterator_example2.cpp`]:
#include "shared_container_iterator.hpp"
#include "boost/shared_ptr.hpp"
@@ -200,7 +200,7 @@
In the following example, a range of values is returned as a pair of shared_container_iterator objects.
-[@../../../libs/utility/shared_iterator_example3.cpp `shared_iterator_example3.cpp`]:
+[@/libs/utility/shared_iterator_example3.cpp `shared_iterator_example3.cpp`]:
#include "shared_container_iterator.hpp"
#include "boost/shared_ptr.hpp"
Modified: branches/doc/libs/iterator/doc/quickbook/traits.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/traits.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/traits.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -55,12 +55,12 @@
[h2 Broken Compiler Notes]
Because of workarounds in Boost, you may find that these
-[@../../mpl/doc/index.html#metafunctions metafunctions] actually work better than the facilities provided by
+[@/libs/mpl/doc/index.html#metafunctions metafunctions] actually work better than the facilities provided by
your compiler's standard library.
On compilers that don't support partial specialization, such as
Microsoft Visual C++ 6.0 or 7.0, you may need to manually invoke
-[@../../type_traits/index.html#transformations BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION] on the
+[@/libs/type_traits/index.html#transformations BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION] on the
`value_type` of pointers that are passed to these metafunctions.
Because of bugs in the implementation of GCC-2.9x, the name of
Modified: branches/doc/libs/iterator/doc/quickbook/transform_iterator.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/transform_iterator.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/transform_iterator.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -44,7 +44,7 @@
The source code for this example can be found
-[@../example/transform_iterator_example.cpp here].
+[@/libs/iterator/example/transform_iterator_example.cpp here].
[h2 Reference]
Modified: branches/doc/libs/iterator/doc/quickbook/utilities.qbk
==============================================================================
--- branches/doc/libs/iterator/doc/quickbook/utilities.qbk (original)
+++ branches/doc/libs/iterator/doc/quickbook/utilities.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -122,7 +122,7 @@
For an introduction to using concept checking classes, see
the documentation for the
-[@../../concept_check/index.html `boost::concept_check`] library.
+[@/libs/concept_check/index.html `boost::concept_check`] library.
[h2 Reference]
Modified: branches/doc/libs/math/doc/gcd/math-gcd.qbk
==============================================================================
--- branches/doc/libs/math/doc/gcd/math-gcd.qbk (original)
+++ branches/doc/libs/math/doc/gcd/math-gcd.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -57,7 +57,7 @@
[section GCD Function Object]
-[*Header: ] [@../../../../../boost/math/common_factor_rt.hpp <boost/math/common_factor_rt.hpp>]
+[*Header: ] [@/boost/math/common_factor_rt.hpp <boost/math/common_factor_rt.hpp>]
template < typename IntegerType >
class boost::math::gcd_evaluator
@@ -89,7 +89,7 @@
[section LCM Function Object]
-[*Header: ] [@../../../../../boost/math/common_factor_rt.hpp <boost/math/common_factor_rt.hpp>]
+[*Header: ] [@/boost/math/common_factor_rt.hpp <boost/math/common_factor_rt.hpp>]
template < typename IntegerType >
class boost::math::lcm_evaluator
@@ -122,7 +122,7 @@
[section:run_time Run-time GCD & LCM Determination]
-[*Header: ] [@../../../../../boost/math/common_factor_rt.hpp <boost/math/common_factor_rt.hpp>]
+[*Header: ] [@/boost/math/common_factor_rt.hpp <boost/math/common_factor_rt.hpp>]
template < typename IntegerType >
IntegerType boost::math::gcd( IntegerType const &a, IntegerType const &b );
@@ -143,7 +143,7 @@
[section:compile_time Compile time GCD and LCM determination]
-[*Header: ] [@../../../../../boost/math/common_factor_ct.hpp <boost/math/common_factor_ct.hpp>]
+[*Header: ] [@/boost/math/common_factor_ct.hpp <boost/math/common_factor_ct.hpp>]
template < unsigned long Value1, unsigned long Value2 >
struct boost::math::static_gcd
@@ -198,8 +198,8 @@
[section:header Header <boost/math/common_factor.hpp>]
This header simply includes the headers
-[@../../../../../boost/math/common_factor_ct.hpp <boost/math/common_factor_ct.hpp>]
-and [@../../../../../boost/math/common_factor_rt.hpp <boost/math/common_factor_rt.hpp>].
+[@/boost/math/common_factor_ct.hpp <boost/math/common_factor_ct.hpp>]
+and [@/boost/math/common_factor_rt.hpp <boost/math/common_factor_rt.hpp>].
Note this is a legacy header: it used to contain the actual implementation,
but the compile-time and run-time facilities
@@ -209,7 +209,7 @@
[section:demo Demonstration Program]
-The program [@../../../../../libs/math/test/common_factor_test.cpp common_factor_test.cpp] is a demonstration of the results from
+The program [@/libs/math/test/common_factor_test.cpp common_factor_test.cpp] is a demonstration of the results from
instantiating various examples of the run-time GCD and LCM function
templates and the compile-time GCD and LCM class templates.
(The run-time GCD and LCM class templates are tested indirectly through
Modified: branches/doc/libs/math/doc/math.qbk
==============================================================================
--- branches/doc/libs/math/doc/math.qbk (original)
+++ branches/doc/libs/math/doc/math.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -34,7 +34,7 @@
[[Complex Number Inverse Trigonometric Functions
- [@../complex/html/index.html HTML Docs]
+ [@/libs/math/doc/complex/html/index.html HTML Docs]
[@http:svn.boost.org/svn/boost/sandbox/pdf/math/release/complex-tr1.pdf
PDF Docs]]
@@ -46,7 +46,7 @@
[[Greatest Common Divisor and Least Common Multiple
- [@../gcd/html/index.html HTML Docs]
+ [@/libs/math/doc/gcd/html/index.html HTML Docs]
[@http:svn.boost.org/svn/boost/sandbox/pdf/math/release/math-gcd.pdf
PDF Docs]]
@@ -60,12 +60,12 @@
[[Octonions
-[@../octonion/html/index.html HTML Docs]
+[@/libs/math/doc/octonion/html/index.html HTML Docs]
[@http:svn.boost.org/svn/boost/sandbox/pdf/math/release/octonion.pdf
PDF Docs]]
[
-Octonions, like [@../quaternion/html/index.html quaternions], are a relative of complex numbers.
+Octonions, like [@/libs/math/doc/quaternion/html/index.html quaternions], are a relative of complex numbers.
Octonions see some use in theoretical physics.
@@ -80,11 +80,11 @@
associative] (i.e. there are quaternions ['[^x]], ['[^y]] and ['[^z]] such that __oct_not_equal).
A way of remembering things is by using the following multiplication table:
-[$../../octonion/graphics/octonion_blurb17.jpeg]
+[$/libs/math/octonion/graphics/octonion_blurb17.jpeg]
Octonions (and their kin) are described in far more details in this other
-[@../../quaternion/TQE.pdf document]
-(with [@../../quaternion/TQE_EA.pdf errata and addenda]).
+[@/libs/math/quaternion/TQE.pdf document]
+(with [@/libs/math/quaternion/TQE_EA.pdf errata and addenda]).
Some traditional constructs, such as the exponential, carry over without too
much change into the realms of octonions, but other, such as taking a square root,
@@ -95,7 +95,7 @@
[[Special Functions
-[@../sf_and_dist/html/index.html HTML Docs]
+[@/libs/math/doc/sf_and_dist/html/index.html HTML Docs]
[@http:svn.boost.org/svn/boost/sandbox/pdf/math/release/math.pdf
PDF Docs]]
@@ -120,7 +120,7 @@
[[Statistical Distributions
-[@../sf_and_dist/html/index.html HTML Docs]
+[@/libs/math/doc/sf_and_dist/html/index.html HTML Docs]
[@http:svn.boost.org/svn/boost/sandbox/pdf/math/release/math.pdf
PDF Docs]]
@@ -137,7 +137,7 @@
[[Quaternions
-[@../quaternion/html/index.html HTML Docs]
+[@/libs/math/doc/quaternion/html/index.html HTML Docs]
[@http:svn.boost.org/svn/boost/sandbox/pdf/math/release/quaternion.pdf
PDF Docs]]
@@ -171,8 +171,8 @@
things is by using the formula ['[^i*i = j*j = k*k = -1]].
Quaternions (and their kin) are described in far more details in this
-other [@../../quaternion/TQE.pdf document]
-(with [@../../quaternion/TQE_EA.pdf errata and addenda]).
+other [@/libs/math/quaternion/TQE.pdf document]
+(with [@/libs/math/quaternion/TQE_EA.pdf errata and addenda]).
Some traditional constructs, such as the exponential, carry over without
too much change into the realms of quaternions, but other, such as taking
@@ -186,41 +186,41 @@
[table
[[Library][Description]]
- [[[@../../../integer/index.html Integer]]
+ [[[@/libs/integer/index.html Integer]]
[Headers to ease dealing with integral types.]]
- [[[@../../../numeric/interval/doc/interval.htm Interval]]
+ [[[@/libs/numeric/interval/doc/interval.htm Interval]]
[As implied by its name, this library is intended to help manipulating
mathematical intervals. It consists of a single header
<boost/numeric/interval.hpp> and principally a type which can be
used as interval<T>. ]]
- [[[@../../../multi_array/doc/index.html Multi Array]]
+ [[[@/libs/multi_array/doc/index.html Multi Array]]
[Boost.MultiArray provides a generic N-dimensional array concept
definition and common implementations of that interface.]]
- [[[@../../../numeric/conversion/index.html Numeric.Conversion]]
+ [[[@/libs/numeric/conversion/index.html Numeric.Conversion]]
[The Boost Numeric Conversion library is a collection of tools to
describe and perform conversions between values of different numeric types.]]
- [[[@../../../utility/operators.htm Operators]]
+ [[[@/libs/utility/operators.htm Operators]]
[The header <boost/operators.hpp> supplies several sets of class
templates (in namespace boost). These templates define operators at
namespace scope in terms of a minimal number of fundamental
operators provided by the class.]]
- [[[@../../../random/index.html Random]]
+ [[[@/libs/random/index.html Random]]
[Random numbers are useful in a variety of applications. The Boost
Random Number Library (Boost.Random for short) provides a vast variety
of generators and distributions to produce random numbers having useful
properties, such as uniform distribution.]]
- [[[@../../../rational/index.html Rational]]
+ [[[@/libs/rational/index.html Rational]]
[The header rational.hpp provides an implementation of rational numbers.
The implementation is template-based, in a similar manner to the
standard complex number class.]]
- [[[@../../../numeric/ublas/doc/index.htm uBLAS]]
+ [[[@/libs/numeric/ublas/doc/index.htm uBLAS]]
[uBLAS is a C++ template class library that provides BLAS level 1, 2, 3
functionality for dense, packed and sparse matrices. The design and
implementation unify mathematical notation via operator overloading and
Modified: branches/doc/libs/math/doc/octonion/math-octonion.qbk
==============================================================================
--- branches/doc/libs/math/doc/octonion/math-octonion.qbk (original)
+++ branches/doc/libs/math/doc/octonion/math-octonion.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -42,7 +42,7 @@
[section Overview]
-Octonions, like [@../../quaternion/html/index.html quaternions], are a relative of complex numbers.
+Octonions, like [@/libs/math/doc/quaternion/html/index.html quaternions], are a relative of complex numbers.
Octonions see some use in theoretical physics.
@@ -60,8 +60,8 @@
[$../../../octonion/graphics/octonion_blurb17.jpeg]
Octonions (and their kin) are described in far more details in this other
-[@../../../quaternion/TQE.pdf document]
-(with [@../../../quaternion/TQE_EA.pdf errata and addenda]).
+[@/libs/math/quaternion/TQE.pdf document]
+(with [@/libs/math/quaternion/TQE_EA.pdf errata and addenda]).
Some traditional constructs, such as the exponential, carry over without too
much change into the realms of octonions, but other, such as taking a square root,
@@ -74,7 +74,7 @@
[section Header File]
The interface and implementation are both supplied by the header file
-[@../../../../../boost/math/octonion.hpp octonion.hpp].
+[@/boost/math/octonion.hpp octonion.hpp].
[endsect]
@@ -888,9 +888,9 @@
transcendentals of this type could be added in a further revision upon
request. It should be noted that it is these functions which force the
dependency upon the
-[@../../../../../boost/math/special_functions/sinc.hpp boost/math/special_functions/sinc.hpp]
+[@/boost/math/special_functions/sinc.hpp boost/math/special_functions/sinc.hpp]
and the
-[@../../../../../boost/math/special_functions/sinhc.hpp boost/math/special_functions/sinhc.hpp]
+[@/boost/math/special_functions/sinhc.hpp boost/math/special_functions/sinhc.hpp]
headers.
[h4 exp]
@@ -953,12 +953,12 @@
[section Test Program]
-The [@../../../octonion/octonion_test.cpp octonion_test.cpp]
+The [@/libs/math/octonion/octonion_test.cpp octonion_test.cpp]
test program tests octonions specialisations for float, double and long double
-([@../../../octonion/output.txt sample output]).
+([@/libs/math/octonion/output.txt sample output]).
If you define the symbol BOOST_OCTONION_TEST_VERBOSE, you will get additional
-output ([@../../../octonion/output_more.txt verbose output]); this will
+output ([@/libs/math/octonion/output_more.txt verbose output]); this will
only be helpfull if you enable message output at the same time, of course
(by uncommenting the relevant line in the test or by adding --log_level=messages
to your command line,...). In that case, and if you are running interactively,
Modified: branches/doc/libs/math/doc/quaternion/math-quaternion.qbk
==============================================================================
--- branches/doc/libs/math/doc/quaternion/math-quaternion.qbk (original)
+++ branches/doc/libs/math/doc/quaternion/math-quaternion.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -70,8 +70,8 @@
things is by using the formula ['[^i*i = j*j = k*k = -1]].
Quaternions (and their kin) are described in far more details in this
-other [@../../../quaternion/TQE.pdf document]
-(with [@../../../quaternion/TQE_EA.pdf errata and addenda]).
+other [@/libs/math/quaternion/TQE.pdf document]
+(with [@/libs/math/quaternion/TQE_EA.pdf errata and addenda]).
Some traditional constructs, such as the exponential, carry over without
too much change into the realms of quaternions, but other, such as taking
@@ -82,7 +82,7 @@
[section Header File]
The interface and implementation are both supplied by the header file
-[@../../../../../boost/math/quaternion.hpp quaternion.hpp].
+[@/boost/math/quaternion.hpp quaternion.hpp].
[endsect]
@@ -782,9 +782,9 @@
library with which the conversions could work. This should be remedied in
a further revision. In the mean time, an example of how this could be
done is presented here for
-[@../../../quaternion/HSO3.hpp __R3], and here for
-[@../../../quaternion/HSO4.hpp __R4]
-([@../../../quaternion/HSO3SO4.cpp example test file]).
+[@/libs/math/quaternion/HSO3.hpp __R3], and here for
+[@/libs/math/quaternion/HSO4.hpp __R4]
+([@/libs/math/quaternion/HSO3SO4.cpp example test file]).
[endsect]
@@ -812,8 +812,8 @@
closed formula in __C can be transposed to __H. More transcendentals of this
type could be added in a further revision upon request. It should be
noted that it is these functions which force the dependency upon the
-[@../../../../../boost/math/special_functions/sinc.hpp boost/math/special_functions/sinc.hpp] and the
-[@../../../../../boost/math/special_functions/sinhc.hpp boost/math/special_functions/sinhc.hpp] headers.
+[@/boost/math/special_functions/sinc.hpp boost/math/special_functions/sinc.hpp] and the
+[@/boost/math/special_functions/sinhc.hpp boost/math/special_functions/sinhc.hpp] headers.
[h4 exp]
@@ -867,13 +867,13 @@
[section Test Program]
-The [@../../../quaternion/quaternion_test.cpp quaternion_test.cpp]
+The [@/libs/math/quaternion/quaternion_test.cpp quaternion_test.cpp]
test program tests quaternions specializations for float, double and long double
-([@../../../quaternion/output.txt sample output], with message output
+([@/libs/math/quaternion/output.txt sample output], with message output
enabled).
If you define the symbol boost_quaternions_TEST_VERBOSE, you will get
-additional output ([@../../../quaternion/output_more.txt verbose output]);
+additional output ([@/libs/math/quaternion/output_more.txt verbose output]);
this will only be helpfull if you enable message output at the same time,
of course (by uncommenting the relevant line in the test or by adding
[^--log_level=messages] to your command line,...). In that case, and if you
@@ -888,8 +888,8 @@
Please refer to the following PDF's:
-*[@../../../quaternion/TQE.pdf The Quaternionic Exponential (and beyond)]
-*[@../../../quaternion/TQE_EA.pdf The Quaternionic Exponential (and beyond) ERRATA & ADDENDA]
+*[@/libs/math/quaternion/TQE.pdf The Quaternionic Exponential (and beyond)]
+*[@/libs/math/quaternion/TQE_EA.pdf The Quaternionic Exponential (and beyond) ERRATA & ADDENDA]
[endsect]
@@ -928,7 +928,7 @@
* Rewrite input operatore using Spirit (creates a dependency).
* Put in place an Expression Template mechanism (perhaps borrowing from uBlas).
* Use uBlas for the link with rotations (and move from the
-[@../../../quaternion/HSO3SO4.cpp example]
+[@/libs/math/quaternion/HSO3SO4.cpp example]
implementation to an efficient one).
[endsect]
Modified: branches/doc/libs/math/doc/sf_and_dist/common_overviews.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/common_overviews.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/common_overviews.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -148,7 +148,7 @@
shouldn't have this problem. If you need long
double support with this compiler, then comment out the define of
BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS at line 55 of
- [@../../../../../boost/math/tools/config.hpp boost/math/tools/config.hpp].
+ [@/boost/math/tools/config.hpp boost/math/tools/config.hpp].
We aim to keep our headers warning free with -Wall with this compiler.
However, The tests cases tend to generate a lot of
@@ -203,7 +203,7 @@
bjam mytoolset
where "mytoolset" is the name of the
-[@../../../../../tools/build/index.html Boost.Build] toolset used for your
+[@/tools/build/index.html Boost.Build] toolset used for your
compiler. The chances are that [*many of the accuracy tests will fail
at this stage] - don't panic - the default acceptable error tolerances
are quite tight, especially for long double types with an extended
Modified: branches/doc/libs/math/doc/sf_and_dist/concepts.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/concepts.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/concepts.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -2,13 +2,13 @@
The special functions and tools in this library can be used with
[@http://shoup.net/ntl/doc/RR.txt NTL::RR (an arbitrary precision number type)],
-via the bindings in [@../../../../../boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp].
+via the bindings in [@/boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp].
[@http://shoup.net/ntl/ See also NTL: A Library for doing Number Theory by
Victor Shoup]
Unfortunately `NTL::RR` doesn't quite satisfy our conceptual requirements,
so there is a very thin wrapper class `boost::math::ntl::RR` defined in
-[@../../../../../boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp] that you
+[@/boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp] that you
should use in place of `NTL::RR`. The class is intended to be a drop-in
replacement for the "real" NTL::RR that adds some syntactic sugar to keep
this library happy, plus some of the standard library functions not implemented
@@ -16,7 +16,7 @@
Finally there is a high precision __lanczos suitable for use with `boost::math::ntl::RR`,
used at 1000-bit precision in
-[@../../../tools/ntl_rr_lanczos.hpp libs/math/tools/ntl_rr_lanczos.hpp].
+[@/libs/math/tools/ntl_rr_lanczos.hpp libs/math/tools/ntl_rr_lanczos.hpp].
The approximation has a theoretical precision of > 90 decimal digits,
and an experimental precision of > 100 decimal digits. To use that
approximation, just include that header before any of the special
@@ -116,7 +116,7 @@
# The function `epsilon` can be synthesised from the others, so no
explicit specialisation is required provided the precision
of RealType does not vary at runtime (see the header
-[@../../../../../boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp]
+[@/boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp]
for an example where the precision does vary at runtime).
# The functions `digits`, `max_value` and `min_value`, all get synthesised
automatically from `std::numeric_limits`. However, if `numeric_limits`
@@ -124,7 +124,7 @@
when code tries to use these functions, /unless/ you explicitly specialise them.
For example if the precision of RealType varies at runtime, then
`numeric_limits` support may not be appropriate, see
-[@../../../../../boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp] for examples.
+[@/boost/math/bindings/rr.hpp boost/math/bindings/rr.hpp] for examples.
[warning
If `std::numeric_limits<>` is *not specialized*
@@ -195,14 +195,14 @@
In addition, for efficient and accurate results, a __lanczos is highly desirable.
You may be able to adapt an existing approximation from
-[@../../../../../boost/math/special_functions/lanczos.hpp
+[@/boost/math/special_functions/lanczos.hpp
boost/math/special_functions/lanczos.hpp] or
-[@../../../tools/ntl_rr_lanczos.hpp libs/math/tools/ntl_rr_lanczos.hpp]:
+[@/libs/math/tools/ntl_rr_lanczos.hpp libs/math/tools/ntl_rr_lanczos.hpp]:
you will need change
static_cast's to lexical_cast's, and the constants to /strings/
(in order to ensure the coefficients aren't truncated to long double)
and then specialise `lanczos_traits` for type T. Otherwise you may have to hack
-[@../../../tools/lanczos_generator.cpp
+[@/libs/math/tools/lanczos_generator.cpp
libs/math/tools/lanczos_generator.cpp] to find a suitable
approximation for your RealType. The code will still compile if you don't do
this, but both accuracy and efficiency will be greatly compromised in any
@@ -292,7 +292,7 @@
been brought into the current scope with a using declaration.
There is a test program
-[@../../../test/std_real_concept_check.cpp libs/math/test/std_real_concept_check.cpp]
+[@/libs/math/test/std_real_concept_check.cpp libs/math/test/std_real_concept_check.cpp]
that instantiates every template in this library with type
`std_real_concept` to verify it's usage of standard library functions.
@@ -343,11 +343,11 @@
[link math_toolkit.using_udt.dist_concept Distribution concept].
The class template `DistributionConcept` is a
-[@../../../../../libs/concept_check/index.html concept checking class]
+[@/libs/concept_check/index.html concept checking class]
for distribution types.
The test program
-[@../../../test/compile_test/distribution_concept_check.cpp distribution_concept_check.cpp]
+[@/libs/math/test/compile_test/distribution_concept_check.cpp distribution_concept_check.cpp]
is responsible for using `DistributionConcept` to verify that all the
distributions in this library conform to the
[link math_toolkit.using_udt.dist_concept Distribution concept].
Modified: branches/doc/libs/math/doc/sf_and_dist/distributions/binomial_example.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/distributions/binomial_example.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/distributions/binomial_example.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -7,7 +7,7 @@
[import ../../../example/binomial_coinflip_example.cpp]
[binomial_coinflip_example1]
-See [@../../../example/binomial_coinflip_example.cpp binomial_coinflip_example.cpp]
+See [@/libs/math/example/binomial_coinflip_example.cpp binomial_coinflip_example.cpp]
for full source code, the program output looks like this:
[binomial_coinflip_example_output]
@@ -21,7 +21,7 @@
[binomial_quiz_example2]
[discrete_quantile_real]
-See [@../../../example/binomial_quiz_example.cpp binomial_quiz_example.cpp]
+See [@/libs/math/example/binomial_quiz_example.cpp binomial_quiz_example.cpp]
for full source code and output.
[endsect] [/section:binomial_coinflip_quiz Binomial Coin-Flipping example]
@@ -39,7 +39,7 @@
`binomial_distribution<>::find_upper_bound_on_p` allow you to calculate
the confidence intervals for your estimate of the occurrence frequency.
-The sample program [@../../../example/binomial_confidence_limits.cpp
+The sample program [@/libs/math/example/binomial_confidence_limits.cpp
binomial_confidence_limits.cpp] illustrates their use. It begins by defining
a procedure that will print a table of confidence limits for various degrees
of certainty:
@@ -222,7 +222,7 @@
acceptable risk level /alpha/.
The example program
-[@../../../example/binomial_sample_sizes.cpp binomial_sample_sizes.cpp]
+[@/libs/math/example/binomial_sample_sizes.cpp binomial_sample_sizes.cpp]
demonstrates its usage. It centres on a routine that prints out
a table of maximum sample sizes for various probability thresholds:
Modified: branches/doc/libs/math/doc/sf_and_dist/distributions/chi_squared_examples.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/distributions/chi_squared_examples.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/distributions/chi_squared_examples.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -9,7 +9,7 @@
confidence intervals for the standard deviation.
The full example code & sample output is in
-[@../../../example/chi_square_std_dev_test.cpp chi_square_std_deviation_test.cpp].
+[@/libs/math/example/chi_square_std_dev_test.cpp chi_square_std_deviation_test.cpp].
We'll begin by defining the procedure that will calculate and print out the
confidence intervals:
@@ -178,7 +178,7 @@
process to an established one.
The code for this example is contained in
-[@../../../example/chi_square_std_dev_test.cpp chi_square_std_dev_test.cpp], and
+[@/libs/math/example/chi_square_std_dev_test.cpp chi_square_std_dev_test.cpp], and
we'll begin by defining the procedure that will print out the test
statistics:
@@ -372,7 +372,7 @@
note that the method used works on variance, and not standard deviation
as is usual for the Chi Squared Test.
-The code for this example is located in [@../../../example/chi_square_std_dev_test.cpp
+The code for this example is located in [@/libs/math/example/chi_square_std_dev_test.cpp
chi_square_std_dev_test.cpp].
We begin by defining a procedure to print out the sample sizes required
Modified: branches/doc/libs/math/doc/sf_and_dist/distributions/distribution_construction.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/distributions/distribution_construction.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/distributions/distribution_construction.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -1,6 +1,6 @@
[section:dist_construct_eg Distribution Construction Example]
-See [@../../../example/distribution_construction.cpp distribution_construction.cpp] for full source code.
+See [@/libs/math/example/distribution_construction.cpp distribution_construction.cpp] for full source code.
[import ../../../example/distribution_construction.cpp]
[distribution_construction1]
Modified: branches/doc/libs/math/doc/sf_and_dist/distributions/f_dist_example.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/distributions/f_dist_example.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/distributions/f_dist_example.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -13,7 +13,7 @@
NIST Ceramics Division in 1996 in connection with a NIST/industry
ceramics consortium for strength optimization of ceramic strength.
-The example program is [@../../../example/f_test.cpp f_test.cpp],
+The example program is [@/libs/math/example/f_test.cpp f_test.cpp],
program output has been deliberately made as similar as possible
to the DATAPLOT output in the corresponding
[@http://www.itl.nist.gov/div898/handbook/eda/section3/eda359.htm
Modified: branches/doc/libs/math/doc/sf_and_dist/distributions/find_location_and_scale.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/distributions/find_location_and_scale.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/distributions/find_location_and_scale.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -4,7 +4,7 @@
[import ../../../example/find_location_example.cpp]
[find_location1]
[find_location2]
-See [@../../../example/find_location_example.cpp find_location_example.cpp]
+See [@/libs/math/example/find_location_example.cpp find_location_example.cpp]
for full source code: the program output looks like this:
[find_location_example_output]
[endsect] [/section:find_location_eg Find Location (Mean) Example]
@@ -13,7 +13,7 @@
[import ../../../example/find_scale_example.cpp]
[find_scale1]
[find_scale2]
-See [@../../../example/find_scale_example.cpp find_scale_example.cpp]
+See [@/libs/math/example/find_scale_example.cpp find_scale_example.cpp]
for full source code: the program output looks like this:
[find_scale_example_output]
[endsect] [/section:find_scale_eg Scale (Standard Deviation) Example]
@@ -22,7 +22,7 @@
[import ../../../example/find_mean_and_sd_normal.cpp]
[normal_std]
[normal_find_location_and_scale_eg]
-See [@../../../example/find_mean_and_sd_normal.cpp find_mean_and_sd_normal.cpp]
+See [@/libs/math/example/find_mean_and_sd_normal.cpp find_mean_and_sd_normal.cpp]
for full source code & appended program output.
[endsect] [/find_mean_and_sd_eg Find mean and standard deviation example]
Modified: branches/doc/libs/math/doc/sf_and_dist/distributions/nag_library.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/distributions/nag_library.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/distributions/nag_library.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -47,7 +47,7 @@
`pdf(dist, k)` is equivalent to NAG library `peqk`, point probability of == k
-See [@../../../example/binomial_example_nag.cpp binomial_example_nag.cpp] for details.
+See [@/libs/math/example/binomial_example_nag.cpp binomial_example_nag.cpp] for details.
[endsect] [/section:nag_library Comparison with C, R, FORTRAN-style Free Functions]
Modified: branches/doc/libs/math/doc/sf_and_dist/distributions/negative_binomial_example.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/distributions/negative_binomial_example.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/distributions/negative_binomial_example.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -20,7 +20,7 @@
`negative_binomial_distribution<>::find_upper_bound_on_p`
allow you to calculate the confidence intervals for your estimate of the success fraction.
-The sample program [@../../../example/neg_binom_confidence_limits.cpp
+The sample program [@/libs/math/example/neg_binom_confidence_limits.cpp
neg_binom_confidence_limits.cpp] illustrates their use.
[import ../../../example/neg_binom_confidence_limits.cpp]
@@ -95,7 +95,7 @@
of observing the desired number of failures.
The example program
-[@../../../example/neg_binomial_sample_sizes.cpp neg_binomial_sample_sizes.cpp]
+[@/libs/math/example/neg_binomial_sample_sizes.cpp neg_binomial_sample_sizes.cpp]
demonstrates its usage.
[import ../../../example/neg_binomial_sample_sizes.cpp]
@@ -165,7 +165,7 @@
[section:negative_binomial_example1 Negative Binomial Sales Quota Example.]
This example program
-[@../../../example/negative_binomial_example1.cpp negative_binomial_example1.cpp (full source code)]
+[@/libs/math/example/negative_binomial_example1.cpp negative_binomial_example1.cpp (full source code)]
demonstrates a simple use to find the probability of meeting a sales quota.
[import ../../../example/negative_binomial_example1.cpp]
Modified: branches/doc/libs/math/doc/sf_and_dist/distributions/normal_example.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/distributions/normal_example.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/distributions/normal_example.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -4,7 +4,7 @@
[section:normal_misc Some Miscellaneous Examples of the Normal (Gaussian) Distribution]
-The sample program [@../../../example/normal_misc_examples.cpp
+The sample program [@/libs/math/example/normal_misc_examples.cpp
normal_misc_examples.cpp] illustrates their use.
[import ../../../example/normal_misc_examples.cpp]
Modified: branches/doc/libs/math/doc/sf_and_dist/distributions/students_t_examples.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/distributions/students_t_examples.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/distributions/students_t_examples.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -47,7 +47,7 @@
* The width increases as the ['significance level decreases] (0.5 towards 0.00000...01 - stronger).
The following example code is taken from the example program
-[@../../../example/students_t_single_sample.cpp students_t_single_sample.cpp].
+[@/libs/math/example/students_t_single_sample.cpp students_t_single_sample.cpp].
We'll begin by defining a procedure to calculate intervals for
various confidence levels; the procedure will print these out
@@ -202,7 +202,7 @@
often this is simply a "traditional" method of measurement.
The following example code is taken from the example program
-[@../../../example/students_t_single_sample.cpp students_t_single_sample.cpp].
+[@/libs/math/example/students_t_single_sample.cpp students_t_single_sample.cpp].
We'll begin by defining a procedure to determine which of the
possible hypothesis are rejected or not-rejected
@@ -407,7 +407,7 @@
can provide this information.
This section is based on the example code in
-[@../../../example/students_t_single_sample.cpp students_t_single_sample.cpp]
+[@/libs/math/example/students_t_single_sample.cpp students_t_single_sample.cpp]
and we begin by defining a procedure that will print out a table of
estimated sample sizes for various confidence levels:
@@ -536,7 +536,7 @@
miles per gallon of US cars with miles per gallon of Japanese cars.
The sample code is in
-[@../../../example/students_t_two_samples.cpp students_t_two_samples.cpp].
+[@/libs/math/example/students_t_two_samples.cpp students_t_two_samples.cpp].
There are two ways in which this test can be conducted: we can assume
that the true standard deviations of the two samples are equal or not.
Modified: branches/doc/libs/math/doc/sf_and_dist/distributions/triangular.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/distributions/triangular.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/distributions/triangular.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -134,12 +134,12 @@
x = b - sqrt((b-a)(b-c)q) ; for p > p0
-(See [@../../../../../boost/math/distributions/triangular.hpp /boost/math/distributions/triangular.hpp] for details.)]]
-[[quantile from the complement][As quantile (See [@../../../../../boost/math/distributions/triangular.hpp /boost/math/distributions/triangular.hpp] for details.)]]
+(See [@/boost/math/distributions/triangular.hpp /boost/math/distributions/triangular.hpp] for details.)]]
+[[quantile from the complement][As quantile (See [@/boost/math/distributions/triangular.hpp /boost/math/distributions/triangular.hpp] for details.)]]
[[mean][(a + b + 3) \/ 3 ]]
[[variance][(a[super 2]+b[super 2]+c[super 2] - ab - ac - bc)\/18]]
[[mode][c]]
-[[skewness][(See [@../../../../../boost/math/distributions/triangular.hpp /boost/math/distributions/triangular.hpp] for details). ]]
+[[skewness][(See [@/boost/math/distributions/triangular.hpp /boost/math/distributions/triangular.hpp] for details). ]]
[[kurtosis][12\/5]]
[[kurtosis excess][-3\/5]]
]
Modified: branches/doc/libs/math/doc/sf_and_dist/error_handling.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/error_handling.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/error_handling.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -1,6 +1,6 @@
[section:error_handling Error Handling]
-[def __format [@../../../../format/index.html Boost.Format]]
+[def __format [@/libs/format/index.html Boost.Format]]
[heading Quick Reference]
Modified: branches/doc/libs/math/doc/sf_and_dist/implementation.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/implementation.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/implementation.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -134,7 +134,7 @@
for a detailed explanation of the mechanism, and
[link math_toolkit.dist.stat_tut.weg.error_eg error_handling example]
and
-[@../../../example/error_handling_example.cpp error_handling_example.cpp]
+[@/libs/math/example/error_handling_example.cpp error_handling_example.cpp]
[caution If you enable throw but do NOT have try & catch block,
then the program will terminate with an uncaught exception and probably abort.
Modified: branches/doc/libs/math/doc/sf_and_dist/math.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/math.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/math.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -258,7 +258,7 @@
[template floorlr[x][lfloor][x][rfloor]]
[template ceil[x] '''⌈'''[x]'''⌉''']
-[template header_file[file] [@../../../../../[file] [file]]]
+[template header_file[file] [@/libs/math/../../[file] [file]]]
[template optional_policy[]
The final __Policy argument is optional and can be used to
Modified: branches/doc/libs/math/doc/sf_and_dist/policy.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/policy.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/policy.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -486,7 +486,7 @@
If you want to alter the defaults for any or all of
the policies for *all* functions and distributions, installation-wide,
then you can do so by defining various macros in
-[@../../../../../boost/math/tools/user.hpp boost/math/tools/user.hpp].
+[@/boost/math/tools/user.hpp boost/math/tools/user.hpp].
[h5 BOOST_MATH_DOMAIN_ERROR_POLICY]
Modified: branches/doc/libs/math/doc/sf_and_dist/policy_tutorial.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/policy_tutorial.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/policy_tutorial.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -149,7 +149,7 @@
That means there are only two safe ways to use these macros:
-* Edit them in [@../../../../../boost/math/tools/user.hpp boost/math/tools/user.hpp],
+* Edit them in [@/boost/math/tools/user.hpp boost/math/tools/user.hpp],
so that the defaults are set on an installation-wide basis.
Unfortunately this may not be convenient if
you are using a pre-installed Boost distribution (on Linux for example).
Modified: branches/doc/libs/math/doc/sf_and_dist/pow.qbk
==============================================================================
--- branches/doc/libs/math/doc/sf_and_dist/pow.qbk (original)
+++ branches/doc/libs/math/doc/sf_and_dist/pow.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -5,7 +5,7 @@
[h4 Synopsis]
-[@../../../../../boost/math/special_functions/pow.hpp `#include <boost/math/special_functions/pow.hpp>`]
+[@/boost/math/special_functions/pow.hpp `#include <boost/math/special_functions/pow.hpp>`]
namespace boost { namespace math {
Modified: branches/doc/libs/numeric/conversion/doc/conversion.qbk
==============================================================================
--- branches/doc/libs/numeric/conversion/doc/conversion.qbk (original)
+++ branches/doc/libs/numeric/conversion/doc/conversion.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -21,7 +21,7 @@
[/ Cited Boost resources ]
-[def __MPL_INTEGRAL_CONSTANT__ [@../../../../mpl/doc/refmanual/integral-constant.html MPL's Integral Constant] ]
+[def __MPL_INTEGRAL_CONSTANT__ [@/libs/mpl/doc/refmanual/integral-constant.html MPL's Integral Constant] ]
Modified: branches/doc/libs/optional/doc/optional.qbk
==============================================================================
--- branches/doc/libs/optional/doc/optional.qbk (original)
+++ branches/doc/libs/optional/doc/optional.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -21,16 +21,16 @@
[/ Cited Boost resources ]
-[def __BOOST_VARIANT__ [@../../../variant/index.html Boost.Variant]]
-[def __BOOST_TRIBOOL__ [@../../../../doc/html/tribool.html boost::tribool]]
+[def __BOOST_VARIANT__ [@/libs/variant/index.html Boost.Variant]]
+[def __BOOST_TRIBOOL__ [@/doc/html/tribool.html boost::tribool]]
-[def __OPTIONAL_POINTEE__ [@../../../utility/OptionalPointee.html OptionalPointee]]
-[def __COPY_CONSTRUCTIBLE__ [@../../../utility/CopyConstructible.html Copy Constructible]]
-[def __FUNCTION_EQUAL_POINTEES__ [@../../../utility/OptionalPointee.html#equal `equal_pointees()`]]
-[def __FUNCTION_LESS_POINTEES__ [@../../../utility/OptionalPointee.html#less `less_pointees()`]]
+[def __OPTIONAL_POINTEE__ [@/libs/utility/OptionalPointee.html OptionalPointee]]
+[def __COPY_CONSTRUCTIBLE__ [@/libs/utility/CopyConstructible.html Copy Constructible]]
+[def __FUNCTION_EQUAL_POINTEES__ [@/libs/utility/OptionalPointee.html#equal `equal_pointees()`]]
+[def __FUNCTION_LESS_POINTEES__ [@/libs/utility/OptionalPointee.html#less `less_pointees()`]]
-[def __IN_PLACE_FACTORY_HPP__ [@../../../../boost/utility/in_place_factory.hpp in_place_factory.hpp]]
-[def __TYPED_IN_PLACE_FACTORY_HPP__ [@../../../../boost/utility/typed_in_place_factory.hpp typed_in_place_factory.hpp]]
+[def __IN_PLACE_FACTORY_HPP__ [@/boost/utility/in_place_factory.hpp in_place_factory.hpp]]
+[def __TYPED_IN_PLACE_FACTORY_HPP__ [@/boost/utility/typed_in_place_factory.hpp typed_in_place_factory.hpp]]
[/ Other web resources ]
Modified: branches/doc/libs/python/doc/tutorial/doc/tutorial.qbk
==============================================================================
--- branches/doc/libs/python/doc/tutorial/doc/tutorial.qbk (original)
+++ branches/doc/libs/python/doc/tutorial/doc/tutorial.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -93,7 +93,7 @@
We will skip over the details. Our objective will be to simply create
the hello world module and run it in Python. For a complete reference to
-building Boost.Python, check out: [@../../../building.html
+building Boost.Python, check out: [@/libs/python/doc/building.html
building.html]. After this brief ['bjam] tutorial, we should have built
the DLLs and run a python program using the extension.
@@ -118,7 +118,7 @@
[h2 Let's Jam!]
__jam__
-[@../../../../example/tutorial/Jamroot Here] is our minimalist Jamroot
+[@/libs/python/example/tutorial/Jamroot Here] is our minimalist Jamroot
file. Simply copy the file and tweak [^use-project boost] to where your
boost root directory is and your OK.
@@ -463,7 +463,7 @@
};
Notice too that in addition to inheriting from `Base`, we also multiply-
-inherited `wrapper<Base>` (See [@../../../v2/wrapper.html Wrapper]). The
+inherited `wrapper<Base>` (See [@/libs/python/doc/v2/wrapper.html Wrapper]). The
`wrapper` template makes the job of wrapping classes that are meant to
overridden in Python, easier.
@@ -495,7 +495,7 @@
[section Virtual Functions with Default Implementations]
We've seen in the previous section how classes with pure virtual functions are
-wrapped using Boost.Python's [@../../../v2/wrapper.html class wrapper]
+wrapped using Boost.Python's [@/libs/python/doc/v2/wrapper.html class wrapper]
facilities. If we wish to wrap [*non]-pure-virtual functions instead, the
mechanism is a bit different.
@@ -812,7 +812,7 @@
policy3<args...> > >
Here is the list of predefined call policies. A complete reference detailing
-these can be found [@../../../v2/reference.html#models_of_call_policies here].
+these can be found [@/libs/python/doc/v2/reference.html#models_of_call_policies here].
* [*with_custodian_and_ward]: Ties lifetimes of the arguments
* [*with_custodian_and_ward_postcall]: Ties lifetimes of the arguments and results
@@ -970,7 +970,7 @@
.def("wack_em", &george::wack_em, george_overloads());
-See the [@../../../v2/overloads.html#BOOST_PYTHON_FUNCTION_OVERLOADS-spec overloads reference]
+See the [@/libs/python/doc/v2/overloads.html#BOOST_PYTHON_FUNCTION_OVERLOADS-spec overloads reference]
for details.
[h2 init and optional]
@@ -1267,7 +1267,7 @@
The scope is a class that has an associated global Python object which
controls the Python namespace in which new extension classes and wrapped
functions will be defined as attributes. Details can be found
-[@../../../v2/scope.html here].]
+[@/libs/python/doc/v2/scope.html here].]
You can access those values in Python as
@@ -1328,7 +1328,7 @@
variants are called [^boost_python.lib] (for release builds) and
[^boost_python_debug.lib] (for debugging). If you can't find the libraries,
you probably haven't built Boost.Python yet. See
-[@../../../building.html Building and Testing] on how to do this.
+[@/libs/python/doc/building.html Building and Testing] on how to do this.
Python's library can be found in the [^/libs] subdirectory of
your Python directory. On Windows it is called pythonXY.lib where X.Y is
@@ -1386,8 +1386,8 @@
automatic in Python, the Python\/C API requires you to do it
[@http://www.python.org/doc/current/api/refcounts.html by hand]. This is
messy and especially hard to get right in the presence of C++ exceptions.
-Fortunately Boost.Python provides the [@../../../v2/handle.html handle] and
-[@../../../v2/object.html object] class templates to automate the process.
+Fortunately Boost.Python provides the [@/libs/python/doc/v2/handle.html handle] and
+[@/libs/python/doc/v2/object.html object] class templates to automate the process.
[h2 Running Python code]
@@ -1450,7 +1450,7 @@
[h2 Exception handling]
If an exception occurs in the evaluation of the python expression,
-[@../../../v2/errors.html#error_already_set-spec error_already_set] is thrown:
+[@/libs/python/doc/v2/errors.html#error_already_set-spec error_already_set] is thrown:
try
{
@@ -1954,13 +1954,13 @@
exporting it to Python at the same time: changes in a class will only demand
the compilation of a single cpp, instead of the entire wrapper code.
-[note If you're exporting your classes with [@../../../../pyste/index.html Pyste],
+[note If you're exporting your classes with [@/libs/python/doc/pyste/index.html Pyste],
take a look at the [^--multiple] option, that generates the wrappers in
various files as demonstrated here.]
[note This method is useful too if you are getting the error message
['"fatal error C1204:Compiler limit:internal structure overflow"] when compiling
-a large source file, as explained in the [@../../../v2/faq.html#c1204 FAQ].]
+a large source file, as explained in the [@/libs/python/doc/v2/faq.html#c1204 FAQ].]
[endsect]
[endsect] [/ General Techniques]
Modified: branches/doc/libs/range/doc/boost_range.qbk
==============================================================================
Binary files. No diff available.
Modified: branches/doc/libs/regex/doc/configuration.qbk
==============================================================================
--- branches/doc/libs/regex/doc/configuration.qbk (original)
+++ branches/doc/libs/regex/doc/configuration.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -11,15 +11,15 @@
[section:compiler Compiler Setup]
You shouldn't need to do anything special to configure Boost.Regex for use
-with your compiler - the [@../../../config/index.html Boost.Config subsystem] should already take care of it,
+with your compiler - the [@/libs/config/index.html Boost.Config subsystem] should already take care of it,
if you do have problems (or you are using a particularly obscure compiler
-or platform) then [@../../../config/index.html Boost.Config] has a configure script that you can run.
+or platform) then [@/libs/config/index.html Boost.Config] has a configure script that you can run.
[endsect]
[section:locale Locale and traits class selection]
-The following macros (see [@../../../../boost/regex/user.hpp user.hpp]) control how Boost.Regex interacts with
+The following macros (see [@/boost/regex/user.hpp user.hpp]) control how Boost.Regex interacts with
the user's locale:
[table
Modified: branches/doc/libs/regex/doc/examples.qbk
==============================================================================
--- branches/doc/libs/regex/doc/examples.qbk (original)
+++ branches/doc/libs/regex/doc/examples.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -18,7 +18,7 @@
are concerned - if anyone spots anything that isn't being tested I'd be
glad to hear about it.
-Directory: [@../../test/regress libs/regex/test/regress].
+Directory: [@/libs/regex/test/regress libs/regex/test/regress].
Files: See directory.
@@ -27,33 +27,33 @@
Verifies that "bad" regular expressions don't cause the matcher to go into
infinite loops, but to throw an exception instead.
-Directory: [@../../test/pathology libs/regex/test/pathology].
+Directory: [@/libs/regex/test/pathology libs/regex/test/pathology].
-Files: [@../../test/pathology/bad_expression_test.cpp bad_expression_test.cpp].
+Files: [@/libs/regex/test/pathology/bad_expression_test.cpp bad_expression_test.cpp].
[*recursion_test:]
Verifies that the matcher can't overrun the stack (no matter what the expression).
-Directory: [@../../test/pathology libs/regex/test/pathology].
+Directory: [@/libs/regex/test/pathology libs/regex/test/pathology].
-Files: [@../../test/pathology/recursion_test.cpp recursion_test.cpp].
+Files: [@/libs/regex/test/pathology/recursion_test.cpp recursion_test.cpp].
[*concepts:]
Verifies that the library meets all documented concepts (a compile only test).
-Directory: [@../../test/concepts libs/regex/test/concepts].
+Directory: [@/libs/regex/test/concepts libs/regex/test/concepts].
-Files: [@../../test/concepts/concept_check.cpp concept_check.cpp].
+Files: [@/libs/regex/test/concepts/concept_check.cpp concept_check.cpp].
[*captures_test:]
Test code for captures.
-Directory: [@../../test/captures libs/test/captures].
+Directory: [@/libs/regex/test/captures libs/test/captures].
-Files: [@../../test/captures/captures_test.cpp captures_test.cpp].
+Files: [@/libs/regex/test/captures/captures_test.cpp captures_test.cpp].
[h4 Example programs]
@@ -61,7 +61,7 @@
A simple grep implementation, run with the -h command line option to find out its usage.
-Files: [@../../example/grep/grep.cpp grep.cpp]
+Files: [@/libs/regex/example/grep/grep.cpp grep.cpp]
[*timer.exe]
@@ -69,47 +69,47 @@
matches are timed, allowing the programmer to optimize their regular expressions
where performance is critical.
-Files: [@../../example/timer/regex_timer.cpp regex_timer.cpp].
+Files: [@/libs/regex/example/timer/regex_timer.cpp regex_timer.cpp].
[h4 Code snippets]
The snippets examples contain the code examples used in the documentation:
-[@../../example/snippets/captures_example.cpp captures_example.cpp]: Demonstrates the use of captures.
+[@/libs/regex/example/snippets/captures_example.cpp captures_example.cpp]: Demonstrates the use of captures.
-[@../../example/snippets/credit_card_example.cpp credit_card_example.cpp]: Credit card number formatting code.
+[@/libs/regex/example/snippets/credit_card_example.cpp credit_card_example.cpp]: Credit card number formatting code.
-[@../../example/snippets/partial_regex_grep.cpp partial_regex_grep.cpp]: Search example using partial matches.
+[@/libs/regex/example/snippets/partial_regex_grep.cpp partial_regex_grep.cpp]: Search example using partial matches.
-[@../../example/snippets/partial_regex_match.cpp partial_regex_match.cpp]: regex_match example using partial matches.
+[@/libs/regex/example/snippets/partial_regex_match.cpp partial_regex_match.cpp]: regex_match example using partial matches.
-[@../../example/snippets/regex_iterator_example.cpp regex_iterator_example.cpp]: Iterating through a series of matches.
+[@/libs/regex/example/snippets/regex_iterator_example.cpp regex_iterator_example.cpp]: Iterating through a series of matches.
-[@../../example/snippets/regex_match_example.cpp regex_match_example.cpp]: ftp based regex_match example.
+[@/libs/regex/example/snippets/regex_match_example.cpp regex_match_example.cpp]: ftp based regex_match example.
-[@../../example/snippets/regex_merge_example.cpp regex_merge_example.cpp]: regex_merge example: converts a C++ file to syntax highlighted HTML.
+[@/libs/regex/example/snippets/regex_merge_example.cpp regex_merge_example.cpp]: regex_merge example: converts a C++ file to syntax highlighted HTML.
-[@../../example/snippets/regex_replace_example.cpp regex_replace_example.cpp]: regex_replace example: converts a C++ file to syntax highlighted HTML
+[@/libs/regex/example/snippets/regex_replace_example.cpp regex_replace_example.cpp]: regex_replace example: converts a C++ file to syntax highlighted HTML
-[@../../example/snippets/regex_search_example.cpp regex_search_example.cpp]: regex_search example: searches a cpp file for class definitions.
+[@/libs/regex/example/snippets/regex_search_example.cpp regex_search_example.cpp]: regex_search example: searches a cpp file for class definitions.
-[@../../example/snippets/regex_token_iterator_eg_1.cpp regex_token_iterator_eg_1.cpp]: split a string into a series of tokens.
+[@/libs/regex/example/snippets/regex_token_iterator_eg_1.cpp regex_token_iterator_eg_1.cpp]: split a string into a series of tokens.
-[@../../example/snippets/regex_token_iterator_eg_2.cpp regex_token_iterator_eg_2.cpp]: enumerate the linked URL's in a HTML file.
+[@/libs/regex/example/snippets/regex_token_iterator_eg_2.cpp regex_token_iterator_eg_2.cpp]: enumerate the linked URL's in a HTML file.
The following are deprecated:
-[@../../example/snippets/regex_grep_example_1.cpp regex_grep_example_1.cpp]: regex_grep example 1: searches a cpp file for class definitions.
+[@/libs/regex/example/snippets/regex_grep_example_1.cpp regex_grep_example_1.cpp]: regex_grep example 1: searches a cpp file for class definitions.
-[@../../example/snippets/regex_grep_example_2.cpp regex_grep_example_2.cpp]: regex_grep example 2: searches a cpp file for class definitions, using a global callback function.
+[@/libs/regex/example/snippets/regex_grep_example_2.cpp regex_grep_example_2.cpp]: regex_grep example 2: searches a cpp file for class definitions, using a global callback function.
-[@../../example/snippets/regex_grep_example_3.cpp regex_grep_example_3.cpp]: regex_grep example 2: searches a cpp file for class definitions, using a bound member function callback.
+[@/libs/regex/example/snippets/regex_grep_example_3.cpp regex_grep_example_3.cpp]: regex_grep example 2: searches a cpp file for class definitions, using a bound member function callback.
-[@../../example/snippets/regex_grep_example_4.cpp regex_grep_example_4.cpp]: regex_grep example 2: searches a cpp file for class definitions, using a C++ Builder closure as a callback.
+[@/libs/regex/example/snippets/regex_grep_example_4.cpp regex_grep_example_4.cpp]: regex_grep example 2: searches a cpp file for class definitions, using a C++ Builder closure as a callback.
-[@../../example/snippets/regex_split_example_1.cpp regex_split_example_1.cpp]: regex_split example: split a string into tokens.
+[@/libs/regex/example/snippets/regex_split_example_1.cpp regex_split_example_1.cpp]: regex_split example: split a string into tokens.
-[@../../example/snippets/regex_split_example_2.cpp regex_split_example_2.cpp] : regex_split example: spit out linked URL's.
+[@/libs/regex/example/snippets/regex_split_example_2.cpp regex_split_example_2.cpp] : regex_split example: spit out linked URL's.
[endsect]
Modified: branches/doc/libs/regex/doc/install.qbk
==============================================================================
--- branches/doc/libs/regex/doc/install.qbk (original)
+++ branches/doc/libs/regex/doc/install.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -16,7 +16,7 @@
libraries\/platforms are already supported "as is". If you do experience configuration
problems, or just want to test the configuration with your compiler, then the
process is the same as for all of boost; see the
-[@../../../config/index.html configuration library documentation].
+[@/libs/config/index.html configuration library documentation].
The library will encase all code inside namespace boost.
@@ -30,7 +30,7 @@
This is now the preferred method for building and installing this library,
please refer to the
-[@../../../../more/getting_started.html getting started guide] for more information.
+[@/more/getting_started.html getting started guide] for more information.
[h4 Building With Unicode and ICU Support]
@@ -211,7 +211,7 @@
LIBS: additional library files.
For the more adventurous there is a configure script in `<boost>/libs/config`; see
-the [@../../../config/index.html config library documentation].
+the [@/libs/config/index.html config library documentation].
[h5 Sun Workshop 6.1]
Modified: branches/doc/libs/regex/doc/performance.qbk
==============================================================================
--- branches/doc/libs/regex/doc/performance.qbk (original)
+++ branches/doc/libs/regex/doc/performance.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -14,8 +14,8 @@
Boost.Regex with various other regular expression libraries for the
following compilers:
-* [@../vc71-performance.html Visual Studio.Net 2003 (recursive Boost.Regex implementation)].
-* [@../gcc-performance.html Gcc 3.2 (cygwin) (non-recursive Boost.Regex implementation)].
+* [@/libs/regex/doc/vc71-performance.html Visual Studio.Net 2003 (recursive Boost.Regex implementation)].
+* [@/libs/regex/doc/gcc-performance.html Gcc 3.2 (cygwin) (non-recursive Boost.Regex implementation)].
[endsect]
Modified: branches/doc/libs/regex/doc/redistributables.qbk
==============================================================================
--- branches/doc/libs/regex/doc/redistributables.qbk (original)
+++ branches/doc/libs/regex/doc/redistributables.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -18,7 +18,7 @@
you will also link to a static version of Boost.Regex and no dll's will
need to be distributed. The possible Boost.Regex dll and library names are
computed according to the formula given in
-[@../../../../more/getting_started.html the getting started guide].
+[@/more/getting_started.html the getting started guide].
Note: you can disable automatic library selection by defining the
symbol BOOST_REGEX_NO_LIB when compiling, this is useful if you want to
Modified: branches/doc/libs/regex/doc/regex_traits.qbk
==============================================================================
--- branches/doc/libs/regex/doc/regex_traits.qbk (original)
+++ branches/doc/libs/regex/doc/regex_traits.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -38,7 +38,7 @@
The default behavior can be altered by defining one of the following
configuration macros in
-[@../../../../boost/regex/user.hpp boost/regex/user.hpp]
+[@/boost/regex/user.hpp boost/regex/user.hpp]
* BOOST_REGEX_USE_C_LOCALE: makes `c_regex_traits` the default.
* BOOST_REGEX_USE_CPP_LOCALE: makes `cpp_regex_traits` the default.
Modified: branches/doc/libs/spirit/doc/lex/lexer_quickstart1.qbk
==============================================================================
--- branches/doc/libs/spirit/doc/lex/lexer_quickstart1.qbk (original)
+++ branches/doc/libs/spirit/doc/lex/lexer_quickstart1.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -15,7 +15,7 @@
The first quick start example describes a standalone application:
counting characters, words and lines in a file, very similar to what the well
known Unix command `wc` is doing (for the full example code see here:
-[@../../example/lex/word_count_functor.cpp word_count_functor.cpp]).
+[@/libs/spirit/example/lex/word_count_functor.cpp word_count_functor.cpp]).
[import ../example/lex/word_count_functor.cpp]
Modified: branches/doc/libs/spirit/doc/lex/lexer_quickstart2.qbk
==============================================================================
--- branches/doc/libs/spirit/doc/lex/lexer_quickstart2.qbk (original)
+++ branches/doc/libs/spirit/doc/lex/lexer_quickstart2.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -16,7 +16,7 @@
show how to use semantic actions in __lex__. Even if it still
will allow to count text elements only it introduces other new concepts and
configuration options along the lines (for the full example code
-see here: [@../../example/lex/word_count_lexer.cpp word_count_lexer.cpp]).
+see here: [@/libs/spirit/example/lex/word_count_lexer.cpp word_count_lexer.cpp]).
[import ../example/lex/word_count_lexer.cpp]
Modified: branches/doc/libs/spirit/doc/lex/lexer_quickstart3.qbk
==============================================================================
--- branches/doc/libs/spirit/doc/lex/lexer_quickstart3.qbk (original)
+++ branches/doc/libs/spirit/doc/lex/lexer_quickstart3.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -31,7 +31,7 @@
has been matched by the lexer. This quick start example will demonstrate this
(and more) by counting words again, simply by adding up the numbers inside
of semantic actions of a parser (for the full example code see here:
-[@../../example/lex/word_count.cpp word_count.cpp]).
+[@/libs/spirit/example/lex/word_count.cpp word_count.cpp]).
[import ../example/lex/word_count.cpp]
Modified: branches/doc/libs/spirit/doc/lex/lexer_static_model.qbk
==============================================================================
--- branches/doc/libs/spirit/doc/lex/lexer_static_model.qbk (original)
+++ branches/doc/libs/spirit/doc/lex/lexer_static_model.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -32,10 +32,10 @@
Both steps are described in more detail in the two sections below (for the full
source code used in this example see the code here:
-[@../../example/lex/static_lexer/word_count_tokens.hpp the common token definition],
-[@../../example/lex/static_lexer/word_count_generate.cpp the code generator],
-[@../../example/lex/static_lexer/word_count_static.hpp the generated code], and
-[@../../example/lex/static_lexer/word_count_static.cpp the static lexical analyzer]).
+[@/libs/spirit/example/lex/static_lexer/word_count_tokens.hpp the common token definition],
+[@/libs/spirit/example/lex/static_lexer/word_count_generate.cpp the code generator],
+[@/libs/spirit/example/lex/static_lexer/word_count_static.hpp the generated code], and
+[@/libs/spirit/example/lex/static_lexer/word_count_static.cpp the static lexical analyzer]).
[import ../example/lex/static_lexer/word_count_tokens.hpp]
[import ../example/lex/static_lexer/word_count_static.cpp]
@@ -90,7 +90,7 @@
The shown code generator will generate output, which should be stored in a file
for later inclusion into the static lexical analzyer as shown in the next
topic (the full generated code can be viewed
-[@../../example/lex/static_lexer/word_count_static.hpp here]).
+[@/libs/spirit/example/lex/static_lexer/word_count_static.hpp here]).
[heading Modifying the Dynamic Analyzer]
Modified: branches/doc/libs/spirit/doc/lex/tokens_values.qbk
==============================================================================
--- branches/doc/libs/spirit/doc/lex/tokens_values.qbk (original)
+++ branches/doc/libs/spirit/doc/lex/tokens_values.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -171,7 +171,7 @@
Let's start with some examples. We refer to one of the __lex__ examples (for
the full source code of this example please see
-[@../../example/lex/example4.cpp example4.cpp]).
+[@/libs/spirit/example/lex/example4.cpp example4.cpp]).
[import ../example/lex/example4.cpp]
Modified: branches/doc/libs/spirit/phoenix/doc/users_manual.qbk
==============================================================================
--- branches/doc/libs/spirit/phoenix/doc/users_manual.qbk (original)
+++ branches/doc/libs/spirit/phoenix/doc/users_manual.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -182,7 +182,7 @@
cout << val(3)() << endl;
-(See [@../../example/users_manual/values.cpp values.cpp])
+(See [@/libs/spirit/phoenix/example/users_manual/values.cpp values.cpp])
[blurb __tip__ Learn more about values [link phoenix.primitives.values here.]]
@@ -215,7 +215,7 @@
return 0;
}
-(See [@../../example/users_manual/callback.cpp callback.cpp])
+(See [@/libs/spirit/phoenix/example/users_manual/callback.cpp callback.cpp])
[endsect]
[section References]
@@ -234,7 +234,7 @@
Like `val`, the expressions above evaluates to a nullary function; the first one
returning an `int&`, and the second one returning a `char const*&`.
-(See [@../../example/users_manual/references.cpp references.cpp])
+(See [@/libs/spirit/phoenix/example/users_manual/references.cpp references.cpp])
[blurb __tip__ Learn more about references [link phoenix.primitives.references here.]]
@@ -260,7 +260,7 @@
cout << arg1(i) << endl; // prints 3
cout << arg2(i, s) << endl; // prints "Hello World"
-(See [@../../example/users_manual/arguments.cpp arguments.cpp])
+(See [@/libs/spirit/phoenix/example/users_manual/arguments.cpp arguments.cpp])
[blurb __tip__ Learn more about arguments [link phoenix.primitives.arguments here.]]
@@ -340,7 +340,7 @@
with any container (of ints, of longs, of bignum, etc.) as long as its elements
can handle the `arg1 % 2 == 1` expression.
-(See [@../../example/users_manual/find_if.cpp find_if.cpp])
+(See [@/libs/spirit/phoenix/example/users_manual/find_if.cpp find_if.cpp])
[blurb __tip__ ...[*That's it, we're done]. Well if you wish to know a little bit
more, read on...]
@@ -364,7 +364,7 @@
]
);
-(See [@../../example/users_manual/if.cpp if.cpp])
+(See [@/libs/spirit/phoenix/example/users_manual/if.cpp if.cpp])
[blurb __tip__ Learn more about statements [link phoenix.composite.statement here.]]
@@ -428,7 +428,7 @@
find_if(c.begin(), c.end(), is_odd(arg1));
-(See [@../../example/users_manual/function.cpp function.cpp])
+(See [@/libs/spirit/phoenix/example/users_manual/function.cpp function.cpp])
[h2 Predefined Lazy Functions]
@@ -980,7 +980,7 @@
}
};
-(See [@../../example/users_manual/factorial.cpp factorial.cpp])
+(See [@/libs/spirit/phoenix/example/users_manual/factorial.cpp factorial.cpp])
Having implemented the `factorial_impl` type, we can declare and instantiate a lazy
`factorial` function this way:
@@ -1174,7 +1174,7 @@
functions and lazy-operators. How about lazy-statements? First, an appetizer:
Print all odd-numbered contents of an STL container using `std::for_each`
-([@../../example/users_manual/all_odds.cpp all_odds.cpp]):
+([@/libs/spirit/phoenix/example/users_manual/all_odds.cpp all_odds.cpp]):
for_each(c.begin(), c.end(),
if_(arg1 % 2 == 1)
@@ -1872,7 +1872,7 @@
argument: `arg2`. Hence: _a = arg2. This local variable is visible inside the
lambda scope.
-(See [@../../example/users_manual/lambda.cpp lambda.cpp])
+(See [@/libs/spirit/phoenix/example/users_manual/lambda.cpp lambda.cpp])
[endsect]
Modified: branches/doc/libs/static_assert/doc/static_assert.qbk
==============================================================================
--- branches/doc/libs/static_assert/doc/static_assert.qbk (original)
+++ branches/doc/libs/static_assert/doc/static_assert.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -209,19 +209,19 @@
[table Test programs provided with static_assert
[[Test Program][Expected to Compile][Description]]
-[[[@../../libs/static_assert/static_assert_test.cpp static_assert_test.cpp]] [Yes] [Illustrates usage, and should always compile, really just tests compiler compatibility.]]
-[[[@../../libs/static_assert/static_assert_example_1.cpp static_assert_example_1.cpp]] [Platform dependent.] [Namespace scope test program, may compile depending upon the platform. ]]
-[[[@../../libs/static_assert/static_assert_example_2.cpp static_assert_example_2.cpp]] [Yes] [Function scope test program. ]]
-[[[@../../libs/static_assert/static_assert_example_3.cpp static_assert_example_3.cpp]] [Yes] [Class scope test program. ]]
-[[[@../../libs/static_assert/static_assert_test_fail_1.cpp static_assert_test_fail_1.cpp]] [No] [Illustrates failure at namespace scope. ]]
-[[[@../../libs/static_assert/static_assert_test_fail_2.cpp static_assert_test_fail_2.cpp]] [No] [Illustrates failure at non-template function scope. ]]
-[[[@../../libs/static_assert/static_assert_test_fail_3.cpp static_assert_test_fail_3.cpp]] [No] [Illustrates failure at non-template class scope. ]]
-[[[@../../libs/static_assert/static_assert_test_fail_4.cpp static_assert_test_fail_4.cpp]] [No] [Illustrates failure at non-template class scope. ]]
-[[[@../../libs/static_assert/static_assert_test_fail_5.cpp static_assert_test_fail_5.cpp]] [No] [Illustrates failure at template class scope. ]]
-[[[@../../libs/static_assert/static_assert_test_fail_6.cpp static_assert_test_fail_6.cpp]] [No] [Illustrates failure at template class member function scope. ]]
-[[[@../../libs/static_assert/static_assert_test_fail_7.cpp static_assert_test_fail_7.cpp]] [No] [Illustrates failure of class scope example. ]]
-[[[@../../libs/static_assert/static_assert_test_fail_8.cpp static_assert_test_fail_8.cpp]] [No] [Illustrates failure of function scope example. ]]
-[[[@../../libs/static_assert/static_assert_test_fail_9.cpp static_assert_test_fail_9.cpp]] [No] [Illustrates failure of function scope example (part 2). ]]
+[[[@/libs/static_assert/static_assert_test.cpp static_assert_test.cpp]] [Yes] [Illustrates usage, and should always compile, really just tests compiler compatibility.]]
+[[[@/libs/static_assert/static_assert_example_1.cpp static_assert_example_1.cpp]] [Platform dependent.] [Namespace scope test program, may compile depending upon the platform. ]]
+[[[@/libs/static_assert/static_assert_example_2.cpp static_assert_example_2.cpp]] [Yes] [Function scope test program. ]]
+[[[@/libs/static_assert/static_assert_example_3.cpp static_assert_example_3.cpp]] [Yes] [Class scope test program. ]]
+[[[@/libs/static_assert/static_assert_test_fail_1.cpp static_assert_test_fail_1.cpp]] [No] [Illustrates failure at namespace scope. ]]
+[[[@/libs/static_assert/static_assert_test_fail_2.cpp static_assert_test_fail_2.cpp]] [No] [Illustrates failure at non-template function scope. ]]
+[[[@/libs/static_assert/static_assert_test_fail_3.cpp static_assert_test_fail_3.cpp]] [No] [Illustrates failure at non-template class scope. ]]
+[[[@/libs/static_assert/static_assert_test_fail_4.cpp static_assert_test_fail_4.cpp]] [No] [Illustrates failure at non-template class scope. ]]
+[[[@/libs/static_assert/static_assert_test_fail_5.cpp static_assert_test_fail_5.cpp]] [No] [Illustrates failure at template class scope. ]]
+[[[@/libs/static_assert/static_assert_test_fail_6.cpp static_assert_test_fail_6.cpp]] [No] [Illustrates failure at template class member function scope. ]]
+[[[@/libs/static_assert/static_assert_test_fail_7.cpp static_assert_test_fail_7.cpp]] [No] [Illustrates failure of class scope example. ]]
+[[[@/libs/static_assert/static_assert_test_fail_8.cpp static_assert_test_fail_8.cpp]] [No] [Illustrates failure of function scope example. ]]
+[[[@/libs/static_assert/static_assert_test_fail_9.cpp static_assert_test_fail_9.cpp]] [No] [Illustrates failure of function scope example (part 2). ]]
]
Modified: branches/doc/libs/tr1/doc/tr1.qbk
==============================================================================
--- branches/doc/libs/tr1/doc/tr1.qbk (original)
+++ branches/doc/libs/tr1/doc/tr1.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -144,7 +144,7 @@
it is more than usually sensitive to an incorrect configuration.
The intention is that
-[@../../libs/config/index.html Boost.Config]
+[@/libs/config/index.html Boost.Config]
will automatically define the configuration
macros used by this library, so that if your standard library is set up to
support TR1 (note that few are at present) then this will be detected and Boost.TR1
@@ -164,7 +164,7 @@
The configuration macros used by each TR1 component are documented in each
library section (and all together in the
-[@../../libs/config/index.html Boost.Config]
+[@/libs/config/index.html Boost.Config]
documentation), but defining BOOST_HAS_TR1 will turn on native TR1 support
for everything (if your standard library has it), which can act as a
convenient shortcut.
@@ -193,7 +193,7 @@
and the two functions
`ref` and `cref` that return
instances of `reference_wrapper<T>`.
-[@../../doc/html/ref.html Refer to Boost.Bind for more information.]
+[@/doc/html/ref.html Refer to Boost.Bind for more information.]
namespace std {
namespace tr1 {
@@ -209,7 +209,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_REFERENCE_WRAPPER if your
standard library implements this part of TR1.
@@ -234,8 +234,8 @@
object, typically with a C++ new-expression. The object pointed to is
guaranteed to be deleted when the last `shared_ptr` pointing to it is
destroyed or reset. For more information refer to the
-[@../../libs/smart_ptr/shared_ptr.htm shared_ptr]
-and [@../../libs/smart_ptr/weak_ptr.htm weak_ptr] documentation.
+[@/libs/smart_ptr/shared_ptr.htm shared_ptr]
+and [@/libs/smart_ptr/weak_ptr.htm weak_ptr] documentation.
namespace std {
namespace tr1 {
@@ -281,7 +281,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_SHARED_PTR if your
standard library implements this part of TR1.
@@ -309,7 +309,7 @@
the type `F` to be a function pointer,
function reference, member function pointer, or class
type. For more information
-[@../../libs/utility/utility.htm#result_of refer to the Boost.Utility documentation.]
+[@/libs/utility/utility.htm#result_of refer to the Boost.Utility documentation.]
namespace std {
namespace tr1 {
@@ -324,7 +324,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_RESULT_OF if your
standard library implements this part of TR1.
@@ -346,7 +346,7 @@
reference, or a smart pointer to an object instance as its first argument. `mem_fn`
also supports pointers to data members by treating them as functions taking no
arguments and returning a (const) reference to the member.
-For more information refer to the [@../../libs/bind/mem_fn.html
+For more information refer to the [@/libs/bind/mem_fn.html
Boost.Mem_fn documentation].
namespace std {
@@ -358,7 +358,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_MEM_FN if your
standard library implements this part of TR1.
@@ -385,7 +385,7 @@
does not place any requirements on the function object; in particular, it does
not need the `result_type`, `first_argument_type` and `second_argument_type`
standard typedefs.
-For more information refer to the [@../../libs/bind/bind.html
+For more information refer to the [@/libs/bind/bind.html
Boost.Bind documentation].
namespace std {
@@ -411,7 +411,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_BIND if your
standard library implements this part of TR1.
@@ -448,7 +448,7 @@
arbitrary code may be called. However a polymorphic function wrapper can call
any callable object with a compatible call signature, this could be a function
pointer, or it could be a function object produced by std::tr1::bind, or some
-other mechanism. For more information see the [@../../doc/html/function.html
+other mechanism. For more information see the [@/doc/html/function.html
Boost.Function documentation].
@@ -481,7 +481,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_FUNCTION if your
standard library implements this part of TR1.
@@ -505,7 +505,7 @@
Type traits enable generic code to access the fundamental properties
of a type, to determine the relationship between two types, or to
transform one type into another related type. For more information
-refer to the [@../../libs/type_traits/index.html Boost.Type_traits documentation].
+refer to the [@/libs/type_traits/index.html Boost.Type_traits documentation].
namespace std {
namespace tr1 {
@@ -590,7 +590,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_TYPE_TRAITS if your
standard library implements this part of TR1.
@@ -608,14 +608,14 @@
#include <random>
The random number library is divided into three parts:
-[@../../libs/random/random-generators.html generators], which
+[@/libs/random/random-generators.html generators], which
are nullary functors producing uniform random number distributions.
-[@../../libs/random/random-distributions.html Distributions], which are unary
+[@/libs/random/random-distributions.html Distributions], which are unary
functors that adapt a generator to some
specific kind of distribution. And the class template
-[@../../libs/random/random-variate.html variate_generator]
+[@/libs/random/random-variate.html variate_generator]
which combines a generator with a distribution, to create a new generator.
-For more information see the [@../../libs/random/index.html Boost.Random documentation].
+For more information see the [@/libs/random/index.html Boost.Random documentation].
namespace std {
@@ -761,7 +761,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_RANDOM if your
standard library implements this part of TR1.
@@ -801,7 +801,7 @@
Some programming languages, such as ML, Python and Haskell, have built-in tuple constructs.
Unfortunately C++ does not.
To compensate for this "deficiency", the TR1 Tuple Library implements a tuple construct using templates.
-For more information see the [@../../libs/tuple/index.html Boost Tuple Library Documentation].
+For more information see the [@/libs/tuple/index.html Boost Tuple Library Documentation].
namespace std {
namespace tr1 {
@@ -850,7 +850,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_TUPLE if your
standard library implements this part of TR1.
@@ -886,7 +886,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_UTILITY if your
standard library implements this part of TR1.
@@ -907,7 +907,7 @@
less efficient than a C style array. Class array fulfils almost all of the
requirements of a reversible-container (see Section 23.1,
[lib.container.requirements] of the C++ Standard). For more information refer
-to the [@../../libs/array/index.html Boost.Array documentation].
+to the [@/libs/array/index.html Boost.Array documentation].
namespace std {
namespace tr1 {
@@ -938,7 +938,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_ARRAY if your
standard library implements this part of TR1.
@@ -959,7 +959,7 @@
into a hash-value,
specializations of std::hash are provided for integer, character, floating point,
and pointer types, plus the two string types std::string and std::wstring.
-See the [@../../libs/functional/hash/index.html Boost.Hash]
+See the [@/libs/functional/hash/index.html Boost.Hash]
documentation for more information.
namespace std {
@@ -994,7 +994,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_HASH if your
standard library implements this part of TR1.
@@ -1017,7 +1017,7 @@
This library provides comprehensive support for regular expressions,
including either iterator or string based matching, searching, search-and-replace,
iteration, and tokenization. Both POSIX and ECMAScript (JavaScript) regular
-expressions are supported. For more information see the [@../../libs/regex/index.html
+expressions are supported. For more information see the [@/libs/regex/index.html
Boost.Regex documentation].
namespace std {
@@ -1205,7 +1205,7 @@
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_REGEX if your
standard library implements this part of TR1.
@@ -1287,7 +1287,7 @@
pow (const Arithmetic& x, const complex<Real>& y);
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_COMPLEX_OVERLOADS if your
standard library implements the additional overloads for the existing
complex arithmetic functions.
@@ -1311,7 +1311,7 @@
for arguments of type `std::complex<T>`.
These algorithms are entirely
classical, and behave as specified in the C99 standard section 7.3.5.
-See the [@../../libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex.html
+See the [@/libs/math/doc/complex/html/complex_number_tr1_algorithms/inverse_complex.html
Boost.Math documentation for more information].
namespace std {
@@ -1329,7 +1329,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_COMPLEX_INVERSE_TRIG
if your standard library implements the additional inverse trig functions.
@@ -1517,7 +1517,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_UNORDERED_SET if your
standard library implements this part of TR1.
@@ -1568,7 +1568,7 @@
} // namespace std
[*Configuration:]
-[@../../libs/config/index.html Boost.Config] should (automatically) define
+[@/libs/config/index.html Boost.Config] should (automatically) define
the macro BOOST_HAS_TR1_UNORDERED_MAP if your
standard library implements this part of TR1.
@@ -1697,7 +1697,7 @@
forward on to your existing standard library header in one of two ways: for
gcc it uses `#include_next`, and for other compilers it uses the
macro `BOOST_TR1_STD_HEADER(header)` (defined in
-[@../../boost/tr1/detail/config.hpp boost/tr1/detail/config.hpp])
+[@/boost/tr1/detail/config.hpp boost/tr1/detail/config.hpp])
which evaluates to `#include <../include/header>`. This
should work "straight out the box" for most compilers, but does mean that
these headers should [*never] be placed inside a
Modified: branches/doc/libs/type_traits/doc/credits.qbk
==============================================================================
--- branches/doc/libs/type_traits/doc/credits.qbk (original)
+++ branches/doc/libs/type_traits/doc/credits.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -8,8 +8,8 @@
[section:credits Credits]
This documentation was pulled together by John Maddock, using
-[@../../../../tools/quickbook/doc/html/index.html Boost.Quickbook]
-and [@../../../../doc/html/boostbook.html Boost.DocBook].
+[@/tools/quickbook/doc/html/index.html Boost.Quickbook]
+and [@/doc/html/boostbook.html Boost.DocBook].
The original version of this library was created by Steve Cleary,
Beman Dawes, Howard Hinnant, and John Maddock. John Maddock is the
Modified: branches/doc/libs/type_traits/doc/examples.qbk
==============================================================================
--- branches/doc/libs/type_traits/doc/examples.qbk (original)
+++ branches/doc/libs/type_traits/doc/examples.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -11,7 +11,7 @@
Demonstrates a version of `std::copy` that uses `__has_trivial_assign` to
determine whether to use `memcpy` to optimise the copy operation
-(see [@../../examples/copy_example.cpp copy_example.cpp]):
+(see [@/libs/type_traits/examples/copy_example.cpp copy_example.cpp]):
//
// opt::copy
@@ -62,7 +62,7 @@
Demonstrates a version of `std::fill` that uses `__has_trivial_assign` to
determine whether to use `memset` to optimise the fill operation
-(see [@../../examples/fill_example.cpp fill_example.cpp]):
+(see [@/libs/type_traits/examples/fill_example.cpp fill_example.cpp]):
//
// fill
@@ -107,7 +107,7 @@
Demonstrates a simple algorithm that uses `__has_trivial_destruct` to
determine whether to destructors need to be called
-(see [@../../examples/trivial_destructor_example.cpp trivial_destructor_example.cpp]):
+(see [@/libs/type_traits/examples/trivial_destructor_example.cpp trivial_destructor_example.cpp]):
//
// algorithm destroy_array:
@@ -153,7 +153,7 @@
then takes special care over the swap to ensure that the algorithm
works correctly for both proxying iterators, and even iterators of
different types
-(see [@../../examples/iter_swap_example.cpp iter_swap_example.cpp]):
+(see [@/libs/type_traits/examples/iter_swap_example.cpp iter_swap_example.cpp]):
//
// iter_swap:
@@ -203,7 +203,7 @@
[section:to_double Convert Numeric Types and Enums to double]
Demonstrates a conversion of
-[@../../../../libs/numeric/conversion/doc/html/boost_numericconversion/definitions.html#boost_numericconversion.definitions.numeric_types
+[@/libs/numeric/conversion/doc/html/boost_numericconversion/definitions.html#boost_numericconversion.definitions.numeric_types
Numeric Types]
and enum types to double:
Modified: branches/doc/libs/type_traits/doc/intrinsics.qbk
==============================================================================
--- branches/doc/libs/type_traits/doc/intrinsics.qbk (original)
+++ branches/doc/libs/type_traits/doc/intrinsics.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -42,7 +42,7 @@
* __is_stateless
The hooks for compiler-intrinsic support are defined in
-[@../../../../boost/type_traits/intrinsics.hpp boost/type_traits/intrinsics.hpp], adding support for new compilers is simply
+[@/boost/type_traits/intrinsics.hpp boost/type_traits/intrinsics.hpp], adding support for new compilers is simply
a matter of defining one of more of the following macros:
[table Macros for Compiler Intrinsics
Modified: branches/doc/libs/type_traits/doc/mpl.qbk
==============================================================================
--- branches/doc/libs/type_traits/doc/mpl.qbk (original)
+++ branches/doc/libs/type_traits/doc/mpl.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -8,13 +8,13 @@
[section:mpl MPL Interoperability]
All the value based traits in this library conform to MPL's requirements
-for an [@../../../../libs/mpl/doc/refmanual/integral-constant.html Integral Constant type]: that includes a number of rather intrusive
+for an [@/libs/mpl/doc/refmanual/integral-constant.html Integral Constant type]: that includes a number of rather intrusive
workarounds for broken compilers.
Purely as an implementation detail, this
-means that `__true_type` inherits from [@../../../../libs/mpl/doc/refmanual/bool.html `boost::mpl::true_`], `__false_type` inherits
-from [@../../../../libs/mpl/doc/refmanual/bool.html `boost::mpl::false_`], and `__integral_constant<T, v>` inherits from
-[@../../../../libs/mpl/doc/refmanual/integral-c.html `boost::mpl::integral_c<T,v>`] (provided `T` is not `bool`)
+means that `__true_type` inherits from [@/libs/mpl/doc/refmanual/bool.html `boost::mpl::true_`], `__false_type` inherits
+from [@/libs/mpl/doc/refmanual/bool.html `boost::mpl::false_`], and `__integral_constant<T, v>` inherits from
+[@/libs/mpl/doc/refmanual/integral-c.html `boost::mpl::integral_c<T,v>`] (provided `T` is not `bool`)
[endsect]
Modified: branches/doc/libs/unordered/doc/hash_equality.qbk
==============================================================================
--- branches/doc/libs/unordered/doc/hash_equality.qbk (original)
+++ branches/doc/libs/unordered/doc/hash_equality.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -38,7 +38,7 @@
[case_insensitive_dictionary]
This is a simplified version of the example at
-[@../../libs/unordered/examples/case_insensitive.hpp /libs/unordered/examples/case_insensitive.hpp]
+[@/libs/unordered/examples/case_insensitive.hpp /libs/unordered/examples/case_insensitive.hpp]
which supports other locales and string types.
[h2 Custom Types]
Modified: branches/doc/libs/xpressive/doc/xpressive.qbk
==============================================================================
--- branches/doc/libs/xpressive/doc/xpressive.qbk (original)
+++ branches/doc/libs/xpressive/doc/xpressive.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -37,12 +37,12 @@
[def _spirit_fx_ [@http://spirit.sourceforge.net Spirit Parser Framework]]
[def _spirit_ [@http://spirit.sourceforge.net Spirit]]
-[def _regexpp_ [@../../libs/regex Boost.Regex]]
+[def _regexpp_ [@/libs/regex Boost.Regex]]
[def _proposal_ [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1429.htm proposal]]
[def _boost_ [@http://www.boost.org Boost]]
[def _greta_ [@http://research.microsoft.com/projects/greta GRETA]]
[def _perl6_ [@http://www.perl.com/pub/a/2002/06/04/apo5.html Perl 6]]
-[def _iterator_ [@../../libs/iterator/doc/index.html Boost.Iterator]]
+[def _iterator_ [@/libs/iterator/doc/index.html Boost.Iterator]]
[def _basic_regex_ [^[classref boost::xpressive::basic_regex basic_regex<>]]]
[def _match_results_ [^[classref boost::xpressive::match_results match_results<>]]]
[def _sub_match_ [^[classref boost::xpressive::sub_match sub_match<>]]]
Modified: branches/doc/libs/xpressive/proto/doc/proto.qbk
==============================================================================
--- branches/doc/libs/xpressive/proto/doc/proto.qbk (original)
+++ branches/doc/libs/xpressive/proto/doc/proto.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -38,7 +38,7 @@
[def _PETE_ [@http://www.codesourcery.com/pooma/download.html PETE]]
[def _spirit_fx_ [@http://spirit.sourceforge.net Spirit Parser Framework]]
[def _spirit_ [@http://spirit.sourceforge.net Spirit]]
-[def _xpressive_ [@../../../libs/xpressive/doc/index.html Boost.Xpressive]]
+[def _xpressive_ [@/libs/xpressive/doc/index.html Boost.Xpressive]]
[def _expr_ [classref boost::proto::exprns_::expr<Tag,Args,1> `expr<>`]]
[def _ref_ [classref boost::proto::refns_::ref_ `ref_<>`]]
[def _unref_ [classref boost::proto::functional::unref `unref()`]]
Modified: branches/doc/tools/quickbook/doc/quickbook.qbk
==============================================================================
--- branches/doc/tools/quickbook/doc/quickbook.qbk (original)
+++ branches/doc/tools/quickbook/doc/quickbook.qbk 2008-05-14 16:38:29 EDT (Wed, 14 May 2008)
@@ -84,7 +84,7 @@
documentation, is autogenerated by QuickBook. These files were generated from
one master:
-[:[@../quickbook.qbk quickbook.qbk]]
+[:[@/tools/quickbook/doc/quickbook.qbk quickbook.qbk]]
Originally named QuickDoc, this funky tool that never dies, evolved into a
funkier tool thanks to Eric Niebler who resurrected the project making it
@@ -1659,7 +1659,7 @@
[import ../test/stub.cpp]
''']
-collects specially marked-up code snippets from [@../../test/stub.cpp stub.cpp]
+collects specially marked-up code snippets from [@/tools/quickbook/test/stub.cpp stub.cpp]
and places them in your QuickBook file as virtual templates. Each of the
specially marked-up code snippets has a name (e.g. `foo` and `bar` in the
example above). This shall be the template identifier for that particular code
@@ -1678,7 +1678,7 @@
[heading Code Snippet Markup]
-Note how the code snippets in [@../../test/stub.cpp stub.cpp] get marked up. We
+Note how the code snippets in [@/tools/quickbook/test/stub.cpp stub.cpp] get marked up. We
use distinguishable comments following the form:
//[id
@@ -1761,7 +1761,7 @@
[class_]
-See the actual code here: [@../../test/stub.cpp]
+See the actual code here: [@/tools/quickbook/test/stub.cpp]
[endsect]
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk