[boost-doc-zh] r387 committed - 翻译 bimap 库的 qbk 文件并生成 html 目录

  • From: boost-doc-zh@xxxxxxxxxxxxxx
  • To: boost-doc-zh-notify@xxxxxxxxxxxxx
  • Date: Mon, 08 Mar 2010 09:28:22 +0000

Revision: 387
Author: alai04
Date: Mon Mar  8 01:27:36 2010
Log: 翻译 bimap 库的 qbk 文件并生成 html 目录
http://code.google.com/p/boost-doc-zh/source/detail?r=387

Modified:
 /trunk/libs/bimap/doc/acknowledgements.qbk
 /trunk/libs/bimap/doc/bimap.qbk
 /trunk/libs/bimap/doc/bimap_and_boost.qbk
 /trunk/libs/bimap/doc/compiler_specifics.qbk
 /trunk/libs/bimap/doc/examples.qbk
 /trunk/libs/bimap/doc/future_work.qbk
 /trunk/libs/bimap/doc/history.qbk
 /trunk/libs/bimap/doc/html/boost_bimap/acknowledgements.html
/trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html
 /trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html
 /trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html
 /trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html
 /trunk/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html
/trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html /trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html
 /trunk/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html
 /trunk/libs/bimap/doc/html/boost_bimap/examples.html
 /trunk/libs/bimap/doc/html/boost_bimap/future_work.html
 /trunk/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html
 /trunk/libs/bimap/doc/html/boost_bimap/history.html
 /trunk/libs/bimap/doc/html/boost_bimap/introduction.html
 /trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html
 /trunk/libs/bimap/doc/html/boost_bimap/performance.html
 /trunk/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html
 /trunk/libs/bimap/doc/html/boost_bimap/rationale/code.html
/trunk/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html
 /trunk/libs/bimap/doc/html/boost_bimap/rationale.html
 /trunk/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html
 /trunk/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html
 /trunk/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html
/trunk/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html /trunk/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html
 /trunk/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html
 /trunk/libs/bimap/doc/html/boost_bimap/reference.html
 /trunk/libs/bimap/doc/html/boost_bimap/release_notes.html
 /trunk/libs/bimap/doc/html/boost_bimap/test_suite.html
/trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html
 /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html
 /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html
 /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial.html
 /trunk/libs/bimap/doc/html/index.html
 /trunk/libs/bimap/doc/introduction.qbk
 /trunk/libs/bimap/doc/performance.qbk
 /trunk/libs/bimap/doc/quick_tutorial.qbk
 /trunk/libs/bimap/doc/rationale.qbk
 /trunk/libs/bimap/doc/reference/bimap.qbk
 /trunk/libs/bimap/doc/reference/list_of.qbk
 /trunk/libs/bimap/doc/reference/set_of.qbk
 /trunk/libs/bimap/doc/reference/unconstrained_set_of.qbk
 /trunk/libs/bimap/doc/reference/unordered_set_of.qbk
 /trunk/libs/bimap/doc/reference/vector_of.qbk
 /trunk/libs/bimap/doc/reference.qbk
 /trunk/libs/bimap/doc/release_notes.qbk
 /trunk/libs/bimap/doc/test_suite.qbk
 /trunk/libs/bimap/doc/tutorial.qbk

=======================================
--- /trunk/libs/bimap/doc/acknowledgements.qbk  Sun Feb  7 21:50:27 2010
+++ /trunk/libs/bimap/doc/acknowledgements.qbk  Mon Mar  8 01:27:36 2010
@@ -12,7 +12,7 @@

 [/ QuickBook Document version 1.4 ]

-[section Acknowledgements]
+[section:acknowledgements Acknowledgements 鸣谢]

 This library was developed in the context of the Google SoC 2006. I
 first want to thank my mentor, Joaquin, for his friendship during this
=======================================
--- /trunk/libs/bimap/doc/bimap.qbk     Sun Feb  7 21:50:27 2010
+++ /trunk/libs/bimap/doc/bimap.qbk     Mon Mar  8 01:27:36 2010
@@ -129,9 +129,9 @@
 [import ../example/simple_bimap.cpp]
 [import ../example/mighty_bimap.cpp]

-[section Preface]
-
-[heading Description]
+[section:preface Preface 前言]
+
+[heading Description 说明]

 __BOOST_BIMAP_LOGO__

@@ -139,13 +139,19 @@
can be thought of as a combination of a `std::map<X,Y>` and a `std::map<Y,X>`.
 The learning curve of bimap is almost flat if you know how to use standard
containers. A great deal of effort has been put into mapping the naming scheme of the -STL in Boost.Bimap. The library is designed to match the common STL containers.
-
-[heading Influences and Related Work]
+STL in Boost.Bimap. The library is designed to match the common STL containers.\n +Boost.Bimap 是一个C++的双向 map 库。使用 Boost.Bimap,你可以创建两个类型都 可用作键值的关联容器。 +`bimap<X,Y>` 可以被视为 `std::map<X,Y>` 加上 `std::map<Y,X>`。如果你知道如 何使用标准容器, +那么 bimap 的学习曲线就几乎是平的。在 Boost.Bimap 中作出了大量的努力,以符 合STL的命名规则。
+本库是按照与常见STL容器相匹配的方式进行设计的。
+
+[heading Influences and Related Work 影响及相关工作]

 The design of Boost.Bimap interface follows the standard template library.
It has been strongly influenced by Joaquin Lopez Muñoz's Boost.MultiIndex library
-(the heart of bimaps) and codeproject::bimap library.
+(the heart of bimaps) and codeproject::bimap library.\n
+Boost.Bimap 接口的设计是遵照标准模板库的。它受到了 Joaquin Lopez Muñoz 的 Boost.MultiIndex 库(bimap 的核心)
+以及 codeproject::bimap 库的强烈影响。

 [endsect]

=======================================
--- /trunk/libs/bimap/doc/bimap_and_boost.qbk   Sun Feb  7 21:50:27 2010
+++ /trunk/libs/bimap/doc/bimap_and_boost.qbk   Mon Mar  8 01:27:36 2010
@@ -16,18 +16,22 @@

 [section Bimap and MultiIndex]

-['MISC] - [*M]ulti-[*I]ndex [*S]pecialized [*C]ontainers
+['MISC] - [*M]ulti-[*I]ndex [*S]pecialized [*C]ontainers\n
+['MISC] - [*多重索引专用容器]

 [:['
 Let's be generic, construct frameworks, describe the world in an
-unified way...
+unified way...\n
+我们应该进行泛型的设计,构造框架,以统一的方式来描述世界...
 ]]
 [:['
 No!, it is better to be specialized, design easy-to-use components,
-offer plug-and-play objects...
+offer plug-and-play objects...\n
+不!特化是更好的,设计易用的组件,提供即插即用的对象...
 ]]
 [:[*
-Why not take advantage of the best of both worlds?
+Why not take advantage of the best of both worlds?\n
+为什么不同时利用两种方式的优势?
 ]]

 __MI_FRAMEWORK__
@@ -38,7 +42,10 @@
 offers great flexibility and lets you construct almost any container
 that you could dream of. The framework is very clean. You migh want to
 read this library's tutorial to learn about the power that has been
-achieved.
+achieved.\n
+有了 Boost.Bimap,你可以构建两侧类型均可用作键值的关联式容器。Boost 中还有 一个库也可以创建此类容器, +它就是:Boost.MultiIndex。它提供了强大的灵活性,几乎可以让你构造任意想要的 容器。
+该框架非常干净。你也许想看看该库的教程来学习它所具有的能力。


 But generality comes at a price: the interface that results might not be
@@ -47,99 +54,134 @@
 bidirectional map. Boost.Bimap takes advantage of the narrower scope to
 produce a better interface for bidirectional maps
 [footnote In the same fashion, Boost.MRU will allow the creation of ['most
-recent updated] aware containers, hiding the complexity of Boost.MultiIndex.]. +recent updated] aware containers, hiding the complexity of Boost.MultiIndex.\n +同样的方式 ,Boost.MRU 可用于创建对['最近更新]感知的容器,将 Boost.MultiIndex 的复杂性隐藏起来。].
 There is no learning curve if you know how to use standard containers.
Great effort was put into mapping the naming scheme of the STL to Boost.Bimap.
-The library is designed to match the common STL containers.
-
-Boost.MultiIndex is, in fact, the core of the bimap container.
+The library is designed to match the common STL containers.\n
+不过通用性是有代价的:其接口对于各种特殊情况来说不一定是最好的。
+人们也许不想在每次想使用双向映射时都将一个 B.MI 容器包装到一个自己的类中。
+Boost.Bimap 凭借较窄的适用范围定义了一个更好的双向映射的接口。如果你懂得如 何使用标准容器,
+则不存在任何学习曲线。将 STL 的命名方式置于 Boost.Bimap 也获得了很多好处。
+这个库被设计与常用的 STL 容器相匹配。
+
+Boost.MultiIndex is, in fact, the core of the bimap container.\n
+事实上,Boost.MultiIndex 是 bimap 容器的核心。

 However, Boost.Bimap do not aim to tackle every problem with two indexed
-types. There exist some problems that are better modelled with Boost.MultiIndex. +types. There exist some problems that are better modelled with Boost.MultiIndex.\n +不过,Boost.Bimap 并不是解决与两个索引类型相关的任意问题的工具。有一些问题 使用 Boost.MultiIndex 会更好。


 [blurb

-[*Problem I  - An employee register]
-
-['Store an ID and a name for an employee, with fast search on each member.]
+[*Problem I  - An employee register\n
+问题 I - 员工记录]
+
+['Store an ID and a name for an employee, with fast search on each member.\n
+为每个员工保存一个ID和一个名字,需要快速查找每个成员。]

 This type of problem is better modelled as a database table, and
 [*Boost.MultiIndex] is the preferred choice. It is possible that other data
-will need to be indexed later.
+will need to be indexed later.\n
+这类问题最好是建模为数据库表,而 [*Boost.MultiIndex] 是最好的选择。它可以在 以后增加其它索引数据。

 ]

 [blurb

-[*Problem II - A partners container]
+[*Problem II - A partners container\n
+问题 II - 伙伴容器]

 ['Store the names of couples and be able to get the name of a person's
-partner.]
+partner.\n
+保存多对名字,且能够取出某个人的伙伴的名字。]

This problem is better modelled as a collection of relations, and [*Boost.Bimap]
-fits nicely here.
+fits nicely here.\n
+该问题最好建模为一组关系的组合,而 [*Boost.Bimap] 非常适用。

 ]

 You can also read
[link boost_bimap.the_tutorial.additional_information Additional Information] for more
-information about the relation of this two libraries.
+information about the relation of this two libraries.\n
+你也可以阅读 [link boost_bimap.the_tutorial.additional_information 更多的信 息] 一节,
+其中有关于这两个库的关系的更多信息。

 [endsect]

-[section Boost Libraries that work well with Boost.Bimap]
-
-[section Introduction]
+[section:boost_libraries_that_work_well_with_boost_bimap Boost Libraries that work well with Boost.Bimap
+可以与Boost.Bimap共同使用的Boost库]
+
+[section:introduction Introduction 简介]

 [table
-[[Name][Description][author][Purpose]]
+[[Name 名字][Description 说明][author 作者][Purpose 目的]]

 [[ __BOOST_SERIALIZATION__ ][
-Serialization for persistence and marshalling]
+Serialization for persistence and marshalling\n
+为持续性和重整进行序列化]
 [Robert Ramey]
-[Serialization support for bimap containers and iterators]]
+[Serialization support for bimap containers and iterators\n
+支持 bimap 容器及迭代器的序列化]]

 [[ __BOOST_ASSIGN__ ][
-Filling containers with constant or generated data has never been easier]
+Filling containers with constant or generated data has never been easier\n
+以最易用的方式用常数或生成的数据填充容器]
 [Thorsten Ottosen]
-[Help to fill a bimap or views of it]]
+[Help to fill a bimap or views of it\n
+帮助填充一个 bimap 或其视图]]

 [[ __BOOST_HASH__ ][
-A TR1 hash function object that can be extended to hash user defined types]
+A TR1 hash function object that can be extended to hash user defined types\n
+TR1的散列函数对象,可以扩展至对用户自定义类型进行散列]
 [Daniel James]
-[Default hashing function]]
+[Default hashing function\n
+缺省的散列函数]]

 [[ __BOOST_LAMBDA__ ][
-Define small unnamed function objects at the actual call site, and more]
+Define small unnamed function objects at the actual call site, and more\n
+就地定义小型匿名函数对象,及其它]
 [from Jaakko Järvi, Gary Powell]
-[Functors for modify, range, lower_bound and upper_bound]]
+[Functors for modify, range, lower_bound and upper_bound\n
+用于 modify, range, lower_bound 和 upper_bound 的函数对象]]

 [[ __BOOST_RANGE__ ][
 A new infrastructure for generic algorithms that builds on top of the new
-iterator concepts]
+iterator concepts\n
+用于泛型算法的新的基础设施,建筑于新的迭代器概念之上]
 [Thorsten Ottosen]
-[Range based algorithms]]
+[Range based algorithms\n
+基于区间范围的算法]]

 [[ __BOOST_FOREACH__ ][
-BOOST_FOREACH macro for easily iterating over the elements of a sequence]
+BOOST_FOREACH macro for easily iterating over the elements of a sequence\n
+BOOST_FOREACH 宏,更容易地遍历一个序列的元素]
 [Eric Niebler]
-[Iteration]]
+[Iteration\n
+迭代]]

 [[ __BOOST_TYPEOF__ ][
-Typeof operator emulation]
+Typeof operator emulation\n
+模仿 typeof 操作符]
 [Arkadiy Vertleyb, Peder Holt]
-[Using BOOST_AUTO while we wait for C++0x]]
+[Using BOOST_AUTO while we wait for C++0x\n
+在等待 C++0x 之时使用 BOOST_AUTO]]

 [[ __BOOST_XPRESSIVE__ ][
-Regular expressions that can be written as strings or as expression templates] +Regular expressions that can be written as strings or as expression templates\n
+可以写为字符串或表达式模板的正规表达式]
 [Eric Niebler]
-[Help to fill a bimap from a string]]
+[Help to fill a bimap from a string\n
+帮助从一个字符串填充 bimap]]

 [[ __BOOST_PROPERTY_MAP__ ][
-Concepts defining interfaces which map key objects to value objects]
+Concepts defining interfaces which map key objects to value objects\n
+定义了将键对象映射至值对象的接口的概念]
 [Jeremy Siek]
-[Integration with BGL]]
+[Integration with BGL\n
+与 BGL 集成]]
 ]

 [endsect]
@@ -148,11 +190,13 @@

A bimap can be archived and retrieved by means of the Boost.Serialization Library. Both regular and XML archives are supported. The usage is straightforward and does
-not differ from that of any other serializable type. For instance:
+not differ from that of any other serializable type. For instance:\n
+bimap 可以通过 Boost.Serialization 库进行存档和取回。常规存档和XML存档均可 支持。
+用法直接,与其它可序列化类型没有区别。例如:

 [import ../example/bimap_and_boost/serialization.cpp]

-[@../../example/bimap_and_boost/serialization.cpp Go to source code]
+[@../../example/bimap_and_boost/serialization.cpp Go to source code 察看源 代码]

 [code_bimap_and_boost_serialization]

@@ -163,12 +207,18 @@
be disabled by globally defining the macro BOOST_BIMAP_DISABLE_SERIALIZATION. Disabling serialization for Boost.MultiIndex can yield a small improvement in
 build times, and may be necessary in those defective compilers that fail to
-correctly process Boost.Serialization headers.
+correctly process Boost.Serialization headers.\n
+只要与合适的 Boost.Serialization 库链接,就能自动提供序列化的能力:不需要显 式包含任何 Boost.Serialization 的头文件, +除了那些声明了要使用的存档类型的头文件以外。不过,如果不使用序列化,也可以 通过在全局定义一个宏 +BOOST_BIMAP_DISABLE_SERIALIZATION 来禁止掉序列化的支持。禁止 Boost.MultiIndex 的序列化可以对构建时间有少许的改进, +也可能对于那些有缺陷的不能正确处理 Boost.Serialization 头文件的编译器,这是 必须的。

[warning Boost.Bimap and Boost.MultiIndex share a lot of serialization code. The macro `BOOST_BIMAP_DISABLE_SERIALIZATION` disables serialization in *both* libraries. The same happens when `BOOST_MULTI_INDEX_DISABLE_SERIALIZATION` is
-defined.
+defined.\n
+Boost.Bimap 和 Boost.MultiIndex 共享了大量的序列化代码。宏 `BOOST_BIMAP_DISABLE_SERIALIZATION` 将禁止掉两个库的序列化。
+如果定义了 `BOOST_MULTI_INDEX_DISABLE_SERIALIZATION`,结果也一样。
 ]

Retrieving an archived bimap restores not only the elements, but also the order
@@ -177,10 +227,15 @@
will be iterated in the restored container; in general, it is unwise to rely on the ordering of elements of a hashed view, since it can change in arbitrary ways during insertion or rehashing --this is precisely the reason why hashed indices -and TR1 unordered associative containers do not define an equality operator. +and TR1 unordered associative containers do not define an equality operator.\n +取加一个存档的 bimap,不仅恢复了其中的元素,同时它们对于容器各视图的顺序也 是排好的。 +不过对于这一规则有一个例外:对于 unordered set,被恢复的容器中的元素的遍历 顺序没有保证; +通常,依赖于一个散列视图的元素顺序是不明智的,因为在插入和重散列时,元素的 顺序会任意改变
+-- 这正是为什么散列索引和TR1的无序关联式容器没有定义相等操作符的原因。

 Iterators of a bimap can also be serialized. Serialization of an
-iterator must be done only after serializing its corresponding container.
+iterator must be done only after serializing its corresponding container.\n
+bimap 的迭代器也可以被序列化。对一个迭代器的序列化必须在其对应容器被序列化 之后进行。

 [endsect]

@@ -188,22 +243,29 @@

The purpose of this library is to make it easy to fill containers with data by overloading operator,() and operator()(). These two operators make it possible
-to construct lists of values that are then copied into a container.
+to construct lists of values that are then copied into a container.\n
+这个库的目的是可以很容易地向容器中填充数据,它通过重载 operator,() 和 operator()() 来实现。
+这两个操作符可以构造一个值列表,然后复制到容器中。

 These lists are particularly useful in learning, testing, and prototyping
situations, but can also be handy otherwise. The library comes with predefined operators for the containers of the standard library, but most functionality will work with any standard compliant container. The library also makes it possible to extend user defined types so for example a member function can be called for
-a list of values instead of its normal arguments.
+a list of values instead of its normal arguments.\n
+这些列表尤其适用于学习、测试和原型化,但是在其它情况下也很方便。该库对于标 准库的容器预定义了一些操作符,
+但多数功能都可以用于与标准兼容的任意容器。该库也可以扩展至用户自定义类型,
+例如某个成员函数可以对一个值列表进行调用,替换原有的普通参数。

 Boost.Assign can be used with bimap containers.
 The views of a bimap are signature-compatible with their standard
-counterparts, so we can use other Boost.Assign utilities with them.
+counterparts, so we can use other Boost.Assign utilities with them.\n
+Boost.Assign 可以用于 bimap 容器。bimap 的视图与标准中的对应物是签名兼容 的,
+所以我们可以对它们使用其它 Boost.Assign 工具。

 [import ../example/bimap_and_boost/assign.cpp]

-[@../../example/bimap_and_boost/assign.cpp Go to source code]
+[@../../example/bimap_and_boost/assign.cpp Go to source code 察看源代码]

 [code_bimap_and_boost_assign]

@@ -214,14 +276,21 @@
 The hash function is the very core of the fast lookup capabilities of the
unordered sets: a hasher is just a Unary Function returning an std::size_t value
 for any given key. In general, it is impossible that every key map to a
-different hash value, for the space of keys can be greater than the number of permissible hash codes: what makes for a good hasher is that the probability of a collision (two different keys with the same hash value) is as close to zero as possible.
-
-This is a statistical property depending on the typical distribution of keys in a given application, so it is not feasible to have a general-purpose hash function with excellent results in every possible scenario; the default value for this parameter uses Boost.Hash, which often provides good enough results. +different hash value, for the space of keys can be greater than the number of permissible hash codes: what makes for a good hasher is that the probability of a collision (two different keys with the same hash value) is as close to zero as possible.\n +散列函数是无序集合的快速查找能力的核心:散列器就是一个可以对任意给定的键值 返回一个 std::size_t 值的单参函数对象。 +通常,它不可能将每一个键值映射到一个不同的散列值,键值的空间可以大于所允许 的散列值的数量: +一个好的散列器,要求其发生冲突(两个不同的键值对应同一个散列值)的可能性尽量 接近于零。
+
+This is a statistical property depending on the typical distribution of keys in a given application, so it is not feasible to have a general-purpose hash function with excellent results in every possible scenario; the default value for this parameter uses Boost.Hash, which often provides good enough results.\n +这是一种统计特性,它依赖于在给定应用中的键值分布情况,所以不存在一个通用的 散列函数,可以在各种情况都得到很好的效果;
+这个参数的缺省值将使用 Boost.Hash,它通常能够提供不错的效果。

 Boost.Hash can be
 [@http://www.boost.org/doc/html/hash/custom.html
 extended for custom data types],
-enabling to use the default parameter of the unordered set types with any user types. +enabling to use the default parameter of the unordered set types with any user types.\n +Boost.Hash 可以 [@http://www.boost.org/doc/html/hash/custom.html 针对定制的 数据类型进行扩展],
+以对用户类型使用无序集合类型的缺省参数。

 [endsect]

@@ -231,17 +300,22 @@
form of lambda abstractions for C++. The term originates from functional programming and
 lambda calculus, where a lambda abstraction defines an unnamed function.
Lambda expressions are very useful to construct the function objects required by some of
-the functions in a bimap view.
+the functions in a bimap view.\n
+Boost Lambda 库(后称BLL)是一个C++模板库,它为C++实现了 lambda 抽象形式。这 一术语来源自函数式编程和 lambda 运算, +lambda 抽象定义了一个匿名函数。Lambda 表达式对于在 bimap 视图的某些函数中构 造函数对象非常有用。

 Boost.Bimap defines new placeholders in `<boost/bimap/support/lambda.hpp>`
to allow a sounder solution. The placeholders are named _key and _data and both are equivalent to boost::lambda::_1. There are two reasons to include this placeholders: the code looks better with them and they avoid the clash problem between lambda::_1 and
-boost::_1 from Boost.Bind.
+boost::_1 from Boost.Bind.\n
+Boost.Bimap 在 `<boost/bimap/support/lambda.hpp>` 中定义了新的占位符,以得 到更漂亮的解法。 +这些占位符名为 _key 和 _data,它们都等价于 boost::lambda::_1. 包含这些占位 符有两个原因: +代码更好看一些,而且避免了在 lambda::_1 和 Boost::Bind 的 boost::_1 间的冲 突问题。

 [import ../example/bimap_and_boost/lambda.cpp]

-[@../../example/bimap_and_boost/lambda.cpp Go to source code]
+[@../../example/bimap_and_boost/lambda.cpp Go to source code 察看源代码]

 [code_bimap_and_boost_lambda]

@@ -256,24 +330,32 @@
work on. This leads to a very general interface, but also to a somewhat clumsy use of the algorithms with redundant specification of container names. Therefore we would like to raise the abstraction level for algorithms so they specify their
-interface in terms of Ranges as much as possible.
+interface in terms of Ranges as much as possible.\n
+Boost.Range 包含一组概念和工具,它们特别适用于声明和实现泛型算法。
+当前的泛型算法都是以两个或多个迭代器来声明的。这两个迭代器一起表示了该算法 要操作的一组值的范围。 +这导致了一个非常通用的接口,但是也由于容器名的冗余而使得算法的使用有些笨 拙。
+因此我们希望提升算法的抽象级别,尽可能按照 Range 来声明。

 As Boost.Bimap views are signature-compatible with their standard
 container counterparts, they are compatible with the concept of a range.
 As an additional feature, ordered bimap views offer a function named
-`range` that allows a range of values to be obtained.
+`range` that allows a range of values to be obtained.\n
+由于 Boost.Bimap 的视图签名兼容于它们的标准容器对应物,所以它们也兼容于 range 的概念。 +作为一个额外的特性,有序的 bimap 视图提供了一个名为 `range` 的函数,以获得 值的 range。

 [import ../example/bimap_and_boost/range.cpp]

-If we have some generic functions that accepts ranges:
+If we have some generic functions that accepts ranges:\n
+如果我们有一些接受 range 的泛型函数:

 [code_bimap_and_boost_range_functions]

-We can use them with Boost.Bimap with the help of the `range` function.
+We can use them with Boost.Bimap with the help of the `range` function.\n
+我们就可以在 `range` 函数的帮助下将它们用于 Boost.Bimap。

 [code_bimap_and_boost_range]

-[@../../example/bimap_and_boost/range.cpp Go to source code]
+[@../../example/bimap_and_boost/range.cpp Go to source code 察看源代码]

 [endsect]

@@ -287,21 +369,28 @@
languages, like Perl, provide a dedicated "foreach" construct that automates
 this process. BOOST_FOREACH is just such a construct for C++. It iterates
over sequences for us, freeing us from having to deal directly with iterators
-or write predicates.
+or write predicates.\n
+在C++中,编写一个循环来遍历一个序列是很乏味的。我们可以使用迭代器,它要求相 当数量的 boiler-plate, +或者我们可以使用 std::for_each() 算法,这样我们需要将我们的循环体写成一个谓 词,它并没有减少 boiler-plate,
+还迫使我们将处理逻辑移到了远离使用点的地方。作为比较,有些语言,如 Perl,
+提供了一个专门的"foreach"结构来自动处理这一过程。BOOST_FOREACH 就是用于 C++的这样一个结构。
+它为我们迭代整个序列,不需要我们直接处理迭代器或编写谓词。

You can use BOOST_FOREACH macro with Boost.Bimap views. The generated code will
 be as efficient as a std::for_each iteration.
-Here are some examples:
+Here are some examples:\n
+你可以对 Boost.Bimap 视图使用 BOOST_FOREACH 宏。所生成的代码和 std::for_each 迭代同样高效。以下是一些例子:

 [import ../example/bimap_and_boost/foreach.cpp]

 [code_bimap_and_boost_foreach]

-You can use it directly with ranges too:
+You can use it directly with ranges too:\n
+你也可以直接使用 range:

 [code_bimap_and_boost_foreach_using_range]

-[@../../example/bimap_and_boost/foreach.cpp Go to source code]
+[@../../example/bimap_and_boost/foreach.cpp Go to source code 察看源代码]

 [endsect]

@@ -309,30 +398,36 @@

 [import ../example/bimap_and_boost/typeof.cpp]

-Once C++0x is out we are going to be able to write code like:
+Once C++0x is out we are going to be able to write code like:\n
+一旦 C++0x 发布,我们就可以写这样的代码:

     auto iter = bm.by<name>().find("john");

-instead of the more verbose
+instead of the more verbose\n
+替代以下冗长的写法:

     bm_type::map_by<name>::iterator iter = bm.by<name>().find("john");

 Boost.Typeof defines a macro BOOST_AUTO that can be used as a library
-solution to the auto keyword while we wait for the next standard.
-
-If we have
+solution to the auto keyword while we wait for the next standard.\n
+Boost.Typeof 定义了一个宏 BOOST_AUTO,在我们等待新标准的期间,它可以用作对 auto 关键字的一个库形式的解决方案。
+
+If we have\n
+如果我们有:

 [code_bimap_and_boost_typeof_first]

-The following code snippet
+The following code snippet\n
+则以下代码片断:

 [code_bimap_and_boost_typeof_not_using_auto]

-can be rewrited as
+can be rewrited as\n
+可以写为:

 [code_bimap_and_boost_typeof_using_auto]

-[@../../example/bimap_and_boost/typeof.cpp Go to source code]
+[@../../example/bimap_and_boost/typeof.cpp Go to source code 察看源代码]

 [endsect]

@@ -342,11 +437,13 @@

Using Boost.Xpressive we can parse a file and insert the relations in a bimap
 in the same step. It is just amazing the power of four lines of code.
-Here is an example (it is just beatifull)
+Here is an example (it is just beatifull)\n
+使用 Boost.Xpressive,我们可以分析一个文件并同时将其中的关系插入到一个 bimap 中。
+令人惊讶的是,这只需要四行代码。以下是一个例子(非常漂亮):

 [code_bimap_and_boost_xpressive]

-[@../../example/bimap_and_boost/xpressive.cpp Go to source code]
+[@../../example/bimap_and_boost/xpressive.cpp Go to source code 察看源代码]

 [endsect]

@@ -357,28 +454,37 @@
are intended for use by implementers of generic libraries in communicating requirements on template parameters to their users. In particular, the Boost Property Map concepts define a general purpose interface for mapping key objects to corresponding value objects, thereby
-hiding the details of how the mapping is implemented from algorithms.
+hiding the details of how the mapping is implemented from algorithms.\n
+Boost Property Map 库主要是以概念(类似于STL中的迭代器概念)的方式包含了一些 接口规范。 +这些接口规范计划用于实现那些以模板参数与其用户进行要求沟通的泛型库。具体地 说, +Boost Property Map 的概念为将键对象映射至相应的值对象定义了一个通用的接 口,从而对算法隐藏了如何实现映射的细节。

The need for the property map interface came from the Boost Graph Library (BGL), which contains many examples of algorithms that use the property map concepts to specify their interface. For an example, note the ColorMap template parameter of the breadth_first_search. In addition, the BGL contains many examples of concrete types that implement the property map interface. The adjacency_list class implements property maps for accessing objects
-(properties) that are attached to vertices and edges of the graph.
+(properties) that are attached to vertices and edges of the graph.\n
+对于属性映射接口的需求来自于 Boost Graph 库(BGL),该库包含了许多算法例 子,它们使用属性映射概念来指定其接口。 +例如,breadth_first_search 的 ColorMap 模板参数。此外,BGL 还包含了多个实现 了属性映射接口的具体类型例子。 +adjacency_list 类实现了一些属性映射,用于访问附属于图的顶点和边的对象(属性 )。

 The counterparts of two of the views of Boost.Bimap map, the `set` and
 `unordered_set`, are read-write property maps. In order to use these, you
-need to include one of the following headers:
+need to include one of the following headers:\n
+Boost.Bimap 映射视图的两个对应物,`set` 和 `unordered_set`,就是可读写的属 性映射。
+为了使用它们,你需要包含以下头文件中的某一个:

     #include <boost/bimap/property_map/set_support.hpp>
     #include <boost/bimap/property_map/unordered_set_support.hpp>

 The following is adapted from the example in the Boost.PropertyMap
-documentation.
+documentation.\n
+以下例子是根据 Boost.PropertyMap 文档中的例子改写的。

 [import ../example/bimap_and_boost/property_map.cpp]

-[@../../example/bimap_and_boost/property_map.cpp Go to source code]
+[@../../example/bimap_and_boost/property_map.cpp Go to source code 察看源代 码]

 [code_bimap_and_boost_property_map]

@@ -386,88 +492,111 @@

 [endsect]

-[section Dependencies]
+[section:dependencies Dependencies 依赖性]

 Boost.Bimap is built on top of several Boost libraries. The rationale
 behind this decision is keeping the Boost code base small by reusing
 existent code. The libraries used are well-established and have been
 tested extensively, making this library easy to port since all the hard
 work has already been done. The glue that holds everything together is
-Boost.MPL. Clearly Boost.MultiIndex is the heart of this library.
-
-[table Boost Libraries needed by Boost.Bimap
-[[Name][Description][author]]
+Boost.MPL. Clearly Boost.MultiIndex is the heart of this library.\n
+Boost.Bimap 是构建在几个 Boost 库之上的。这一决定的原理是要通过重用已有代码 将 Boost 的代码基保持为最小。 +被使用的库都是已确定和广泛测试的,以保证本库可以很容易地被移植,所有艰难的 工作已经完成过了。
+将所有东西粘合起来的是 Boost.MPL。显然 Boost.MultiIndex 则是本库的核心。
+
+[table Boost Libraries needed by Boost.Bimap  Boost.Bimap所需要的Boost库
+[[Name 名字][Description 说明][author 作者]]

 [[ __BOOST_MULTI_INDEX__ ][
-Containers with multiple STL-compatible access interfaces]
+Containers with multiple STL-compatible access interfaces\n
+具有多个STL兼容的访问接口的容器]
 [Joaquín M López Muñoz]]

 [[ __BOOST_MPL__ ][
-Template metaprogramming framework of compile-time algorithms, sequences and metafunction classes] +Template metaprogramming framework of compile-time algorithms, sequences and metafunction classes\n
+编译期算法、序列和元函数类的模板元编程框架]
 [Aleksey Gurtovoy]]

 [[ __BOOST_TYPE_TRAITS__ ][
-Templates for fundamental properties of types.]
+Templates for fundamental properties of types.\n
+类型基础属性的模板]
 [John Maddock, Steve Cleary]]

 [[ __BOOST_ENABLE_IF__ ][
-Selective inclusion of function template overloads]
+Selective inclusion of function template overloads\n
+函数模板重载的可选择包含]
 [Jaakko Järvi, Jeremiah Willcock, Andrew Lumsdaine]]

 [[ __BOOST_ITERATORS__ ][
-Iterator construction framework, adaptors, concepts, and more.]
+Iterator construction framework, adaptors, concepts, and more.\n
+迭代器构造框架、适配器、概念及其它]
 [Dave Abrahams, Jeremy Siek, Thomas Witt]]

 [[ __BOOST_CALL_TRAITS__ ][
-Defines types for passing parameters.]
+Defines types for passing parameters.\n
+为传递参数定义类型]
 [John Maddock, Howard Hinnant]]

 [[ __BOOST_STATIC_ASSERT__ ][
-Static assertions (compile time assertions).]
+Static assertions (compile time assertions).\n
+静态断言(编译期断言)]
 [John Maddock]]

 ]

-[table Optional Boost Libraries
-[[Name][Description][author][Purpose]]
+[table Optional Boost Libraries 可选的Boost库
+[[Name 名字][Description 说明][author 作者][Purpose 目的]]

 [[ __BOOST_SERIALIZATION__ ][
-Serialization for persistence and marshalling]
+Serialization for persistence and marshalling\n
+为持久性和重整进行序列化]
 [Robert Ramey]
-[Serialization support for bimap containers and iterators]]
+[Serialization support for bimap containers and iterators\n
+支持 bimap 容器和迭代器的序列化]]

 [[ __BOOST_ASSIGN__ ][
-Filling containers with constant or generated data has never been easier]
+Filling containers with constant or generated data has never been easier\n
+以最方便的方式用常数或生成的数据填充容器]
 [Thorsten Ottosen]
-[Help to fill a bimap or views of it]]
+[Help to fill a bimap or views of it\n
+帮助填充一个 bimap 或其视图]]

 [[ __BOOST_HASH__ ][
-A TR1 hash function object that can be extended to hash user defined types]
+A TR1 hash function object that can be extended to hash user defined types\n
+一个 TR1 散列函数对象,可以扩展至对用户自定义类型进行散列]
 [Daniel James]
-[Default hashing function]]
+[Default hashing function\n
+缺省的散列函数]]

 [[ __BOOST_LAMBDA__ ][
-Define small unnamed function objects at the actual call site, and more]
+Define small unnamed function objects at the actual call site, and more\n
+就地定义小型匿名函数对象,及其它]
 [from Jaakko Järvi, Gary Powell]
-[Functors for modify, range, lower_bound and upper_bound]]
+[Functors for modify, range, lower_bound and upper_bound\n
+用于 modify, range, lower_bound 和 upper_bound 的函数对象]]

 [[ __BOOST_RANGE__ ][
 A new infrastructure for generic algorithms that builds on top of the new
-iterator concepts]
+iterator concepts\n
+用于泛型算法的新的基础设施,建筑于新的迭代器概念之上]
 [Thorsten Ottosen]
-[Range based algorithms]]
+[Range based algorithms\n
+基于区间范围的算法]]

 [[ __BOOST_PROPERTY_MAP__ ][
-Concepts defining interfaces which map key objects to value objects]
+Concepts defining interfaces which map key objects to value objects\n
+定义了将键对象映射至值对象的接口的概念]
 [Jeremy Siek]
-[Integration with BGL]]
+[Integration with BGL\n
+与 BGL 集成]]
 ]

-[table Additional Boost Libraries needed to run the test-suite
-[[Name][Description][author]]
+[table Additional Boost Libraries needed to run the test-suite 运行测试套件 所需的其它Boost库
+[[Name 名字][Description 说明][author 作者]]

 [[ __BOOST_TEST__ ][
-Support for simple program testing, full unit testing, and for program execution monitoring.] +Support for simple program testing, full unit testing, and for program execution monitoring.\n
+支持简单的程序测试、全单元测试,以及程序运行监控。]
 [Gennadiy Rozental]
 ]
 ]
=======================================
--- /trunk/libs/bimap/doc/compiler_specifics.qbk        Sun Feb  7 21:50:27 2010
+++ /trunk/libs/bimap/doc/compiler_specifics.qbk        Mon Mar  8 01:27:36 2010
@@ -12,26 +12,26 @@

 [/ QuickBook Document version 1.4 ]

-[section Compiler specifics]
+[section:compiler_specifics Compiler specifics 编译器相关说明]

 [table
-[[Compiler  ][OS Tested ][State                               ]]
-[[GCC 3.3   ][Linux     ][Supported                           ]]
-[[GCC 3.4   ][Linux     ][Supported                           ]]
-[[GCC 4.0   ][Linux, Mac][Supported                           ]]
-[[GCC 4.1   ][Linux     ][Supported                           ]]
-[[GCC 4.2   ][Linux     ][Supported                           ]]
-[[ICC 8.0   ][Linux     ][Supported                           ]]
-[[ICC 9.0   ][Linux     ][Supported                           ]]
-[[ICC 9.1   ][Linux     ][Supported                           ]]
-[[GCC 4.2   ][Linux     ][Supported                           ]]
-[[GCC 4.2   ][Linux     ][Supported                           ]]
-[[VS 7.1    ][Windows   ][Supported                           ]]
-[[VS 8.0    ][Windows   ][Supported                           ]]
-[[ICC 7.1   ][Windows   ][Not Supported                       ]]
-[[ICC 8.0   ][Windows   ][Supported                           ]]
-[[ICC 9.1   ][Windows   ][Supported                           ]]
-[[CW 8.3    ][Windows   ][Not Supported                       ]]
+[[Compiler 编译器][OS Tested 测试的操作系统][State 状态]]
+[[GCC 3.3   ][Linux     ][Supported 支持]]
+[[GCC 3.4   ][Linux     ][Supported 支持]]
+[[GCC 4.0   ][Linux, Mac][Supported 支持]]
+[[GCC 4.1   ][Linux     ][Supported 支持]]
+[[GCC 4.2   ][Linux     ][Supported 支持]]
+[[ICC 8.0   ][Linux     ][Supported 支持]]
+[[ICC 9.0   ][Linux     ][Supported 支持]]
+[[ICC 9.1   ][Linux     ][Supported 支持]]
+[[GCC 4.2   ][Linux     ][Supported 支持]]
+[[GCC 4.2   ][Linux     ][Supported 支持]]
+[[VS 7.1    ][Windows   ][Supported 支持]]
+[[VS 8.0    ][Windows   ][Supported 支持]]
+[[ICC 7.1   ][Windows   ][Not Supported 不支持]]
+[[ICC 8.0   ][Windows   ][Supported 支持]]
+[[ICC 9.1   ][Windows   ][Supported 支持]]
+[[CW 8.3    ][Windows   ][Not Supported 不支持]]
 ]

 [/
@@ -43,7 +43,9 @@

 If a .cpp file uses more than four differents bimaps the compiler will run
 out of symbols and issue an internal compiler error. The official solution
-in msdn is to split the .cpp in several files or upgrade your compiler.
+in msdn is to split the .cpp in several files or upgrade your compiler.\n
+如果一个 .cpp 文件使用了四个以上不同的 bimap,编译器会将符号用完并产生一个 内部编译错误。
+官方的解决方法是,将该 .cpp 文件分割为多个文件,或者升级你的编译器。

 [h2 VS 8.0]

@@ -53,7 +55,11 @@
 But the wording of the warning is misleading and unsettling, there are no
 portable alternative functions, and VC++ 8.0's own libraries use the
 functions in question. In order to turn off the warnings add the followings
-defines at the begging of your .cpp files:
+defines at the begging of your .cpp files:\n
+VC++ 8.0 会警告在使用当前的标准库和API函数时,误用会导致缓冲区溢出或其它可 能的安全问题。 +请看 http://msdn.microsoft.com/msdnmag/issues/05/05/SafeCandC/default.aspx,不过; 该警告的用语容易令人误解, +也未详细说明,没有可移植的其它函数,且 VC++ 8.0 自己本身的库也使用了有问题 的函数。
+要关闭这些警告,要在你的 .cpp 文件中加入以下定义:

     #define _CRT_SECURE_NO_DEPRECATE
     #define _SCL_SECURE_NO_DEPRECATE
=======================================
--- /trunk/libs/bimap/doc/examples.qbk  Sun Feb  7 21:50:27 2010
+++ /trunk/libs/bimap/doc/examples.qbk  Mon Mar  8 01:27:36 2010
@@ -12,138 +12,162 @@

 [/ QuickBook Document version 1.4 ]

-[section Examples]
-
-[section Examples list]
+[section:examples Examples 示例]
+
+[section:examples_list Examples list 例子的列表]

In the folder [@../../example libs/bimap/example] you can find all the examples
-used in bimap documentation. Here is a list of them:
+used in bimap documentation. Here is a list of them:\n
+在文件夹 [@../../example libs/bimap/example] 中,你可以找到 bimap 文档中所 用的所有例子。以下是它们的列表:


-[table Tutorial examples
-[[Program ][Description ]]
+[table Tutorial examples 教程的例子
+[[Program 程序][Description 说明]]

 [[[@../../example/simple_bimap.cpp
simple_bimap.cpp ]] - [Soccer world cup example ]]
+    [Soccer world cup example\n足球世界杯的例子]]

 [[[@../../example/tagged_simple_bimap.cpp
tagged_simple_bimap.cpp ]] - [Soccer world cup example using user defined names ]] + [Soccer world cup example using user defined names\n使用用户自定义名字 的足球世界杯例子]]

 [[[@../../example/step_by_step.cpp
step_by_step.cpp ]] - [Basic example of the three views of bimap ]]
+    [Basic example of the three views of bimap\nbimap的三个视图的简单例子]]

 [[[@../../example/population_bimap.cpp
population_bimap.cpp ]] - [Countries populations, using `unordered_set_of` and `multiset_of` ]] + [Countries populations, using `unordered_set_of` and `multiset_of` \n
+    国家人口,使用 `unordered_set_of` 和 `multiset_of` ]]

 [[[@../../example/repetitions_counter.cpp
repetitions_counter.cpp ]] - [Word repetitions counter, using `unordered_set_of` and `list_of` ]] + [Word repetitions counter, using `unordered_set_of` and `list_of` \n
+    单词重复量计数,使用 `unordered_set_of` 和 `list_of` ]]

 [[[@../../example/mighty_bimap.cpp
mighty_bimap.cpp ]] - [Dictionary using `list_of_relation` ]] + [Dictionary using `list_of_relation` \n
+    字典,使用 `list_of_relation` ]]

 [[[@../../example/user_defined_names.cpp
user_defined_names.cpp ]] - [Equivalence between code with tagged and untagged code ]] + [Equivalence between code with tagged and untagged code \n
+    带标签和不带标签的相同代码]]

 [[[@../../example/standard_map_comparison.cpp
standard_map_comparison.cpp ]] - [Comparison between standard maps and bimap map views ]] + [Comparison between standard maps and bimap map views \n
+    标准 map 与 bimap 映射视图间的比较]]

 [[[@../../example/at_function_examples.cpp
at_function_examples.cpp ]] - [Functions `at(key)` and `operator[](key)` examples ]] + [Functions `at(key)` and `operator[](key)` examples \n
+    函数 `at(key)` 和 `operator[](key)` 的例子]]

 [[[@../../example/tutorial_modify_and_replace.cpp
tutorial_modify_and_replace.cpp ]] - [`modify` and `replace` examples ]] + [`modify` and `replace` examples \n
+    `modify` 和 `replace` 的例子]]

 [[[@../../example/tutorial_range.cpp
tutorial_range.cpp ]] - [`range()` tutorial ]] + [`range()` tutorial \n
+    `range()` 教程 ]]

 [[[@../../example/tutorial_info_hook.cpp
tutorial_info_hook.cpp ]] - [Additional information hooking ]] + [Additional information hooking \n
+    额外的信息挂载]]

 [[[@../../example/unconstrained_collection.cpp
unconstrained_collection.cpp ]] - [Using `unconstrained_set_of` collection type ]] + [Using `unconstrained_set_of` collection type \n
+    使用 `unconstrained_set_of` 组合类型]]
 ]


-[table Bimap and Boost examples
-[[Program ][Description ]]
+[table Bimap and Boost examples  Bimap和Boost的例子
+[[Program 程序][Description 说明]]

 [[[@../../example/bimap_and_boost/assign.cpp
assign.cpp ]] - [Bimap and Boost.Assign: Methods to insert elements ]] + [Bimap and Boost.Assign: Methods to insert elements \n
+    Bimap 和 Boost.Assign: 插入元素的方法]]

 [[[@../../example/bimap_and_boost/lambda.cpp
lambda.cpp ]] - [Bimap and Boost.Lambda: new lambda placeholders ]] + [Bimap and Boost.Lambda: new lambda placeholders \n
+    Bimap and Boost.Lambda: 新的 lambda 占位符]]

 [[[@../../example/bimap_and_boost/property_map.cpp
property_map.cpp ]] - [Bimap and Boost.PropertyMap: PropertyMap support ]] + [Bimap and Boost.PropertyMap: PropertyMap support \n
+    Bimap and Boost.PropertyMap: PropertyMap 的支持]]

 [[[@../../example/bimap_and_boost/range.cpp
range.cpp ]] - [Bimap and Boost.Range: Using bimaps in the new range framework ]] + [Bimap and Boost.Range: Using bimaps in the new range framework \n
+    Bimap and Boost.Range: 在新的区间框架中使用 bimap ]]

 [[[@../../example/bimap_and_boost/foreach.cpp
foreach.cpp ]] - [Bimap and Boost.Foreach: Iterating over bimaps ]] + [Bimap and Boost.Foreach: Iterating over bimaps \n
+    Bimap and Boost.Foreach: 遍历 bimap ]]

 [[[@../../example/bimap_and_boost/typeof.cpp
typeof.cpp ]] - [Bimap and Boost.Typeof: using BOOST_AUTO while we wait for C++0x ]] + [Bimap and Boost.Typeof: using BOOST_AUTO while we wait for C++0x \n
+    Bimap and Boost.Typeof: 在 C++0x 之前使用 BOOST_AUTO ]]

 [[[@../../example/bimap_and_boost/xpressive.cpp
xpressive.cpp ]] - [Bimap and Boost.Xpressive: Inserting elements in a bimap ]] + [Bimap and Boost.Xpressive: Inserting elements in a bimap \n
+    Bimap and Boost.Xpressive: 将元素插入到一个 bimap]]

 [[[@../../example/bimap_and_boost/serialization.cpp
serialization.cpp: ]] - [Bimap and Boost.Serialization: Load and save bimaps and iterators ]] + [Bimap and Boost.Serialization: Load and save bimaps and iterators \n
+    Bimap and Boost.Serialization: 导入和保存 bimap 及其迭代器]]
 ]


-[table Boost.MultiIndex to Boost.Bimap path examples
-[[Program ][Description ]] +[table Boost.MultiIndex to Boost.Bimap path examples 从Boost.MultiIndex到 Boost.Bimap之路的例子
+[[Program 程序][Description 说明]]

 [[[@../../example/mi_to_b_path/bidirectional_map.cpp
bidirectional_map.cpp ]] - [Boost.MultiIndex to Boost.Bimap path example ]] + [Boost.MultiIndex to Boost.Bimap path example \n
+    从 Boost.MultiIndex 到 Boost.Bimap 之路的例子]]

 [[[@../../example/mi_to_b_path/hashed_indices.cpp
hashed_indices.cpp ]] - [Boost.MultiIndex to Boost.Bimap path example ]] + [Boost.MultiIndex to Boost.Bimap path example \n
+    从 Boost.MultiIndex 到 Boost.Bimap 之路的例子]]

 [[[@../../example/mi_to_b_path/tagged_bidirectional_map.cpp
tagged_bidirectional_map.cpp ]] - [Boost.MultiIndex to Boost.Bimap path example ]] + [Boost.MultiIndex to Boost.Bimap path example \n
+    从 Boost.MultiIndex 到 Boost.Bimap 之路的例子]]

 ]

 [endsect]

-[section Simple Bimap]
-
-This is the example from the one minute tutorial section.
-
-[@../../example/simple_bimap.cpp Go to source code]
+[section:simple_bimap Simple Bimap 简单的Bimap]
+
+This is the example from the one minute tutorial section.\n
+这是来自"一分钟教程"一节的例子。
+
+[@../../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]
+You can rewrite it using tags to gain readability.\n
+你可以用标签来重写它,以增加可读性。
+
+[@../../example/tagged_simple_bimap.cpp Go to source code 察看源代码]

 [import ../example/tagged_simple_bimap.cpp]

@@ -152,22 +176,24 @@

 [endsect]

-[section Mighty Bimap]
+[section:mighty_bimap Mighty Bimap 强大的Bimap]

 This is the translator example from the tutorial.
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]
+of the container.\n
+这是来自"指南"一节的翻译器例子。在这个例子中,修改了关系组合类型以允许对容 器进行遍历。
+
+[@../../example/mighty_bimap.cpp Go to source code 察看源代码]

 [code_mighty_bimap]


 [endsect]

-[section MultiIndex to Bimap Path - Bidirectional Map]
-
-This is example 4 in Boost.MultiIndex documentation.
+[section:multiindex_to_bimap_path___bidirectional_map MultiIndex to Bimap Path - Bidirectional Map 从MultiIndex到Bimap之路 - 双向映射]
+
+This is example 4 in Boost.MultiIndex documentation.\n
+这是 Boost.MultiIndex 文档中的例4。

 [blurb
This example shows how to construct a bidirectional map with multi_index_container.
@@ -175,12 +201,16 @@
`std::pair<const FromType,const ToType>` such that no two elements exists with the same first or second value (`std::map` only guarantees uniqueness of the first member). Fast look-up is provided for both keys. The program features a tiny Spanish-English
-dictionary with on-line query of words in both languages.
+dictionary with on-line query of words in both languages.\n
+这个例子示范了如何用 multi_index_container 构造一个双向映射。我们将双向映射 视为一个元素为 +`std::pair<const FromType,const ToType>` 的容器,没有两个元素具有相同的 first 或 second 值 +(`std::map` 只保证 first 成员的唯一性)。它提供了基于两个键的快速查找。该程 序实现了一个小的西班牙语-英语词典,
+可以在线查找两种语言的单词。
 ]

 [heading Boost.MultiIndex]

-[@../../example/mi_to_b_path/mi_bidirectional_map.cpp Go to source code]
+[@../../example/mi_to_b_path/mi_bidirectional_map.cpp Go to source code 察 看源代码]

 [import ../example/mi_to_b_path/mi_bidirectional_map.cpp]

@@ -188,15 +218,16 @@

 [heading Boost.Bimap]

-[@../../example/mi_to_b_path/bidirectional_map.cpp Go to source code]
+[@../../example/mi_to_b_path/bidirectional_map.cpp Go to source code 察看源 代码]

 [import ../example/mi_to_b_path/bidirectional_map.cpp]

 [code_mi_to_b_path_bidirectional_map]

-Or better, using tags...
-
-[@../../example/mi_to_b_path/tagged_bidirectional_map.cpp Go to source code]
+Or better, using tags...\n
+或者更好一点,使用标签...
+
+[@../../example/mi_to_b_path/tagged_bidirectional_map.cpp Go to source code 察看源代码]

 [import ../example/mi_to_b_path/tagged_bidirectional_map.cpp]

@@ -204,19 +235,21 @@

 [endsect]

-[section MultiIndex to Bimap Path - Hashed indices]
-
-This is example 8 of Boost.MultiIndex.
+[section:multiindex_to_bimap_path___hashed_indices MultiIndex to Bimap Path - Hashed indices 从MultiIndex到Bimap之路 - 散列索引]
+
+This is example 8 of Boost.MultiIndex.\n
+这是 Boost.MultiIndex 的例8。

 [blurb
Hashed indices can be used as an alternative to ordered indices when fast look-up is needed and sorting information is of no interest. The example features a word counter where duplicate entries are checked by
-means of a hashed index.
+means of a hashed index.\n
+当需要快速查找且不关心排序信息时,可以用散列索引来替代有序索引。这个例子实 现了一个单词计数器,使用散列索引来检查重复项。
 ]

 [heading Boost.MultiIndex]

-[@../../example/mi_to_b_path/mi_hashed_indices.cpp Go to source code]
+[@../../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 +257,7 @@

 [heading Boost.Bimap]

-[@../../example/mi_to_b_path/hashed_indices.cpp Go to source code]
+[@../../example/mi_to_b_path/hashed_indices.cpp Go to source code 察看源代 码]

 [import ../example/mi_to_b_path/hashed_indices.cpp]

=======================================
--- /trunk/libs/bimap/doc/future_work.qbk       Sun Feb  7 21:50:27 2010
+++ /trunk/libs/bimap/doc/future_work.qbk       Mon Mar  8 01:27:36 2010
@@ -12,12 +12,13 @@

 [/ QuickBook Document version 1.4 ]

-[section Future work]
+[section:future_work Future work 未来的工作]


-[heading Rearrange Function]
-
-Boost.MultiIndex includes some others functions that can be included in the views.
+[heading Rearrange Function 重排函数]
+
+Boost.MultiIndex includes some others functions that can be included in the views.\n
+Boost.MultiIndex 所含的一些其它函数,也可以包含到视图中。


 [endsect]
=======================================
--- /trunk/libs/bimap/doc/history.qbk   Sun Feb  7 21:50:27 2010
+++ /trunk/libs/bimap/doc/history.qbk   Mon Mar  8 01:27:36 2010
@@ -12,12 +12,12 @@

 [/ QuickBook Document version 1.4 ]

-[section History]
-
-[section The long path from Code Project to Boost]
+[section:history History 历史]
+
+[section:the_long_path_from_code_project_to_boost The long path from Code Project to Boost 从代码项目到Boost的漫长路程 ]

 [variablelist
-[[2002 - bimap at Code Project]
+[[2002 - bimap at Code Project 在代码项目中的bimap]
 [
 Joaquin Lopez Muñoz posted his first
 [@http://www.codeproject.com/vcpp/stl/bimap.asp#test_suite bimap library]
@@ -27,7 +27,11 @@
 interest and Joaquin started to boostify the code. At some point all the
 developers seemed to agree that, rather than a bidirectional map, it would
 be better to work on an N-indexed set that contained Joaquin's library as a
-particular case.
+particular case.\n
+Joaquin Lopez Muñoz 在2002年贴出了他第一个 [@http://www.codeproject.com/vcpp/stl/bimap.asp#test_suite bimap 库]。 +大量用户开始使用它。接着他在2003年 [@http://aspn.activestate.com/ASPN/Mail/Message/boost/1404881 出于兴趣询问了 列表]。 +幸运的是,引趣了很多人的兴趣,Joaquin 开始推进他的代码。在某个时刻,似乎所 有用户都同意, +构建一个N个索引的集合而不是一个双向映射是更好的选择,它应该将 Joaquin 的库 作为一个特例而包含在内。
 ]]

 [[2003 - multiindex_set]
@@ -35,7 +39,9 @@
 The library grew enormously and was ready for a formal review in
 2003. At this point, the container was a lot more powerful, but
 everything comes with a price and this new beast lacked the simplicity
-of the original bimap.
+of the original bimap.\n
+这个库得到了非常大的成长,在2003年准备进行正式审查。这个时候,这个容器非常 强大,
+但任何事情都是有代价的,其缺点是没有了原来 bimap 的简单性。
 ]]

 [[2004 - indexed_set]
@@ -44,7 +50,9 @@
 container. This Swiss army knife introduced several new features, such
 as non-unique indexes, hashed indices and sequenced indices. In the list
 of improvements to the library, it was mentioned that a bidirectional
-map should be coded in top of this container.
+map should be coded in top of this container.\n
+在2004年,对于多索引容器的正式审查结束了。这把瑞士军刀引入了几个新特性,如 非唯一索引、散列索引和序列索引。
+在这个库的改进列表中,提及了双向映射应该在这个容器的基础之上进行编码。
 ]]

 [[2005 - multi_index_container]
@@ -52,7 +60,9 @@
 Once in Boost, the library switched to the now familiar name
 "Boost.MultiIndex". Late in 2004, it formally became a member of Boost.
 Joaquin continued to enchance the library and added new features such as
-composite keys and random-access indices.
+composite keys and random-access indices.\n
+进入 Boost 后,这个库换成现在的名字 "Boost.MultiIndex"。在2004年后期,它正 式成为了 Boost 的成员。
+Joaquin 继续对库进行加强,增加了象组合键、随机访问索引等新特性。
 ]]

 [[2006 - Multi Index Specialized Containers SoC project]
@@ -66,13 +76,19 @@
 for the SoC and was elected, along with nine other students. Matias's and
 Joaquin's SoC project ends with a working implementation of the bimap
 library that was presented in an informal review. By the end of the year
-the library was queued for a formal review.
+the library was queued for a formal review.\n
+2006 年,在 Boost.Property_tree 的正式审查过程中,基于 Boost.MultiIndex 构 建一个双向映射容器的需求被再次提及。 +同一时间,Boost 作为一个导师组织进入了 Google SoC 2006。Joaquin 推举自己成 为导师。
+他提议要构建的不应仅仅是一个双向映射,而且应该是一个多索引的专用容器。
+Matias Capeletto 提出为 SoC 引入 Boost.Misc 并被推举,同时还有另个九个学 生。 +Matias 和 Joaquin 的 SoC 项目以 bimap 库的实现并进入正式审查而结束。到当年 年底,该库等待进入正式审查。
 ]]

 [[2007 - Boost.Bimap]
 [
 The formal review took place at the beggining of the year and Boost.Bimap
-was accepted in Boost.
+was accepted in Boost.\n
+正式审查在年初开始,Boost.Bimap 被接受进入 Boost。
 ]]
 ]

@@ -83,19 +99,23 @@
 This is the conversation thread that began during Boost.PropertyTree formal
 review process. The review was very interesting and very deep topics were
addressed. It is quite interesting and it is now part of this library history.
-Enjoy!
+Enjoy!\n
+这是在 Boost.PropertyTree 的正式审查过程中开始的一系列对话。这个审查非常有 趣,而且谈及了非常深刻的话题。
+它很有趣,而且现在已成为本库历史的一部分。希望你喜欢!


 [*Marcin]
 [:['
 The biggest virtue of property_tree is easy to use interface.
-If we try to make generic tree of it, it will be compromised.
+If we try to make generic tree of it, it will be compromised.\n
+property_tree 最大的优点是它易于使用的接口。如果我们将它变为泛化的树,它将 会受到损害。
 ]]

 [*Gennadiy]
 [:['
 IMO the same result (as library presents) could be achieved
-just by using multi_index.
+just by using multi_index.\n
+在我看来,只使用 multi_index 也能得到同样的效果(正如现在的库)。
 ]]

 [*Marcin]
@@ -104,7 +124,9 @@
 multi_index to implement indexing for properties, but it only affected the
 implementation part of library, not interface, and because I already had a
working, exception safe solution, I didn't see the reason to dump it and add
-another dependency on another library.
+another dependency on another library.\n
+你能否更详细地说明一下?我考虑过使用 multi_index 来实现属性的索引,但它只对 库的实现部分有影响, +对接口是没有影响的,所以我已经开始着手了一个异常安全的方法,我看不到有什么 理由放弃它并增加对另一个库的依赖。
 ]]

 [*Gennadiy]
@@ -113,11 +135,14 @@
 data structure? Property tree supports nothing in itself. It's just a data
structure. You have parsers that produce property tree out of different sources. But you mat as well produce maps or something else. Here for example All that
-I need to do to "implement" similar functionality as your property tree:
+I need to do to "implement" similar functionality as your property tree:\n
+我的意思是,为什么我需要这个半成品的 property_tree 作为另一个数据结构?属性 树本身并不支持什么。 +它只是一个数据结构。你有解析器从不同来源生成属性树。但你倒不如生成映射或其 它别的东西。
+这有一个例子,我所需要做的就是"实现"和你的属性树所类似的功能:
 ]]

 ``
-// Data structure itself
+// Data structure itself 数据结构本身
 template<typename ValueType,typename KeyType>
 struct Node;
 template<typename ValueType,typename KeyType>
@@ -130,7 +155,7 @@
     ValueType v;
     ptree_gen<ValueType,KeyType>::type children;
 };
-// serialization support
+// serialization support 序列化支持
 template<class Archive,typename ValueType,typename KeyType>
 void serialize(Archive & ar, Node<ValueType,KeyType>& n,
                const unsigned int version)
@@ -138,7 +163,7 @@
     ar & n.v;
     ar & n.children;
 }
-// some access methods
+// some access methods 一些访问方法
 template<typename ValueType,typename KeyType>
 ValueType const&
 get( string const& keys, ptree_gen<ValueType,KeyType>::type const& src )
@@ -150,7 +175,8 @@
 ``

 [:['
-Use it like this:
+Use it like this:\n
+它的用法如下:
 ]]

 ``
@@ -162,13 +188,15 @@

 [:['
 Now tell me how property_tree interface is easier? And what is the value in
-50k of Code you need to implement this data structure.
+50k of Code you need to implement this data structure.\n
+现在请告诉我,property_tree 的接口如何更易用?你要用50k代码来实现这个数据结 构有什么价值。
 ]]

 [*Thorsten]
 [:['
 Seriously Gennadiy, do you really see newbies writing
-the code you just did?
+the code you just did?\n
+认真的 Gennadiy,你真的看不出你刚才所做的是新手写的代码?
 ]]

 [*Marcin]
@@ -182,14 +210,20 @@
 smooth rough edges in the interface. Then write tests. Write docs. At the
 end, I believe you will not get much less code than there is in the library
 already. Maybe you get some savings by using multi_index instead of manual
-indexing.
+indexing.\n
+你刚才所写是剪下来的 property_tree 的骨干版本,不允许你生成用户可编辑的 XML 文件。 +现在已增加了更多的接口(如 get 函数),为序列化库增加了更多存档格式,增加客户 化,增加了从字符串的透明转换及相反操作。 +你先花了几周来让所有极端的案例正确运行,还有几周用于试图把接口边界变平滑。 然后编写测试,编写文档。 +最后,我相信你不会得到比本库更少的代码。也许你会用 multi_index 替代手工索引 来节省一些代码。
 ]]
 [:['
 The reason why ptree does not use multi index is because implementation
existed long before I considered submitting to boost, probably before even I
 knew of multi index existence. It was working well. Later, when I was
 improving it during pre-review process, I seriously considered using
-multi-index. But I decided it is not worth throwing everything out.
+multi-index. But I decided it is not worth throwing everything out.\n
+ptree 不使用 multi index 的原因是,因为在我考虑将它提交到 boost 之前很久该 实现就已经存在了,甚至可能是在我知道有 multi index 之前。 +它工作得很好。以后当我在预审查过程中对它进行改进时,我会认真考虑使用 multi-index。但我认为不值得抛弃所有一切。
 ]]
 [:['
 Although ptree has large interface with many functions modifying state of
@@ -199,36 +233,48 @@
 lines of code in case of insert, and (by coincidence) also 9 in case of
 erase. By using multi index these functions would obviously be simplified,
maybe to 4 lines each. Net gain: 10 lines of code (out of several hundred in
-ptree_implementation.hpp).
+ptree_implementation.hpp).\n
+虽然 ptree 带有很大的接口,它有很多函数来修改树的状态,它使用了 "单点修改" 方法。 +每个插入最终都通过一个函数完成,该函数考虑了异常安全性,并保持数据和索引的 同步。 +对于删除也一样。这个函数有9行代码用于插入,同样也有9行用于删除。通过使用 multi index,这些函数可以明显简化,也许每个只要4行。
+净收益:10行代码(相对于 ptree_implementation.hpp 的几百行代码)。
 ]]
 [:['
I'm aware that there are performance gains to be reaped as well, but at that
-time I was rather focusing on getting the interface right.
+time I was rather focusing on getting the interface right.\n
+我知道还可以获得性能的提升,但是当时我只关注于接口的正确性。
 ]]

 [*Dave]
 [:['
 That's perfectly reasonable, but (through no fault of yours)
 it misses the point I was trying to make.  I guess I should have said,
-"...that demonstrates it to be the best implementation."
+"...that demonstrates it to be the best implementation."\n
+这是完全合理的,但是(这不是你的错)它误会了我的观点。我想我应该说, "...这表 示它是最好的实现。"
 ]]
 [:['
 All I'm saying is that the extent to which a Boost library
 implementation should leverage other Boost libraries is not a question
 that can always be decided based on following simple guidelines, and
-that if this library is accepted, it's worth revisiting your decision.
+that if this library is accepted, it's worth revisiting your decision.\n
+我要说的是,一个 Boost 库的实现的程度应该促进其它的 Boost 库,这不是一个问 题, +它应该基于以下的简单指引来决定,如果这个库是被接受的,就值得重新审视你的决 定。
 ]]

 [*Thorsten]
 [:['
 I think it is important to focus on the interface in
the review, but I also see several benefits of an implementation that builds on
-Boost.MultiIndex:'
+Boost.MultiIndex:'\n
+我想在审查中,重要的是关注接口,但是我也看到了用 Boost.MultiIndex 来构建的 几个优点:
 ]]
-[:['- fewer bugs like the one Joaquin found]]
-[:['- better space efficiency]]
+[:['- fewer bugs like the one Joaquin found\n
+- 更少的缺陷,象 Joaquin 发现的那个]]
+[:['- better space efficiency\n
+- 更好的空间效率]]
 [:['- exception-safety guarantees are immediately full-filled (I haven't
-looked, but I suspect that there are several bugs in this area)]]
+looked, but I suspect that there are several bugs in this area)\n
+- 异常安全性保证可以立即满足(我还没有看过,但我怀疑在这方面存在一些缺陷)]]

 [*Daniel]
 [:['
@@ -237,7 +283,10 @@
 if we get one, but I would happily use property_tree. I've also only
 used multi_index once, and that was to use it as a bidirectional map.
 Property_tree covers other areas as well as being a potential subset of
-an XML library, but I still hold there is value in such a subset.
+an XML library, but I still hold there is value in such a subset.\n
+Multi_index 支持 bimap 所要的任何东西,但它的接口太过笨重。我不会使用一个 象 W3DOM 那样的库, +但是我会很高兴使用 property_tree。我也只用过 multi_index 一次,是把它用作一 个双向映射。 +Property_tree 涵盖了其它方面,并作为一个 XML 库的潜在子集,但我仍然认为这样 的子集是有价值的。
 ]]

 [*Boris]
@@ -245,12 +294,15 @@
 I haven't used program_options yet. But if I understand
 correctly both libraries seem to support storing and accessing data with
strings that might describe some kind of hierarchy. This seems to be the core
-idea of both libraries - is this correct?
+idea of both libraries - is this correct?\n
+我还没有用过 program_options。但如果我的理解是正确的,这两个库似乎都支持以 可能描述了某种层次的字符串来保存和访问数据。
+这似乎是这两个库的核心理念 - 这是正确的吗?
 ]]
 [:['
 Then it wouldn't matter much what container is used. However a generic tree
 which can store data hierarchically probably makes most sense. If I
-understand correctly both libraries could make use of such a class?
+understand correctly both libraries could make use of such a class?\n
+那么它并不比已经使用的容器多些什么?一般的树都可以按层次存储数据,可能更有 意义。如果我理解得正确的话,是否两个库都可以利用这样的类?
 ]]

 [*Marcin]
@@ -260,7 +312,9 @@
implementation, and generally of little interest to users. The biggest value
 of property_tree is in its easy to use interface, that should not be
 compromised, if at all possible. I have been already reassured in this view
-by quite many people who took their time to review the library.
+by quite many people who took their time to review the library.\n
+我觉得通用的树容器是另一个库的原材料。property_tree 是否应该基于它,是一个 内部实现的问题,通常用户不感兴趣。 +property_tree 的最大价值是它容易使用的接口,如果可能的话,这不应被损害。我 已经从花时间来审查本库的多数人中得到保证。
 ]]

 [*Boris]
@@ -270,7 +324,9 @@
algorithms etc. instead of having a C++ standard with hundreds of components which are tailored for specific needs, collaborate with only a handful of other
 components and think they provide an easy-to-use interface while all the
-easy-to-use interfaces make the whole standard less easy-to-use.
+easy-to-use interfaces make the whole standard less easy-to-use.\n
+我尝试从大的方面来看:我宁愿要一个基于少量著名概念如容器、迭代器、算法等的 C++标准, +而不要一个有数百个特定需要的组件、只有少数组件可以合作的C++标准,每个组件应 提供易用的接口而所有易用的接口可以使整个标准易于使用。
 ]]
 [:['
 That said I have used your property tree library myself to read and write a
@@ -279,7 +335,10 @@
iterator. For now I will definitely use your property tree library but would appreciate if existing concepts were reused many C++ developers are familiar
 with. My opinion is that your library should be a part of Boost but should
-be more generalized in the future.
+be more generalized in the future.\n
+我用过你的 property tree 库来读写一个配置文件。它确实很容易使用。但是,如果 它具有我已知的某些东西,如迭代器,的话,会更易用。 +现在,我一定会使用你的 property tree 库,但是如果能够复用已有的、为广大 C++开发者所熟悉的概念,就更好了。
+我的意见是,你的库应该成为 Boost 的一部分,但是在以后应该更为通用。
 ]]

 [*Thorsten]
@@ -287,32 +346,38 @@
 Well, I think we need both. Boost.MultiIndex is a great
library and can do all kinds of wonderful things. But I would still like to see
 a bidirectional map (boost::bimap) written as a wrapper around it to
-get an easy and specialized interface.
+get an easy and specialized interface.\n
+好的,我想我们两个都需要。Boost.MultiIndex 是一个强大的库,可以做各种奇妙的 事情。 +但是我也想看到一个双向映射(boost::bimap),作为它的一个包装器,具有易用和特 化的接口。
 ]]

 [*Pavel]
 [:['
-Bimap is available in libs/multi-index/examples/bimap.cpp.
+Bimap is available in libs/multi-index/examples/bimap.cpp.\n
+Bimap 已在 libs/multi-index/examples/bimap.cpp 下。
 ]]

 [*Thorsten]
 [:['
 Right, but the real value comes when somebody designs a nice
-STL-like interface and write docs etc, at least that was my point.
+STL-like interface and write docs etc, at least that was my point.\n
+好的,但只有当有人设计了一个类似于STL的接口并且写出文档时,才有真正的价 值,至少我是这么认为。
 ]]

 [*Dave]
 [:['
 IMO Thorsten is exactly right.  This is precisely the sort of
 thing that could be added to the library as part of its ongoing maintenance
-and development (without review, of course).
+and development (without review, of course).\n
+在我看来,Thorsten 是对的。正是这些东西可以加入到库中,作为维护和开发的一部 分(当然无需审查)。
 ]]

 [*Joaquin]
 [:['
 Thorsten, we have talked about this privately in the past,
but I feel like bringing it to the list in the hope of getting the attention
-of potential contributors:
+of potential contributors:\n
+Thorsten, 过去我们已经私下讨论这一点,我想把它放到列表中,希望得到潜在的贡 献者的关注:
 ]]
 [:['
 There are some data structures buildable with B.MI which are regarded as
@@ -320,7 +385,10 @@
 bimap. A lean and mean implementation is provided in the aforementioned
 example, but certainly a much carefully crafted interface can be provided
 keeping B.MI as the implementation core: operator\[\], selection of
-1-1/1-N/N-1/N-N variants, hashing/ordering, etc.
+1-1/1-N/N-1/N-N variants, hashing/ordering, etc.\n
+有些可以用 B.MI 构建的数据结构被认为是特别有用或通用的,例如双向映射或 bimap。 +在上述例子中提供了一个精简的实现,但是无疑,可以提供一个精心制作的接口并以 B.MI 作为实现核心:
+operator\[\], 1-1/1-N/N-1/N-N 多种选择,散列/排序,等等。
 ]]
 [:['
 I'm afraid I don't have the time to pursue this, as the current roadmap for
@@ -329,61 +397,77 @@
can develop this and other singular containers using B.MI (a cache container
 comes to mind) and then propose the results here either as a stand alone
 library of as part of B.MI --I'd prefer the former so as to keep the size
-of B.MI bounded.
+of B.MI bounded.\n
+我恐怕没有时间去追求这一点,因为当前的 B.MI 核心特性的路线图已经占据了我可 以奉献给本库的所有空闲时间。 +因此,我希望看到有一些志愿者可以参与开发本库和其它使用 B.MI 的特定容器(正在 考虑一个缓冲容器),然后给出结果, +无论是作为一个独立的库还是 B.MI 的一部分 -- 我宁愿选择前者,以保持 B.MI 的 边界大小。
 ]]
 [:['
If there's such a volunteer I can provide her with some help/mentoring. I also
 wonder whether this is a task suitable to be proposed for Google Summer of
-Code.
+Code.\n
+如果有这样的志愿者,我可以提供一些帮助/指导。我想知道这个任务是否适合作为 Google Summer of Code 的提议。
 ]]

 [*Thorsten]
 [:['
 I think it would be good for SOC. All the really hard things
are taken care of by B.MI, and so it seems reasonable for a student to be able
-to fill in the details.
+to fill in the details.\n
+我想它作为 SOC 不错。所有较困难的事情由 B.MI 负责,所以它看来比较适合让学生 来填补细节。
 ]]

 [*Dave]
 [:['
-Great!
+Great!\n
+不错!
 ]]

 [*Jeff]
 [:['
-Please write a proposal!
+Please write a proposal!\n
+请写一个建议书!
 ]]

 [*Joaquin]
 [:['
-I've just done so:
+I've just done so:\n
+我已经写了一个:
 ]]

-[blurb *Specialized containers with Boost.MultiIndex*
-
-    *Introduction*
+[blurb *Specialized containers with Boost.MultiIndex 由Boost.MultiIndex构建 的专用容器*
+
+    *Introduction 简介*

Boost.MultiIndex allows the construction of complex data structures involving
     two or more indexing mechanisms on the same set of elements. Out of the
     unlimited range of possible data structures specifiable within
-    Boost.MultiIndex, some particular configurations arise recurrently:
+    Boost.MultiIndex, some particular configurations arise recurrently:\n
+ Boost.MultiIndex 可以构造出复杂的数据结构,在同一组元素中包含两个或以上 的索引机制。 + 虽然在 Boost.MultiIndex 中可以指定不受限制的各种可能的数据结构,但是有 些特定的配置经常反复出现:

*a.* A bidirectional map or bimap is a container of elements of type pair<T,Q>
     where fast look up is provided both for the T and the Q field,
- in contrast with a regular STL map which only allows for fast look up on T. + in contrast with a regular STL map which only allows for fast look up on T.\n + *a.* 双向映射或 bimap 是一种元素类型为 pair<T,Q> 的容器,它提供了按 T 和 Q 字段的快速查找,
+    而普通的 STL map 只允许按 T 进行快速查找。

*b.* An MRU (most recently used) list keeps the n last referenced elements: when a new item is inserted and the list has reached its maximum length, the oldest element is erased, whereas if an insertion is tried of a preexistence element, this gets promoted to the first position. MRU lists can be used to
     implement dynamic caches and the kind of behavior exhibited by programs
-    featuring a "Recent files" menu command, for instance.
+    featuring a "Recent files" menu command, for instance.\n
+ *b.* MRU (最近最常使用)列表可以保持最后引用的 n 个元素:当插入一个新元 素而列表已达到最大长度时, + 最旧的元素被删除,但是如果插入的是已存在的元素,则将它提升到第一个位 置。
+    MRU 列表可用于实现动态缓冲以及象程序中的"最近使用的文件"此类功能。

Although Boost.MultiIndex provides the mechanisms to build these common structures, the resulting interface can be cumbersome and too general in comparison with
-    specialized containers focusing on such particular structures.
-
-    *Goal*
+    specialized containers focusing on such particular structures.\n
+ 虽然 Boost.MultiIndex 提供了构建这些常用结构的机制,但是所得到的接口非 常笨重,与这些特定容器所关注的这些特定结构相比也过于通用。
+
+    *Goal 目标*

To write a library of specialized containers like the ones described above, using Boost.MultiIndex as the implementation core. Besides bimap and MRU list, the student
@@ -392,37 +476,50 @@
eventual inclusion in this project, which implies a strong emphasis on interface design, documentation and unit testing; the mentor will be guiding the student through the complete cycle from specification and requirements gathering to - documentation and actual coding. The final result of the project must then contain: + documentation and actual coding. The final result of the project must then contain:\n + 编写一个如上所述的专用容器库,用 Boost.MultiIndex 作为实现核心。除了 bimap 和 MRU 列表以外,学生还可以提议其它感兴趣的专用容器。 + 我们希望这个库符合 Boost 所要求的质量标准,最后有可能将该库纳入 Boost,这意味着对接口设计、文档和单元测试的特别强调; + 导师将在整个开发周期中指导学生,从规格和需求收集到文档和具体编码。本项 目的最终结果必须包含:

     *a.* Source code following
- [@http://boost.org/more/lib_guide.htm#Guidelines Boost programming guidelines]. + [@http://boost.org/more/lib_guide.htm#Guidelines Boost programming guidelines].\n + *a.* 符合 [@http://boost.org/more/lib_guide.htm#Guidelines Boost编程指 引] 的源代码。

*b.* User documentation. Requirements on the format are loose, though the [@http://www.boost.org/tools/quickbook/doc/html/index.html QuickBook] format is
-    gaining acceptance within Boost.
+    gaining acceptance within Boost.\n
+ *b.* 用户文档。对格式的要求较松,不过 [@http://www.boost.org/tools/quickbook/doc/html/index.html QuickBook]
+    格式在 Boost 内部是广为接受的。

     *c.* Complete set of unit tests powered by
-    [@http://boost.sourceforge.net/boost-build2/ Boost Build System V2].
-
-    *Requirements*
+    [@http://boost.sourceforge.net/boost-build2/ Boost Build System V2].\n
+ *c.* 可用于 [@http://boost.sourceforge.net/boost-build2/ Boost Build System V2] 的完整的单元测试集。
+
+    *Requirements 要求*

*a.* Intermediate-to-high level in C++, with emphasis in generic programming
-    (templates).
+    (templates).\n
+    *a.* C++水平为中至高级,在泛型编程(模板)方面较强。

*b.* Knowledge of the STL framework and design principles. Of course, knowledge
-    of Boost in general and Boost.MultiIndex in particular is a big plus.
-
- *c.* Acquaintance with at least two different C++ programming environments.
+    of Boost in general and Boost.MultiIndex in particular is a big plus.\n
+ *b.* 熟悉STL框架和设计原理。当然熟悉 Boost 尤其是 Boost.MultiIndex 就更 好了。
+
+ *c.* Acquaintance with at least two different C++ programming environments.\n
+    *c.* 至少熟悉两个不同的C++编程环境。

*d.* Some fluency in the English language; subsequent reviews of the documentation
-    can help smooth rough edges here, though.
+    can help smooth rough edges here, though.\n
+    *d.* 流利的英语;不过后续的文档审查可以有所帮助。

*e.* A mathematical inclination and previous exposure to a formal Algorithms course
-    would help very much.
-
-    *f.* A craving for extreme quality work.
-
-    *Benefits for the student*
+    would help very much.\n
+    *e.* 爱好数学,以前接触过正式的算法课程会有很大帮助。
+
+    *f.* A craving for extreme quality work.\n
+    *f.* 追求高质量的工作。
+
+    *Benefits for the student 对学生的好处*

The student taking on this project will have the opportunity to learn the complete process of software production inside a highly regarded C++ open source institution,
@@ -430,17 +527,22 @@
involves non-trivial problems in C++ interface design and so-called modern C++ programming, high quality user documentation and unit testing. The student will also learn, perhaps to her surprise, that most of the time will be spent gathering - and trying ideas and, in general, thinking, rather than writing actual code. + and trying ideas and, in general, thinking, rather than writing actual code.\n + 参与这一项目的学生,将有机会学习在一个高度重视C++开源的机构中进行软件生 产的完整过程,甚至最终会在 Boost 中见到自己的作品。 + 完成这个项目包括在C++接口设计中的一些不简单的问题,以及所谓的现代C++编 程,还有高质量的用户文档和单元测试。 + 学生可能会惊讶,他还将学到大部分时间将用于收集和尝试各种思路,通常来说 是思考而不是实际编写代码。
 ]

 [*Matias]
 [:['
 I am planning to submit an application to SoC. I will love to make real
-the specialized containers you mention and try to include some useful others. +the specialized containers you mention and try to include some useful others.\n +我正计划将它提交到 SoC. 我希望你所提到的专用容器成为真实,并尝试加入一些有 用的其它东西。
 ]]

 [:[^
-And then... after long hours of coding (and fun) this library saw the light. +And then... after long hours of coding (and fun) this library saw the light.\n
+然后... 在长时间的编码(和乐趣)后,这个库看到了光明。
 ]]

 [:__BOOST_BIMAP_LOGO__]
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/acknowledgements.html Sun Feb 7 21:50:27 2010 +++ /trunk/libs/bimap/doc/html/boost_bimap/acknowledgements.html Mon Mar 8 01:27:36 2010
@@ -1,28 +1,29 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Acknowledgements</title><link rel="stylesheet" href="../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Acknowledgements &#40483;&#35874;</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="up" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="prev" href="history/multiindex_and_bimap.html" title="MultiIndex and Bimap"></head> -<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="history/multiindex_and_bimap.html" title="MultiIndex and Bimap">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../index.html">Home</a></td>
 <td align="center"><a href="../../../../libraries.htm">Libraries</a></td>
-<td align="center"><a href="http://www.boost.org/users/people.htm";>People</a></td> -<td align="center"><a href="http://www.boost.org/users/faq.htm";>FAQ</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a>
 </div>
-<div class="section" title="Acknowledgements">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both;">
-<a name="boost_bimap.acknowledgements"></a><a class="link" href="acknowledgements.html" title="Acknowledgements">Acknowledgements 鸣谢 </a>
+<div class="section" lang="en">
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_bimap.acknowledgements"></a><a class="link" href="acknowledgements.html" title="Acknowledgements &#40483;&#35874;"> Acknowledgements &#40483;&#35874;</a>
 </h2></div></div></div>
 <p>
This library was developed in the context of the Google SoC 2006. I first want
@@ -70,7 +71,7 @@
       a lot to Ion Gaztañaga for managing the review.
     </p>
 <a name="boost_bimap.acknowledgements.boost_bimap_team"></a><h4>
-<a name="id2755679"></a>
+<a name="id5011844"></a>
<a class="link" href="acknowledgements.html#boost_bimap.acknowledgements.boost_bimap_team">Boost.Bimap Team</a>
     </h4>
 <p>
@@ -83,16 +84,17 @@
       Luckily, the distance helps team members avoid eating each other.
     </p>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html Mon Mar 8 01:27:36 2010
@@ -1,29 +1,31 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Dependencies</title><link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Dependencies &#20381;&#36182;&#24615;</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
 <link rel="up" href="../bimap_and_boost.html" title="Bimap and Boost">
-<link rel="prev" href="boost_libraries_that_work_well_with_boost_bimap.html" title="Boost Libraries that work well with Boost.Bimap">
-<link rel="next" href="../reference.html" title="Reference"></head>
-<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../../boost.png" height="86" width="277"></td> +<link rel="prev" href="boost_libraries_that_work_well_with_boost_bimap.html" title="Boost Libraries that work well with Boost.Bimap &#21487;&#20197;&#19982;Boost.Bimap&#20849;&#21516;&#20351;&#29992;&#30340;Boost&#24211;"> +<link rel="next" href="../reference.html" title="Reference &#21442;&#32771;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libraries.htm">Libraries</a></td> -<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.bimap_and_boost.dependencies"></a><a class="link" href="dependencies.html" title="Dependencies">Dependencies 依赖性</a> +<a name="boost_bimap.bimap_and_boost.dependencies"></a><a class="link" href="dependencies.html" title="Dependencies &#20381;&#36182;&#24615;"> Dependencies
+      &#20381;&#36182;&#24615;</a>
 </h3></div></div></div>
 <p>
Boost.Bimap is built on top of several Boost libraries. The rationale behind
@@ -31,28 +33,33 @@
The libraries used are well-established and have been tested extensively, making this library easy to port since all the hard work has already been done. The glue that holds everything together is Boost.MPL. Clearly Boost.MultiIndex
-        is the heart of this library.</p><p>Boost.Bimap
-是构建在几个 Boost 库之上的。这一决定的原理是要通过重用已有代码将 Boost
-的代码基保持为最小。被使用的库都是已确定和广泛测试的,以保证本库可以很容易 地被移植,所有艰难的工作已经完成过了。将所有东西粘合起来的是
-Boost.MPL。显然 Boost.MultiIndex 则是本库的核心。
+ is the heart of this library.<br> Boost.Bimap &#26159;&#26500;&#24314;&#22312;&#20960;&#20010; Boost + &#24211;&#20043;&#19978;&#30340;&#12290;&#36825;&#19968;&#20915;&#23450;&#30340;&#21407;&#29702;&#26159;&#35201;&#36890;&#36807;&#37325;&#29992;&#24050;&#26377;&#20195;&#30721;&#23558; Boost + &#30340;&#20195;&#30721;&#22522;&#20445;&#25345;&#20026;&#26368;&#23567;&#12290; &#34987;&#20351;&#29992;&#30340;&#24211;&#37117;&#26159;&#24050;&#30830;&#23450;&#21644;&#24191;&#27867;&#27979;&#35797;&#30340;&#65292;&#20197;&#20445;&#35777;&#26412;&#24211;&#21487;&#20197;&#24456;&#23481;&#26131;&#22320;&#34987;&#31227;&#26893;&#65292;&#25152;&#26377;&#33392;&#38590;&#30340;&#24037;&#20316;&#24050;&#32463;&#23436;&#25104;&#36807;&#20102;&#12290; + &#23558;&#25152;&#26377;&#19996;&#35199;&#31896;&#21512;&#36215;&#26469;&#30340;&#26159; Boost.MPL&#12290;&#26174;&#28982; Boost.MultiIndex &#21017;&#26159;&#26412;&#24211;&#30340;&#26680;&#24515;&#12290;
       </p>
 <div class="table">
-<a name="id2673350"></a><p class="title"><b>Table&nbsp;1.4.&nbsp;Boost Libraries needed by Boost.Bimap</b></p><p class="title"><b>表 1.4. Boost.Bimap 所需要的 Boost 库</b></p> -<div class="table-contents"><table class="table" summary="Boost Libraries needed by Boost.Bimap">
-<colgroup><col><col><col></colgroup>
+<a name="id4900327"></a><p class="title"><b>Table 1.4. Boost Libraries needed by Boost.Bimap Boost.Bimap&#25152;&#38656;&#35201;&#30340;Boost&#24211;</b></p> +<div class="table-contents"><table class="table" summary="Boost Libraries needed by Boost.Bimap Boost.Bimap&#25152;&#38656;&#35201;&#30340;Boost&#24211;">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
 <thead><tr>
 <th>
             <p>
-              Name 名字</p>
+              Name &#21517;&#23383;
+            </p>
             </th>
 <th>
             <p>
-              Description 说明
+              Description &#35828;&#26126;
             </p>
             </th>
 <th>
             <p>
-              author作者
+              author &#20316;&#32773;
             </p>
             </th>
 </tr></thead>
@@ -65,7 +72,7 @@
             </td>
 <td>
             <p>
- Containers with multiple STL-compatible access interfaces</p><p>具有多个STL兼容的访问接口的容器 + Containers with multiple STL-compatible access interfaces<br> &#20855;&#26377;&#22810;&#20010;STL&#20860;&#23481;&#30340;&#35775;&#38382;&#25509;&#21475;&#30340;&#23481;&#22120;
             </p>
             </td>
 <td>
@@ -83,7 +90,7 @@
 <td>
             <p>
Template metaprogramming framework of compile-time algorithms, sequences - and metafunction classes</p><p>编译期算法、序列和元函数类的模 板元编程框架 + and metafunction classes<br> &#32534;&#35793;&#26399;&#31639;&#27861;&#12289;&#24207;&#21015;&#21644;&#20803;&#20989;&#25968;&#31867;&#30340;&#27169;&#26495;&#20803;&#32534;&#31243;&#26694;&#26550;
             </p>
             </td>
 <td>
@@ -100,7 +107,7 @@
             </td>
 <td>
             <p>
- Templates for fundamental properties of types.</p><p>类型基础 属性的模板 + Templates for fundamental properties of types.<br> &#31867;&#22411;&#22522;&#30784;&#23646;&#24615;&#30340;&#27169;&#26495;
             </p>
             </td>
 <td>
@@ -117,7 +124,7 @@
             </td>
 <td>
             <p>
- Selective inclusion of function template overloads</p><p>函数 模板重载的可选择包含 + Selective inclusion of function template overloads<br> &#20989;&#25968;&#27169;&#26495;&#37325;&#36733;&#30340;&#21487;&#36873;&#25321;&#21253;&#21547;
             </p>
             </td>
 <td>
@@ -134,7 +141,8 @@
             </td>
 <td>
             <p>
- Iterator construction framework, adaptors, concepts, and more.</p><p>迭代器构造框架、适配器、概念及其它 + Iterator construction framework, adaptors, concepts, and more.<br> + &#36845;&#20195;&#22120;&#26500;&#36896;&#26694;&#26550;&#12289;&#36866;&#37197;&#22120;&#12289;&#27010;&#24565;&#21450;&#20854;&#23427;
             </p>
             </td>
 <td>
@@ -151,7 +159,7 @@
             </td>
 <td>
             <p>
- Defines types for passing parameters.</p><p>为传递参数定义类 + Defines types for passing parameters.<br> &#20026;&#20256;&#36882;&#21442;&#25968;&#23450;&#20041;&#31867;&#22411;
             </p>
             </td>
 <td>
@@ -168,7 +176,7 @@
             </td>
 <td>
             <p>
- Static assertions (compile time assertions).</p><p>静态断言 (编译期断言) + Static assertions (compile time assertions).<br> &#38745;&#24577;&#26029;&#35328;(&#32534;&#35793;&#26399;&#26029;&#35328;)
             </p>
             </td>
 <td>
@@ -181,27 +189,33 @@
 </table></div>
 </div>
 <br class="table-break"><div class="table">
-<a name="id2673624"></a><p class="title"><b>Table&nbsp;1.5.&nbsp;Optional Boost Libraries</b></p><p class="title"><b>表 1.5. 可选的 Boost 库</b></p> -<div class="table-contents"><table class="table" summary="Optional Boost Libraries">
-<colgroup><col><col><col><col></colgroup>
+<a name="id4900633"></a><p class="title"><b>Table 1.5. Optional Boost Libraries &#21487;&#36873;&#30340;Boost&#24211;</b></p> +<div class="table-contents"><table class="table" summary="Optional Boost Libraries &#21487;&#36873;&#30340;Boost&#24211;">
+<colgroup>
+<col>
+<col>
+<col>
+<col>
+</colgroup>
 <thead><tr>
 <th>
             <p>
-              Name 名字</p>
+              Name &#21517;&#23383;
+            </p>
             </th>
 <th>
             <p>
-              Description 说明
+              Description &#35828;&#26126;
             </p>
             </th>
 <th>
             <p>
-              author 作者
+              author &#20316;&#32773;
             </p>
             </th>
 <th>
             <p>
-              Purpose 目的
+              Purpose &#30446;&#30340;
             </p>
             </th>
 </tr></thead>
@@ -214,7 +228,7 @@
             </td>
 <td>
             <p>
- Serialization for persistence and marshalling</p><p>为持久性 和重整进行序列化 + Serialization for persistence and marshalling<br> &#20026;&#25345;&#20037;&#24615;&#21644;&#37325;&#25972;&#36827;&#34892;&#24207;&#21015;&#21270;
             </p>
             </td>
 <td>
@@ -224,7 +238,8 @@
             </td>
 <td>
             <p>
- Serialization support for bimap containers and iterators</p><p>支持 bimap 容器和迭代器的序列化 + Serialization support for bimap containers and iterators<br> &#25903;&#25345; + bimap &#23481;&#22120;&#21644;&#36845;&#20195;&#22120;&#30340;&#24207;&#21015;&#21270;
             </p>
             </td>
 </tr>
@@ -236,7 +251,8 @@
             </td>
 <td>
             <p>
- Filling containers with constant or generated data has never been easier</p><p>以最方便的方式用常数或生成的数据填充容器 + Filling containers with constant or generated data has never been easier<br> + &#20197;&#26368;&#26041;&#20415;&#30340;&#26041;&#24335;&#29992;&#24120;&#25968;&#25110;&#29983;&#25104;&#30340;&#25968;&#25454;&#22635;&#20805;&#23481;&#22120;
             </p>
             </td>
 <td>
@@ -246,7 +262,8 @@
             </td>
 <td>
             <p>
- Help to fill a bimap or views of it</p><p>帮助填充一个 bimap 或其视图 + Help to fill a bimap or views of it<br> &#24110;&#21161;&#22635;&#20805;&#19968;&#20010; bimap
+              &#25110;&#20854;&#35270;&#22270;
             </p>
             </td>
 </tr>
@@ -259,7 +276,7 @@
 <td>
             <p>
A TR1 hash function object that can be extended to hash user defined - types</p><p>一个 TR1 散列函数对象,可以扩展至对用户自定义类型 进行散列 + types<br> &#19968;&#20010; TR1 &#25955;&#21015;&#20989;&#25968;&#23545;&#35937;&#65292;&#21487;&#20197;&#25193;&#23637;&#33267;&#23545;&#29992;&#25143;&#33258;&#23450;&#20041;&#31867;&#22411;&#36827;&#34892;&#25955;&#21015;
             </p>
             </td>
 <td>
@@ -269,7 +286,7 @@
             </td>
 <td>
             <p>
-              Default hashing function</p><p>缺省的散列函数
+ Default hashing function<br> &#32570;&#30465;&#30340;&#25955;&#21015;&#20989;&#25968;
             </p>
             </td>
 </tr>
@@ -282,7 +299,7 @@
 <td>
             <p>
Define small unnamed function objects at the actual call site, and
-              more</p><p>就地定义小型匿名函数对象,及其它
+ more<br> &#23601;&#22320;&#23450;&#20041;&#23567;&#22411;&#21311;&#21517;&#20989;&#25968;&#23545;&#35937;&#65292;&#21450;&#20854;&#23427;
             </p>
             </td>
 <td>
@@ -292,7 +309,8 @@
             </td>
 <td>
             <p>
- Functors for modify, range, lower_bound and upper_bound</p><p>用于 modify, range, lower_bound 和 upper_bound&nbsp;的函数 对象 + Functors for modify, range, lower_bound and upper_bound<br> &#29992;&#20110; + modify, range, lower_bound &#21644; upper_bound &#30340;&#20989;&#25968;&#23545;&#35937;
             </p>
             </td>
 </tr>
@@ -305,7 +323,7 @@
 <td>
             <p>
A new infrastructure for generic algorithms that builds on top of the - new iterator concepts</p><p>用于泛型算法的新的基础设施,建筑 于新的迭代器概念之上 + new iterator concepts<br> &#29992;&#20110;&#27867;&#22411;&#31639;&#27861;&#30340;&#26032;&#30340;&#22522;&#30784;&#35774;&#26045;&#65292;&#24314;&#31569;&#20110;&#26032;&#30340;&#36845;&#20195;&#22120;&#27010;&#24565;&#20043;&#19978;
             </p>
             </td>
 <td>
@@ -315,8 +333,8 @@
             </td>
 <td>
             <p>
-              Range based algorithms<br>基于区间范围的算法
-                </p>
+ Range based algorithms<br> &#22522;&#20110;&#21306;&#38388;&#33539;&#22260;&#30340;&#31639;&#27861;
+            </p>
             </td>
 </tr>
 <tr>
@@ -327,7 +345,9 @@
             </td>
 <td>
             <p>
- Concepts defining interfaces which map key objects to value objects</p><p>定义了将键对象映射至值对象的接口的概念</p> + Concepts defining interfaces which map key objects to value objects<br> + &#23450;&#20041;&#20102;&#23558;&#38190;&#23545;&#35937;&#26144;&#23556;&#33267;&#20540;&#23545;&#35937;&#30340;&#25509;&#21475;&#30340;&#27010;&#24565;
+            </p>
             </td>
 <td>
             <p>
@@ -336,32 +356,37 @@
             </td>
 <td>
             <p>
-              Integration with BGL</p><p>与 BGL 集成</p>
+              Integration with BGL<br> &#19982; BGL &#38598;&#25104;
+            </p>
             </td>
 </tr>
 </tbody>
 </table></div>
 </div>
 <br class="table-break"><div class="table">
-<a name="id2673910"></a><p class="title"><b>Table&nbsp;1.6.&nbsp;Additional Boost Libraries needed to run - the test-suite</b></p><p class="title"><b>表 1.6. 运行测试套件所需的 其它 Boost 库</b></p> +<a name="id4900975"></a><p class="title"><b>Table 1.6. Additional Boost Libraries needed to run + the test-suite &#36816;&#34892;&#27979;&#35797;&#22871;&#20214;&#25152;&#38656;&#30340;&#20854;&#23427;Boost&#24211;</b></p> <div class="table-contents"><table class="table" summary="Additional Boost Libraries needed to run
-      the test-suite">
-<colgroup><col><col><col></colgroup>
+ the test-suite &#36816;&#34892;&#27979;&#35797;&#22871;&#20214;&#25152;&#38656;&#30340;&#20854;&#23427;Boost&#24211;">
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
 <thead><tr>
 <th>
             <p>
-              Name 名字
+              Name &#21517;&#23383;
             </p>
             </th>
 <th>
             <p>
-              Description 说明
+              Description &#35828;&#26126;
             </p>
             </th>
 <th>
             <p>
-              author 作者
+              author &#20316;&#32773;
             </p>
             </th>
 </tr></thead>
@@ -374,7 +399,7 @@
 <td>
             <p>
Support for simple program testing, full unit testing, and for program - execution monitoring.</p><p>支持简单的程序测试、全单元测 试,以及程序运行监控。 + execution monitoring.<br> &#25903;&#25345;&#31616;&#21333;&#30340;&#31243;&#24207;&#27979;&#35797;&#12289;&#20840;&#21333;&#20803;&#27979;&#35797;&#65292;&#20197;&#21450;&#31243;&#24207;&#36816;&#34892;&#30417;&#25511;&#12290;
             </p>
             </td>
 <td>
@@ -387,16 +412,17 @@
 </div>
 <br class="table-break">
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html Mon Mar 8 01:27:36 2010
@@ -1,37 +1,39 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Bimap and Boost</title><link rel="stylesheet" href="../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Bimap and Boost</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="up" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="prev" href="the_tutorial/complete_instantiation_scheme.html" title="Complete instantiation scheme"> -<link rel="next" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html" title="Boost Libraries that work well with Boost.Bimap"></head> -<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="the_tutorial/complete_instantiation_scheme.html" title="Complete instantiation scheme &#23436;&#25972;&#30340;&#23454;&#20363;&#21270;&#26041;&#26696;"> +<link rel="next" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html" title="Boost Libraries that work well with Boost.Bimap &#21487;&#20197;&#19982;Boost.Bimap&#20849;&#21516;&#20351;&#29992;&#30340;Boost&#24211;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../index.html">Home</a></td>
 <td align="center"><a href="../../../../libraries.htm">Libraries</a></td>
-<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="the_tutorial/complete_instantiation_scheme.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both;">
-<a name="boost_bimap.bimap_and_boost"></a><a class="link" href="bimap_and_boost.html" title="Bimap and Boost">Bimap and Boost &nbsp;Bimap 和 Boost</a>
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_bimap.bimap_and_boost"></a><a class="link" href="bimap_and_boost.html" title="Bimap and Boost">Bimap and Boost</a>
 </h2></div></div></div>
 <div class="toc"><dl>
<dt><span class="section"><a href="bimap_and_boost.html#boost_bimap.bimap_and_boost.bimap_and_multiindex">Bimap
-      and MultiIndex &nbsp;Bimap 和 MultiIndex</a></span></dt>
-<dt><span class="section"><a href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html">Boost - Libraries that work well with Boost.Bimap 可以与 Boost.Bimap 共用的 Boost 库</a></span></dt>
+      and MultiIndex</a></span></dt>
+<dt><span class="section"><a href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html"> + Boost Libraries that work well with Boost.Bimap &#21487;&#20197;&#19982;Boost.Bimap&#20849;&#21516;&#20351;&#29992;&#30340;Boost&#24211;</a></span></dt>
 <dd><dl>
-<dt><span class="section"><a href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.introduction">Introduction 简介</a></span></dt> +<dt><span class="section"><a href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.introduction">
+        Introduction &#31616;&#20171;</a></span></dt>
<dt><span class="section"><a href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_serialization">Boost.Serialization</a></span></dt> <dt><span class="section"><a href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_assign">Boost.Assign</a></span></dt> <dt><span class="section"><a href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_hash">Boost.Hash</a></span></dt>
@@ -42,23 +44,26 @@
<dt><span class="section"><a href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_xpressive">Boost.Xpressive</a></span></dt> <dt><span class="section"><a href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_property_map">Boost.Property_map</a></span></dt>
 </dl></dd>
-<dt><span class="section"><a href="bimap_and_boost/dependencies.html">Dependencies 依赖性</a></span></dt> +<dt><span class="section"><a href="bimap_and_boost/dependencies.html"> Dependencies
+      &#20381;&#36182;&#24615;</a></span></dt>
 </dl></div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.bimap_and_boost.bimap_and_multiindex"></a><a class="link" href="bimap_and_boost.html#boost_bimap.bimap_and_boost.bimap_and_multiindex" title="Bimap and MultiIndex">Bimap
-      and MultiIndex &nbsp;Bimap 和 MultiIndex</a>
+      and MultiIndex</a>
 </h3></div></div></div>
 <p>
<span class="emphasis"><em>MISC</em></span> - <span class="bold"><strong>M</strong></span>ulti-<span class="bold"><strong>I</strong></span>ndex <span class="bold"><strong>S</strong></span>pecialized - <span class="bold"><strong>C</strong></span>ontainers</p><p><span class="emphasis"><em>MISC</em></span> - <span class="bold"><strong>多重索引 专用容器</strong></span> + <span class="bold"><strong>C</strong></span>ontainers<br> <span class="emphasis"><em>MISC</em></span> + - <span class="bold"><strong>&#22810;&#37325;&#32034;&#24341;&#19987;&#29992;&#23481;&#22120;</strong></span>
       </p>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
<span class="emphasis"><em> Let's be generic, construct frameworks, describe the world - in an unified way...</em></span></p><p><span class="emphasis"><em>我们应该进行泛型的设计,构造框架,以统一的方式来描述世 界... </em></span> + in an unified way...<br> &#25105;&#20204;&#24212;&#35813;&#36827;&#34892;&#27867;&#22411;&#30340;&#35774;&#35745;&#65292;&#26500;&#36896;&#26694;&#26550;&#65292;&#20197;&#32479;&#19968;&#30340;&#26041;&#24335;&#26469;&#25551;&#36848;&#19990;&#30028;...
+            </em></span>
           </p>
 <p>
         </p>
@@ -68,7 +73,8 @@
           </p>
 <p>
<span class="emphasis"><em> No!, it is better to be specialized, design easy-to-use components, - offer plug-and-play objects...</em></span></p><p><span class="emphasis"><em>不!特化是更好的,设计易用的组件,提供即插即用的对 象... </em></span> + offer plug-and-play objects...<br> &#19981;&#65281;&#29305;&#21270;&#26159;&#26356;&#22909;&#30340;&#65292;&#35774;&#35745;&#26131;&#29992;&#30340;&#32452;&#20214;&#65292;&#25552;&#20379;&#21363;&#25554;&#21363;&#29992;&#30340;&#23545;&#35937;...
+            </em></span>
           </p>
 <p>
         </p>
@@ -77,7 +83,8 @@
 <p>
           </p>
 <p>
- <span class="bold"><strong> Why not take advantage of the best of both worlds?&nbsp;</strong></span></p><p><span class="bold"><strong>为什 么不同时利用两种方式的优势?</strong></span> + <span class="bold"><strong> Why not take advantage of the best of both worlds?<br> + &#20026;&#20160;&#20040;&#19981;&#21516;&#26102;&#21033;&#29992;&#20004;&#31181;&#26041;&#24335;&#30340;&#20248;&#21183;&#65311; </strong></span>
           </p>
 <p>
         </p>
@@ -91,82 +98,97 @@
of this kind of container: Boost.MultiIndex. It offers great flexibility and lets you construct almost any container that you could dream of. The framework is very clean. You migh want to read this library's tutorial to
-        learn about the power that has been achieved.&nbsp;</p><p>有
-了 Boost.Bimap,你可以构建两侧类型均可用作键值的关联式容器。Boost
-中还有一个库也可以创建此类容器,它就是:Boost.MultiIndex。它提供了强大的灵 活性,几乎可以让你构造任意想要的容器。该框架非常干净。
-你也许想看看该库的教程来学习它所具有的能力。 </p>
+ learn about the power that has been achieved.<br> &#26377;&#20102; Boost.Bimap&#65292;&#20320;&#21487;&#20197;&#26500;&#24314;&#20004;&#20391;&#31867;&#22411;&#22343;&#21487;&#29992;&#20316;&#38190;&#20540;&#30340;&#20851;&#32852;&#24335;&#23481;&#22120;&#12290;Boost + &#20013;&#36824;&#26377;&#19968;&#20010;&#24211;&#20063;&#21487;&#20197;&#21019;&#24314;&#27492;&#31867;&#23481;&#22120;&#65292; &#23427;&#23601;&#26159;&#65306;Boost.MultiIndex&#12290;&#23427;&#25552;&#20379;&#20102;&#24378;&#22823;&#30340;&#28789;&#27963;&#24615;&#65292;&#20960;&#20046;&#21487;&#20197;&#35753;&#20320;&#26500;&#36896;&#20219;&#24847;&#24819;&#35201;&#30340;&#23481;&#22120;&#12290; + &#35813;&#26694;&#26550;&#38750;&#24120;&#24178;&#20928;&#12290;&#20320;&#20063;&#35768;&#24819;&#30475;&#30475;&#35813;&#24211;&#30340;&#25945;&#31243;&#26469;&#23398;&#20064;&#23427;&#25152;&#20855;&#26377;&#30340;&#33021;&#21147;&#12290;
+      </p>
 <p>
But generality comes at a price: the interface that results might not be the best for every specialization. People may end up wrapping a B.MI container in its own class every time they want to use it as a bidirectional map. Boost.Bimap takes advantage of the narrower scope to produce a better interface for bidirectional
         maps
- <sup>[<a name="id2664358" href="bimap_and_boost.html#ftn.id2664358" class="footnote">2</a>]</sup> + <sup>[<a name="id4890604" href="#ftn.id4890604" class="footnote">2</a>]</sup> . There is no learning curve if you know how to use standard containers. Great effort was put into mapping the naming scheme of the STL to Boost.Bimap. - The library is designed to match the common STL containers.</p><p>不过通用性是有代价的:其接口对于各种特殊情况来说不一定是最 好的。人们也许不想在每次想使用双向映射时都将一个 B.MI 容器包装到一个自己的类 中。Boost.Bimap 凭借较窄的适用范围定义了一个更好的双向映射的接口<sup>[<a name="id2664358" href="#ftn.id2664358" class="footnote">2</a>]</sup>&nbsp;。 如果你懂得如何使用标准容器,则不存在任何学习曲线。将 STL 的命名方式置于 Boost.Bimap 也获得了很多好处。这个库被设计与常用的 STL 容器相匹配。 + The library is designed to match the common STL containers.<br> &#19981;&#36807;&#36890;&#29992;&#24615;&#26159;&#26377;&#20195;&#20215;&#30340;&#65306;&#20854;&#25509;&#21475;&#23545;&#20110;&#21508;&#31181;&#29305;&#27530;&#24773;&#20917;&#26469;&#35828;&#19981;&#19968;&#23450;&#26159;&#26368;&#22909;&#30340;&#12290; + &#20154;&#20204;&#20063;&#35768;&#19981;&#24819;&#22312;&#27599;&#27425;&#24819;&#20351;&#29992;&#21452;&#21521;&#26144;&#23556;&#26102;&#37117;&#23558;&#19968;&#20010; B.MI &#23481;&#22120;&#21253;&#35013;&#21040;&#19968;&#20010;&#33258;&#24049;&#30340;&#31867;&#20013;&#12290; + Boost.Bimap &#20973;&#20511;&#36739;&#31364;&#30340;&#36866;&#29992;&#33539;&#22260;&#23450;&#20041;&#20102;&#19968;&#20010;&#26356;&#22909;&#30340;&#21452;&#21521;&#26144;&#23556;&#30340;&#25509;&#21475;&#12290;&#22914;&#26524;&#20320;&#25026;&#24471;&#22914;&#20309;&#20351;&#29992;&#26631;&#20934;&#23481;&#22120;&#65292; + &#21017;&#19981;&#23384;&#22312;&#20219;&#20309;&#23398;&#20064;&#26354;&#32447;&#12290;&#23558; STL &#30340;&#21629;&#21517;&#26041;&#24335;&#32622;&#20110; Boost.Bimap + &#20063;&#33719;&#24471;&#20102;&#24456;&#22810;&#22909;&#22788;&#12290; &#36825;&#20010;&#24211;&#34987;&#35774;&#35745;&#19982;&#24120;&#29992;&#30340; STL &#23481;&#22120;&#30456;&#21305;&#37197;&#12290;
       </p>
 <p>
- Boost.MultiIndex is, in fact, the core of the bimap container.</p><p>
-        事实上,Boost.MultiIndex 是 bimap 容器的核心。
+ Boost.MultiIndex is, in fact, the core of the bimap container.<br> &#20107;&#23454;&#19978;&#65292;Boost.MultiIndex
+        &#26159; bimap &#23481;&#22120;&#30340;&#26680;&#24515;&#12290;
       </p>
 <p>
However, Boost.Bimap do not aim to tackle every problem with two indexed - types. There exist some problems that are better modelled with Boost.MultiIndex.</p><p>不过,Boost.Bimap 并不是解决与两个索引类型相关的任意 问题的工具。有一些问题使用 Boost.MultiIndex 会更好。 + types. There exist some problems that are better modelled with Boost.MultiIndex.<br> + &#19981;&#36807;&#65292;Boost.Bimap &#24182;&#19981;&#26159;&#35299;&#20915;&#19982;&#20004;&#20010;&#32034;&#24341;&#31867;&#22411;&#30456;&#20851;&#30340;&#20219;&#24847;&#38382;&#39064;&#30340;&#24037;&#20855;&#12290;&#26377;&#19968;&#20123;&#38382;&#39064;&#20351;&#29992;
+        Boost.MultiIndex &#20250;&#26356;&#22909;&#12290;
       </p>
 <div class="sidebar">
-
-<p><span class="bold"><strong>Problem I - An employee register</strong></span></p><p><span class="bold"><strong>问题 I - 员工记录 </strong></span>
+<p class="title"><b></b></p>
+<p>
+ <span class="bold"><strong>Problem I - An employee register<br> &#38382;&#39064; I - &#21592;&#24037;&#35760;&#24405;</strong></span>
       </p>
 <p>
<span class="emphasis"><em>Store an ID and a name for an employee, with fast search on each - member.</em></span></p><p><span class="emphasis"><em></em></span><span class="emphasis"><em>为每个员工保存一 个ID和一个名字,需要快速查找每个成员。</em></span> + member.<br> &#20026;&#27599;&#20010;&#21592;&#24037;&#20445;&#23384;&#19968;&#20010;ID&#21644;&#19968;&#20010;&#21517;&#23383;&#65292;&#38656;&#35201;&#24555;&#36895;&#26597;&#25214;&#27599;&#20010;&#25104;&#21592;&#12290;</em></span>
       </p>
 <p>
This type of problem is better modelled as a database table, and <span class="bold"><strong>Boost.MultiIndex</strong></span> is the preferred choice. It is possible - that other data will need to be indexed later.</p><p>这类问题最好是 建模为数据库表,而 <span class="bold"><strong>Boost.MultiIndex</strong></span> 是最好的选择。它可以在 以后增加其它索引数据。 + that other data will need to be indexed later.<br> &#36825;&#31867;&#38382;&#39064;&#26368;&#22909;&#26159;&#24314;&#27169;&#20026;&#25968;&#25454;&#24211;&#34920;&#65292;&#32780; + <span class="bold"><strong>Boost.MultiIndex</strong></span> &#26159;&#26368;&#22909;&#30340;&#36873;&#25321;&#12290;&#23427;&#21487;&#20197;&#22312;&#20197;&#21518;&#22686;&#21152;&#20854;&#23427;&#32034;&#24341;&#25968;&#25454;&#12290;
       </p>
-
+<p>
+      </p>
 </div>
 <div class="sidebar">
-
-<p><span class="bold"><strong>Problem II - A partners container</strong></span></p><p><span class="bold"><strong>问题 II - 伙伴容 器</strong></span>
+<p class="title"><b></b></p>
+<p>
+ <span class="bold"><strong>Problem II - A partners container<br> &#38382;&#39064; II -
+        &#20249;&#20276;&#23481;&#22120;</strong></span>
       </p>
 <p>
<span class="emphasis"><em>Store the names of couples and be able to get the name of a person's - partner.</em></span></p><p><span class="emphasis">保存多对名字,且 能够取出某个人的伙伴的名字。</span><span class="emphasis"><em></em></span> + partner.<br> &#20445;&#23384;&#22810;&#23545;&#21517;&#23383;&#65292;&#19988;&#33021;&#22815;&#21462;&#20986;&#26576;&#20010;&#20154;&#30340;&#20249;&#20276;&#30340;&#21517;&#23383;&#12290;</em></span>
       </p>
 <p>
- This problem is better modelled as a collection of relations, and <span class="bold"><strong>Boost.Bimap</strong></span> fits nicely here. + This problem is better modelled as a collection of relations, and <span class="bold"><strong>Boost.Bimap</strong></span> fits nicely here.<br> &#35813;&#38382;&#39064;&#26368;&#22909;&#24314;&#27169;&#20026;&#19968;&#32452;&#20851;&#31995;&#30340;&#32452;&#21512;&#65292;&#32780; + <span class="bold"><strong>Boost.Bimap</strong></span> &#38750;&#24120;&#36866;&#29992;&#12290;
       </p>
 <p>
- 该问题最好建模为一组关系的组合,而 <span class="bold"><strong>Boost.Bimap</strong></span> 非常适用。</p>
+      </p>
 </div>
 <p>
- You can also read <a class="link" href="the_tutorial/additional_information.html" title="Additional information">Additional - Information</a> for more information about the relation of this two libraries.</p><p>你也可以阅读 <a class="link" href="the_tutorial/additional_information.html" title="Additional information">更多的信息</a> 一节,其中有关于这两个库的关系的更多信息。 + You can also read <a class="link" href="the_tutorial/additional_information.html" title="Additional information &#26356;&#22810;&#30340;&#20449;&#24687;">Additional + Information</a> for more information about the relation of this two libraries.<br> + &#20320;&#20063;&#21487;&#20197;&#38405;&#35835; <a class="link" href="the_tutorial/additional_information.html" title="Additional information &#26356;&#22810;&#30340;&#20449;&#24687;">&#26356;&#22810;&#30340;&#20449;&#24687;</a> + &#19968;&#33410;&#65292; &#20854;&#20013;&#26377;&#20851;&#20110;&#36825;&#20004;&#20010;&#24211;&#30340;&#20851;&#31995;&#30340;&#26356;&#22810;&#20449;&#24687;&#12290;
       </p>
 </div>
 <div class="footnotes">
-<br><hr align="left" width="100">
-<div class="footnote"><p><sup>[<a name="ftn.id2664358" href="#id2664358" class="para">2</a>] </sup>
+<br><hr width="100" align="left">
+<div class="footnote"><p><sup>[<a name="ftn.id4890604" href="#id4890604" class="para">2</a>] </sup> In the same fashion, Boost.MRU will allow the creation of <span class="emphasis"><em>most recent updated</em></span> aware containers, hiding the complexity of - Boost.MultiIndex.&nbsp;</p><p>同样的方式 ,Boost.MRU 可用于创建 对<span class="emphasis"><em>最近更新</em></span>感知的容器,将
-            Boost.MultiIndex 的复杂性隐藏起来。
+ Boost.MultiIndex.<br> &#21516;&#26679;&#30340;&#26041;&#24335; &#65292;Boost.MRU &#21487;&#29992;&#20110;&#21019;&#24314;&#23545;<span class="emphasis"><em>&#26368;&#36817;&#26356;&#26032;</em></span>&#24863;&#30693;&#30340;&#23481;&#22120;&#65292;&#23558; + Boost.MultiIndex &#30340;&#22797;&#26434;&#24615;&#38544;&#34255;&#36215;&#26469;&#12290;
           </p></div>
 </div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="the_tutorial/complete_instantiation_scheme.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/compiler_specifics.html Mon Mar 8 01:27:36 2010
@@ -1,46 +1,51 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Compiler specifics</title><link rel="stylesheet" href="../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Compiler specifics &#32534;&#35793;&#22120;&#30456;&#20851;&#35828;&#26126;</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="up" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="prev" href="reference/unconstrained_set_of_reference.html" title="unconstrained_set_of Reference">
-<link rel="next" href="performance.html" title="Performance"></head>
-<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="reference/unconstrained_set_of_reference.html" title="unconstrained_set_of Reference unconstrained_set_of&#21442;&#32771;"> +<link rel="next" href="performance.html" title="Performance &#24615;&#33021;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../index.html">Home</a></td>
 <td align="center"><a href="../../../../libraries.htm">Libraries</a></td>
-<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="reference/unconstrained_set_of_reference.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="performance.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both;">
-<a name="boost_bimap.compiler_specifics"></a><a class="link" href="compiler_specifics.html" title="Compiler specifics">Compiler specifics 编译器相关说明</a>
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_bimap.compiler_specifics"></a><a class="link" href="compiler_specifics.html" title="Compiler specifics &#32534;&#35793;&#22120;&#30456;&#20851;&#35828;&#26126;"> Compiler specifics &#32534;&#35793;&#22120;&#30456;&#20851;&#35828;&#26126;</a>
 </h2></div></div></div>
 <div class="informaltable"><table class="table">
-<colgroup><col><col><col></colgroup>
+<colgroup>
+<col>
+<col>
+<col>
+</colgroup>
 <thead><tr>
 <th>
             <p>
-              Compiler 编译器
+              Compiler &#32534;&#35793;&#22120;
             </p>
             </th>
 <th>
             <p>
-              OS Tested 测试的操作系统
+ OS Tested &#27979;&#35797;&#30340;&#25805;&#20316;&#31995;&#32479;
             </p>
             </th>
 <th>
             <p>
-              State 状态
+              State &#29366;&#24577;
             </p>
             </th>
 </tr></thead>
@@ -58,7 +63,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -75,7 +80,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -92,7 +97,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -109,7 +114,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -126,7 +131,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -143,7 +148,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -160,7 +165,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -177,7 +182,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -194,7 +199,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -211,7 +216,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -228,7 +233,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -245,7 +250,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -262,7 +267,7 @@
             </td>
 <td>
             <p>
-              Not Supported 不支持
+              Not Supported &#19981;&#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -279,7 +284,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -296,7 +301,7 @@
             </td>
 <td>
             <p>
-              Supported 支持
+              Supported &#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -313,51 +318,54 @@
             </td>
 <td>
             <p>
-              Not Supported 不支持
+              Not Supported &#19981;&#25903;&#25345;
             </p>
             </td>
 </tr>
 </tbody>
 </table></div>
 <a name="boost_bimap.compiler_specifics.vs_7_1"></a><h3>
-<a name="id2732451"></a>
+<a name="id4985111"></a>
<a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_7_1">VS 7.1</a>
     </h3>
 <p>
If a .cpp file uses more than four differents bimaps the compiler will run out of symbols and issue an internal compiler error. The official solution - in msdn is to split the .cpp in several files or upgrade your compiler.</p><p>如果一个 .cpp 文件使用了四个以上不同的 bimap,编译器会将符号 用完并产生一个内部编译错误。官方的解决方法是,将该 .cpp 文件分割为多个文 件,或者升级你的编译器。 + in msdn is to split the .cpp in several files or upgrade your compiler.<br> + &#22914;&#26524;&#19968;&#20010; .cpp &#25991;&#20214;&#20351;&#29992;&#20102;&#22235;&#20010;&#20197;&#19978;&#19981;&#21516;&#30340; bimap&#65292;&#32534;&#35793;&#22120;&#20250;&#23558;&#31526;&#21495;&#29992;&#23436;&#24182;&#20135;&#29983;&#19968;&#20010;&#20869;&#37096;&#32534;&#35793;&#38169;&#35823;&#12290; + &#23448;&#26041;&#30340;&#35299;&#20915;&#26041;&#27861;&#26159;&#65292;&#23558;&#35813; .cpp &#25991;&#20214;&#20998;&#21106;&#20026;&#22810;&#20010;&#25991;&#20214;&#65292;&#25110;&#32773;&#21319;&#32423;&#20320;&#30340;&#32534;&#35793;&#22120;&#12290;
     </p>
 <a name="boost_bimap.compiler_specifics.vs_8_0"></a><h3>
-<a name="id2732479"></a>
+<a name="id4985150"></a>
<a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_8_0">VS 8.0</a>
     </h3>
 <p>
VC++ 8.0 warns on usage of certain Standard Library and API functions that can be cause buffer overruns or other possible security issues if misused. - See http://msdn.microsoft.com/msdnmag/issues/05/05/SafeCandC/default.aspx But - the wording of the warning is misleading and unsettling, there are no portable + See http://msdn.microsoft.com/msdnmag/issues/05/05/SafeCandC<span class="emphasis"><em>default.aspx + But the wording of the warning is misleading and unsettling, there are no portable alternative functions, and VC++ 8.0's own libraries use the functions in question. In order to turn off the warnings add the followings defines at the begging
-      of your .cpp files:</p><p>
-VC++ 8.0 会警告在使用当前的标准库和API函数时,误用会导致缓冲区溢出或其它可 能的安全问题。请看
-http://msdn.microsoft.com/msdnmag/issues/05/05/SafeCandC/default.aspx,不过;
-该警告的用语容易令人误解,也未详细说明,没有可移植的其它函数,且 VC++ 8.0 自己本身的库也使用了有问题的函数。要关闭这些警告,要在你的
-.cpp 文件中加入以下定义: </p>
+ of your .cpp files:\n VC++ 8.0 &#20250;&#35686;&#21578;&#22312;&#20351;&#29992;&#24403;&#21069;&#30340;&#26631;&#20934;&#24211;&#21644;API&#20989;&#25968;&#26102;&#65292;&#35823;&#29992;&#20250;&#23548;&#33268;&#32531;&#20914;&#21306;&#28322;&#20986;&#25110;&#20854;&#23427;&#21487;&#33021;&#30340;&#23433;&#20840;&#38382;&#39064;&#12290; + &#35831;&#30475; http:</em></span>/msdn.microsoft.com/msdnmag/issues/05/05/SafeCandC/default.aspx&#65292;&#19981;&#36807;&#35813;&#35686;&#21578;&#30340;&#29992;&#35821;&#23481;&#26131;&#20196;&#20154;&#35823;&#35299;&#65292; + &#20063;&#26410;&#35814;&#32454;&#35828;&#26126;&#65292;&#27809;&#26377;&#21487;&#31227;&#26893;&#30340;&#20854;&#23427;&#20989;&#25968;&#65292;&#19988; VC++ 8.0 &#33258;&#24049;&#26412;&#36523;&#30340;&#24211;&#20063;&#20351;&#29992;&#20102;&#26377;&#38382;&#39064;&#30340;&#20989;&#25968;&#12290; + &#35201;&#20851;&#38381;&#36825;&#20123;&#35686;&#21578;&#65292;&#35201;&#22312;&#20320;&#30340; .cpp &#25991;&#20214;&#20013;&#21152;&#20837;&#20197;&#19979;&#23450;&#20041;&#65306;
+    </p>
<pre class="programlisting"><span class="preprocessor">#define</span> <span class="identifier">_CRT_SECURE_NO_DEPRECATE</span> <span class="preprocessor">#define</span> <span class="identifier">_SCL_SECURE_NO_DEPRECATE</span>
 </pre>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="reference/unconstrained_set_of_reference.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="performance.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/examples.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/examples.html Mon Mar 8 01:27:36 2010
@@ -1,60 +1,67 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Examples</title><link rel="stylesheet" href="../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Examples &#31034;&#20363;</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="up" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="prev" href="performance.html" title="Performance">
-<link rel="next" href="examples/simple_bimap.html" title="Simple Bimap"></head> -<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="performance.html" title="Performance &#24615;&#33021;"> +<link rel="next" href="examples/simple_bimap.html" title="Simple Bimap &#31616;&#21333;&#30340;Bimap">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../index.html">Home</a></td>
 <td align="center"><a href="../../../../libraries.htm">Libraries</a></td>
-<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="performance.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples/simple_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both;">
-<a name="boost_bimap.examples"></a><a class="link" href="examples.html" title="Examples">Examples 示例</a>
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_bimap.examples"></a><a class="link" href="examples.html" title="Examples &#31034;&#20363;"> Examples &#31034;&#20363;</a>
 </h2></div></div></div>
 <div class="toc"><dl>
-<dt><span class="section"><a href="examples.html#boost_bimap.examples.examples_list">Examples list 例子的 列表</a></span></dt> -<dt><span class="section"><a href="examples/simple_bimap.html">Simple Bimap 简单的 Bimap</a></span></dt> -<dt><span class="section"><a href="examples/mighty_bimap.html">Mighty Bimap 强大的 Bimap</a></span></dt> -<dt><span class="section"><a href="examples/multiindex_to_bimap_path___bidirectional_map.html">MultiIndex - to Bimap Path - Bidirectional Map 从 MultiIndex 到 Bimap 之路 - 双向 映射</a></span></dt> -<dt><span class="section"><a href="examples/multiindex_to_bimap_path___hashed_indices.html">MultiIndex - to Bimap Path - Hashed indices 从 MultiIndex 到 Bimap 之路 - 散列索引 </a></span></dt> +<dt><span class="section"><a href="examples.html#boost_bimap.examples.examples_list"> Examples list &#20363;&#23376;&#30340;&#21015;&#34920;</a></span></dt> +<dt><span class="section"><a href="examples/simple_bimap.html"> Simple Bimap &#31616;&#21333;&#30340;Bimap</a></span></dt> +<dt><span class="section"><a href="examples/mighty_bimap.html"> Mighty Bimap &#24378;&#22823;&#30340;Bimap</a></span></dt> +<dt><span class="section"><a href="examples/multiindex_to_bimap_path___bidirectional_map.html"> + MultiIndex to Bimap Path - Bidirectional Map &#20174;MultiIndex&#21040;Bimap&#20043;&#36335; -
+      &#21452;&#21521;&#26144;&#23556;</a></span></dt>
+<dt><span class="section"><a href="examples/multiindex_to_bimap_path___hashed_indices.html"> + MultiIndex to Bimap Path - Hashed indices &#20174;MultiIndex&#21040;Bimap&#20043;&#36335; - &#25955;&#21015;&#32034;&#24341;</a></span></dt>
 </dl></div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.examples.examples_list"></a><a class="link" href="examples.html#boost_bimap.examples.examples_list" title="Examples list">Examples list 例子的列表</a> +<a name="boost_bimap.examples.examples_list"></a><a class="link" href="examples.html#boost_bimap.examples.examples_list" title="Examples list &#20363;&#23376;&#30340;&#21015;&#34920;"> Examples list &#20363;&#23376;&#30340;&#21015;&#34920;</a>
 </h3></div></div></div>
 <p>
In the folder <a href="../../../example" target="_top">libs/bimap/example</a> you can - find all the examples used in bimap documentation. Here is a list of them:</p><p>在文件夹 <a href="../../../example" target="_top">libs/bimap/example</a> 中,你可以找到 bimap 文档中所用的所有例 子。以下是它们的列表: + find all the examples used in bimap documentation. Here is a list of them:<br> + &#22312;&#25991;&#20214;&#22841; <a href="../../../example" target="_top">libs/bimap/example</a> &#20013;&#65292;&#20320;&#21487;&#20197;&#25214;&#21040; + bimap &#25991;&#26723;&#20013;&#25152;&#29992;&#30340;&#25152;&#26377;&#20363;&#23376;&#12290;&#20197;&#19979;&#26159;&#23427;&#20204;&#30340;&#21015;&#34920;&#65306;
       </p>
 <div class="table">
-<a name="id2732600"></a><p class="title"><b>Table&nbsp;1.7.&nbsp;Tutorial examples</b><b></b></p><p class="title"><b>表&nbsp;1.7. 教程的例子</b></p> -<div class="table-contents"><table class="table" summary="Tutorial examples">
-<colgroup><col><col></colgroup>
+<a name="id4985310"></a><p class="title"><b>Table 1.7. Tutorial examples &#25945;&#31243;&#30340;&#20363;&#23376;</b></p> +<div class="table-contents"><table class="table" summary="Tutorial examples &#25945;&#31243;&#30340;&#20363;&#23376;">
+<colgroup>
+<col>
+<col>
+</colgroup>
 <thead><tr>
 <th>
             <p>
-              Program 程序
+              Program &#31243;&#24207;
             </p>
             </th>
 <th>
             <p>
-              Description 说明
+              Description &#35828;&#26126;
             </p>
             </th>
 </tr></thead>
@@ -67,7 +74,7 @@
             </td>
 <td>
             <p>
-              Soccer world cup example</p><p>足球世界杯的例子
+ Soccer world cup example<br> &#36275;&#29699;&#19990;&#30028;&#26479;&#30340;&#20363;&#23376;
             </p>
             </td>
 </tr>
@@ -80,7 +87,7 @@
             </td>
 <td>
             <p>
- Soccer world cup example using user defined names</p><p>使用 用户自定义名字的足球世界杯例子 + Soccer world cup example using user defined names<br> &#20351;&#29992;&#29992;&#25143;&#33258;&#23450;&#20041;&#21517;&#23383;&#30340;&#36275;&#29699;&#19990;&#30028;&#26479;&#20363;&#23376;
             </p>
             </td>
 </tr>
@@ -92,7 +99,7 @@
             </td>
 <td>
             <p>
- Basic example of the three views of bimap</p><p>bimap 的三个 视图的简单例子 + Basic example of the three views of bimap<br> bimap&#30340;&#19977;&#20010;&#35270;&#22270;&#30340;&#31616;&#21333;&#20363;&#23376;
             </p>
             </td>
 </tr>
@@ -106,7 +113,9 @@
 <td>
             <p>
Countries populations, using <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> - and <code class="computeroutput"><span class="identifier">multiset_of</span></code></p><p><code class="computeroutput"><span class="identifier"></span></code>国家人口,使 用 <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> 和 <code class="computeroutput"><span class="identifier">multiset_of</span></code> + and <code class="computeroutput"><span class="identifier">multiset_of</span></code> <br> + &#22269;&#23478;&#20154;&#21475;&#65292;&#20351;&#29992; <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> + &#21644; <code class="computeroutput"><span class="identifier">multiset_of</span></code>
             </p>
             </td>
 </tr>
@@ -120,7 +129,9 @@
 <td>
             <p>
Word repetitions counter, using <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> - and <code class="computeroutput"><span class="identifier">list_of</span></code></p><p><code class="computeroutput"><span class="identifier"></span></code>单词重复量计 数,使用 <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> 和 <code class="computeroutput"><span class="identifier">list_of</span></code> + and <code class="computeroutput"><span class="identifier">list_of</span></code> <br> + &#21333;&#35789;&#37325;&#22797;&#37327;&#35745;&#25968;&#65292;&#20351;&#29992; <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> + &#21644; <code class="computeroutput"><span class="identifier">list_of</span></code>
             </p>
             </td>
 </tr>
@@ -132,7 +143,8 @@
             </td>
 <td>
             <p>
- Dictionary using <code class="computeroutput"><span class="identifier">list_of_relation</span></code></p><p><code class="computeroutput"><span class="identifier"></span></code> 字典,使用 <code class="computeroutput"><span class="identifier">list_of_relation</span></code> + Dictionary using <code class="computeroutput"><span class="identifier">list_of_relation</span></code> + <br> &#23383;&#20856;&#65292;&#20351;&#29992; <code class="computeroutput"><span class="identifier">list_of_relation</span></code>
             </p>
             </td>
 </tr>
@@ -145,7 +157,7 @@
             </td>
 <td>
             <p>
- Equivalence between code with tagged and untagged code</p><p>带标签和不带标签的相同代码 + Equivalence between code with tagged and untagged code <br> &#24102;&#26631;&#31614;&#21644;&#19981;&#24102;&#26631;&#31614;&#30340;&#30456;&#21516;&#20195;&#30721;
             </p>
             </td>
 </tr>
@@ -158,7 +170,8 @@
             </td>
 <td>
             <p>
- Comparison between standard maps and bimap map views</p><p>标 准 map 与 bimap 映射视图间的比较 + Comparison between standard maps and bimap map views <br> &#26631;&#20934; + map &#19982; bimap &#26144;&#23556;&#35270;&#22270;&#38388;&#30340;&#27604;&#36739;
             </p>
             </td>
 </tr>
@@ -173,9 +186,7 @@
             <p>
Functions <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code> and <code class="computeroutput"><span class="keyword">operator</span><span class="special">[](</span><span class="identifier">key</span><span class="special">)</span></code>
-              examples</p><p>
- 函数 <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code> 和 <code class="computeroutput"><span class="keyword">operator</span><span class="special">[](</span><span class="identifier">key</span><span class="special">)</span></code>
-              的例子
+ examples <br> &#20989;&#25968; <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code> &#21644; <code class="computeroutput"><span class="keyword">operator</span><span class="special">[](</span><span class="identifier">key</span><span class="special">)</span></code> &#30340;&#20363;&#23376;
             </p>
             </td>
 </tr>
@@ -188,7 +199,8 @@
             </td>
 <td>
             <p>
- <code class="computeroutput"><span class="identifier">modify</span></code> and <code class="computeroutput"><span class="identifier">replace</span></code> examples</p><p><code class="computeroutput"><span class="identifier">modify</span></code> 和 <code class="computeroutput"><span class="identifier">replace</span></code> 的例子 + <code class="computeroutput"><span class="identifier">modify</span></code> and <code class="computeroutput"><span class="identifier">replace</span></code> examples <br> <code class="computeroutput"><span class="identifier">modify</span></code> &#21644; <code class="computeroutput"><span class="identifier">replace</span></code>
+              &#30340;&#20363;&#23376;
             </p>
             </td>
 </tr>
@@ -201,7 +213,7 @@
 <td>
             <p>
<code class="computeroutput"><span class="identifier">range</span><span class="special">()</span></code> - tutorial</p><p><code class="computeroutput"><span class="identifier">range</span><span class="special">()</span></code> 教程 + tutorial <br> <code class="computeroutput"><span class="identifier">range</span><span class="special">()</span></code> &#25945;&#31243;
             </p>
             </td>
 </tr>
@@ -214,7 +226,7 @@
             </td>
 <td>
             <p>
-              Additional information hooking</p><p>额外的信息挂载
+ Additional information hooking <br> &#39069;&#22806;&#30340;&#20449;&#24687;&#25346;&#36733;
             </p>
             </td>
 </tr>
@@ -228,7 +240,8 @@
 <td>
             <p>
Using <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code> - collection type</p><p>使用 <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code> 组合类型 + collection type <br> &#20351;&#29992; <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code>
+              &#32452;&#21512;&#31867;&#22411;
             </p>
             </td>
 </tr>
@@ -236,18 +249,21 @@
 </table></div>
 </div>
 <br class="table-break"><div class="table">
-<a name="id2733080"></a><p class="title"><b>Table&nbsp;1.8.&nbsp;Bimap and Boost examples</b></p><p class="title"><b>表&nbsp;1.8.&nbsp;Bimap 和 Boost 的例子</b></p> -<div class="table-contents"><table class="table" summary="Bimap and Boost examples">
-<colgroup><col><col></colgroup>
+<a name="id4985988"></a><p class="title"><b>Table 1.8. Bimap and Boost examples Bimap&#21644;Boost&#30340;&#20363;&#23376;</b></p> +<div class="table-contents"><table class="table" summary="Bimap and Boost examples Bimap&#21644;Boost&#30340;&#20363;&#23376;">
+<colgroup>
+<col>
+<col>
+</colgroup>
 <thead><tr>
 <th>
             <p>
-              Program 程序
+              Program &#31243;&#24207;
             </p>
             </th>
 <th>
             <p>
-              Description 说明
+              Description &#35828;&#26126;
             </p>
             </th>
 </tr></thead>
@@ -260,8 +276,8 @@
             </td>
 <td>
             <p>
-              Bimap and Boost.Assign: Methods to insert elements</p><p>
-              Bimap 和 Boost.Assign: 插入元素的方法
+ Bimap and Boost.Assign: Methods to insert elements <br> Bimap &#21644; + Boost.Assign: &#25554;&#20837;&#20803;&#32032;&#30340;&#26041;&#27861;
             </p>
             </td>
 </tr>
@@ -273,8 +289,8 @@
             </td>
 <td>
             <p>
-              Bimap and Boost.Lambda: new lambda placeholders</p><p>
-              Bimap and Boost.Lambda: 新的 lambda 占位符
+ Bimap and Boost.Lambda: new lambda placeholders <br> Bimap and Boost.Lambda:
+              &#26032;&#30340; lambda &#21344;&#20301;&#31526;
             </p>
             </td>
 </tr>
@@ -287,8 +303,8 @@
             </td>
 <td>
             <p>
-              Bimap and Boost.PropertyMap: PropertyMap support</p><p>
-              Bimap and Boost.PropertyMap: PropertyMap 的支持
+ Bimap and Boost.PropertyMap: PropertyMap support <br> Bimap and Boost.PropertyMap:
+              PropertyMap &#30340;&#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -300,8 +316,8 @@
             </td>
 <td>
             <p>
- Bimap and Boost.Range: Using bimaps in the new range framework</p><p>
-              Bimap and Boost.Range: 在新的区间框架中使用 bimap
+ Bimap and Boost.Range: Using bimaps in the new range framework <br> + Bimap and Boost.Range: &#22312;&#26032;&#30340;&#21306;&#38388;&#26694;&#26550;&#20013;&#20351;&#29992; bimap
             </p>
             </td>
 </tr>
@@ -314,8 +330,8 @@
             </td>
 <td>
             <p>
-              Bimap and Boost.Foreach: Iterating over bimaps</p><p>
-              Bimap and Boost.Foreach: 遍历 bimap
+ Bimap and Boost.Foreach: Iterating over bimaps <br> Bimap and Boost.Foreach:
+              &#36941;&#21382; bimap
             </p>
             </td>
 </tr>
@@ -327,8 +343,8 @@
             </td>
 <td>
             <p>
- Bimap and Boost.Typeof: using BOOST_AUTO while we wait for C++0x</p><p>
-              Bimap and Boost.Typeof: 在 C++0x 之前使用 BOOST_AUTO
+ Bimap and Boost.Typeof: using BOOST_AUTO while we wait for C++0x <br> + Bimap and Boost.Typeof: &#22312; C++0x &#20043;&#21069;&#20351;&#29992; BOOST_AUTO
             </p>
             </td>
 </tr>
@@ -341,8 +357,8 @@
             </td>
 <td>
             <p>
- Bimap and Boost.Xpressive: Inserting elements in a bimap</p><p>
-              Bimap and Boost.Xpressive: 将元素插入到一个 bimap
+ Bimap and Boost.Xpressive: Inserting elements in a bimap <br> Bimap + and Boost.Xpressive: &#23558;&#20803;&#32032;&#25554;&#20837;&#21040;&#19968;&#20010; bimap
             </p>
             </td>
 </tr>
@@ -355,8 +371,8 @@
             </td>
 <td>
             <p>
- Bimap and Boost.Serialization: Load and save bimaps and iterators</p><p>
-              Bimap and Boost.Serialization: 导入和保存 bimap 及其迭代器
+ Bimap and Boost.Serialization: Load and save bimaps and iterators + <br> Bimap and Boost.Serialization: &#23548;&#20837;&#21644;&#20445;&#23384; bimap &#21450;&#20854;&#36845;&#20195;&#22120;
             </p>
             </td>
 </tr>
@@ -364,17 +380,23 @@
 </table></div>
 </div>
 <br class="table-break"><div class="table">
-<a name="id2733301"></a><p class="title"><b>Table&nbsp;1.9.&nbsp;Boost.MultiIndex to Boost.Bimap path examples</b></p><p class="title"><b>表&nbsp;1.9. 从 Boost.MultiIndex 到 Boost.Bimap 之路的例子</b></p> -<div class="table-contents"><table class="table" summary="Boost.MultiIndex to Boost.Bimap path examples">
-<colgroup><col><col></colgroup>
+<a name="id4986250"></a><p class="title"><b>Table 1.9. Boost.MultiIndex to Boost.Bimap path examples + &#20174;Boost.MultiIndex&#21040;Boost.Bimap&#20043;&#36335;&#30340;&#20363;&#23376;</b></p> +<div class="table-contents"><table class="table" summary="Boost.MultiIndex to Boost.Bimap path examples + &#20174;Boost.MultiIndex&#21040;Boost.Bimap&#20043;&#36335;&#30340;&#20363;&#23376;">
+<colgroup>
+<col>
+<col>
+</colgroup>
 <thead><tr>
 <th>
             <p>
-              Program 程序</p>
+              Program &#31243;&#24207;
+            </p>
             </th>
 <th>
             <p>
-              Description 说明
+              Description &#35828;&#26126;
             </p>
             </th>
 </tr></thead>
@@ -388,7 +410,8 @@
             </td>
 <td>
             <p>
- Boost.MultiIndex to Boost.Bimap path example</p><p>从 Boost.MultiIndex 到 Boost.Bimap 之路的例子 + Boost.MultiIndex to Boost.Bimap path example <br> &#20174; Boost.MultiIndex
+              &#21040; Boost.Bimap &#20043;&#36335;&#30340;&#20363;&#23376;
             </p>
             </td>
 </tr>
@@ -401,7 +424,9 @@
             </td>
 <td>
             <p>
- Boost.MultiIndex to Boost.Bimap path example</p><p>从 Boost.MultiIndex 到 Boost.Bimap 之路的例子</p> + Boost.MultiIndex to Boost.Bimap path example <br> &#20174; Boost.MultiIndex
+              &#21040; Boost.Bimap &#20043;&#36335;&#30340;&#20363;&#23376;
+            </p>
             </td>
 </tr>
 <tr>
@@ -413,7 +438,9 @@
             </td>
 <td>
             <p>
- Boost.MultiIndex to Boost.Bimap path example</p><p>从 Boost.MultiIndex 到 Boost.Bimap 之路的例子</p> + Boost.MultiIndex to Boost.Bimap path example <br> &#20174; Boost.MultiIndex
+              &#21040; Boost.Bimap &#20043;&#36335;&#30340;&#20363;&#23376;
+            </p>
             </td>
 </tr>
 </tbody>
@@ -422,16 +449,17 @@
 <br class="table-break">
 </div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="performance.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples/simple_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/future_work.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/future_work.html Mon Mar 8 01:27:36 2010
@@ -1,50 +1,52 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Future work</title><link rel="stylesheet" href="../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Future work &#26410;&#26469;&#30340;&#24037;&#20316;</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="up" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="prev" href="test_suite.html" title="Test suite">
-<link rel="next" href="release_notes.html" title="Release notes"></head>
-<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="test_suite.html" title="Test suite &#27979;&#35797;&#22871;&#20214;"> +<link rel="next" href="release_notes.html" title="Release notes &#21457;&#24067;&#35828;&#26126;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../index.html">Home</a></td>
 <td align="center"><a href="../../../../libraries.htm">Libraries</a></td>
-<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="test_suite.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both;">
-<a name="boost_bimap.future_work"></a><a class="link" href="future_work.html" title="Future work">Future work 未来的工作</a>
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_bimap.future_work"></a><a class="link" href="future_work.html" title="Future work &#26410;&#26469;&#30340;&#24037;&#20316;"> Future work &#26410;&#26469;&#30340;&#24037;&#20316;</a>
 </h2></div></div></div>
-<a name="boost_bimap.future_work.rearrange_function"></a><h4>
-<a name="id2747040"></a>
- <a class="link" href="future_work.html#boost_bimap.future_work.rearrange_function">Rearrange Function 重排函数</a>
+<a name="boost_bimap.future_work.rearrange_function_____________"></a><h4>
+<a name="id5000250"></a>
+ <a class="link" href="future_work.html#boost_bimap.future_work.rearrange_function_____________">Rearrange
+      Function &#37325;&#25490;&#20989;&#25968;</a>
     </h4>
 <p>
Boost.MultiIndex includes some others functions that can be included in the
-      views.</p><p>
-      Boost.MultiIndex 所含的一些其它函数,也可以包含到视图中。
+ views.<br> Boost.MultiIndex &#25152;&#21547;&#30340;&#19968;&#20123;&#20854;&#23427;&#20989;&#25968;&#65292;&#20063;&#21487;&#20197;&#21253;&#21547;&#21040;&#35270;&#22270;&#20013;&#12290;
     </p>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="test_suite.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html Mon Mar 8 01:27:36 2010
@@ -1,22 +1,23 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>MultiIndex and Bimap</title><link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>MultiIndex and Bimap</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="up" href="../history.html" title="History">
-<link rel="prev" href="../history.html" title="History">
-<link rel="next" href="../acknowledgements.html" title="Acknowledgements"></head> -<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../history.html" title="History &#21382;&#21490;">
+<link rel="prev" href="../history.html" title="History &#21382;&#21490;">
+<link rel="next" href="../acknowledgements.html" title="Acknowledgements &#40483;&#35874;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libraries.htm">Libraries</a></td> -<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="../history.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../history.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../acknowledgements.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
@@ -24,13 +25,14 @@
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.history.multiindex_and_bimap"></a><a class="link" href="multiindex_and_bimap.html" title="MultiIndex and Bimap">MultiIndex
-      and Bimap &nbsp;MultiIndex 和 Bimap</a>
+      and Bimap</a>
 </h3></div></div></div>
 <p>
This is the conversation thread that began during Boost.PropertyTree formal review process. The review was very interesting and very deep topics were addressed. It is quite interesting and it is now part of this library history. - Enjoy!</p><p>这是在 Boost.PropertyTree 的正式审查过程中开始的一系列 对话。这个审查非常有趣,而且谈及了非常深刻的话题。它很有趣,而且现在已成为本 库历史的一部分。希望你喜欢! + Enjoy!<br> &#36825;&#26159;&#22312; Boost.PropertyTree &#30340;&#27491;&#24335;&#23457;&#26597;&#36807;&#31243;&#20013;&#24320;&#22987;&#30340;&#19968;&#31995;&#21015;&#23545;&#35805;&#12290;&#36825;&#20010;&#23457;&#26597;&#38750;&#24120;&#26377;&#36259;&#65292;&#32780;&#19988;&#35848;&#21450;&#20102;&#38750;&#24120;&#28145;&#21051;&#30340;&#35805;&#39064;&#12290; + &#23427;&#24456;&#26377;&#36259;&#65292;&#32780;&#19988;&#29616;&#22312;&#24050;&#25104;&#20026;&#26412;&#24211;&#21382;&#21490;&#30340;&#19968;&#37096;&#20998;&#12290;&#24076;&#26395;&#20320;&#21916;&#27426;&#65281;
       </p>
 <p>
         <span class="bold"><strong>Marcin</strong></span>
@@ -40,10 +42,12 @@
           </p>
 <p>
<span class="emphasis"><em> The biggest virtue of property_tree is easy to use interface. - If we try to make generic tree of it, it will be compromised. </em></span> + If we try to make generic tree of it, it will be compromised.<br> property_tree + &#26368;&#22823;&#30340;&#20248;&#28857;&#26159;&#23427;&#26131;&#20110;&#20351;&#29992;&#30340;&#25509;&#21475;&#12290;&#22914;&#26524;&#25105;&#20204;&#23558;&#23427;&#21464;&#20026;&#27867;&#21270;&#30340;&#26641;&#65292;&#23427;&#23558;&#20250;&#21463;&#21040;&#25439;&#23475;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>property_tree 最大的优点是它易于使用的接 口。如果我们将它变为泛化的树,它将会受到损害。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Gennadiy</strong></span>
@@ -53,10 +57,11 @@
           </p>
 <p>
<span class="emphasis"><em> IMO the same result (as library presents) could be achieved
-            just by using multi_index. </em></span>
+ just by using multi_index.<br> &#22312;&#25105;&#30475;&#26469;&#65292;&#21482;&#20351;&#29992; multi_index + &#20063;&#33021;&#24471;&#21040;&#21516;&#26679;&#30340;&#25928;&#26524;(&#27491;&#22914;&#29616;&#22312;&#30340;&#24211;)&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>在我看来,只使用 multi_index 也能得到同 样的效果(正如现在的库)。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Marcin</strong></span>
@@ -69,11 +74,13 @@
to implement indexing for properties, but it only affected the implementation part of library, not interface, and because I already had a working, exception safe solution, I didn't see the reason to dump it and add another
-            dependency on another library. </em></span>
+ dependency on another library.<br> &#20320;&#33021;&#21542;&#26356;&#35814;&#32454;&#22320;&#35828;&#26126;&#19968;&#19979;&#65311;&#25105;&#32771;&#34385;&#36807;&#20351;&#29992; + multi_index &#26469;&#23454;&#29616;&#23646;&#24615;&#30340;&#32034;&#24341;&#65292;&#20294;&#23427;&#21482;&#23545;&#24211;&#30340;&#23454;&#29616;&#37096;&#20998;&#26377;&#24433;&#21709;&#65292; + &#23545;&#25509;&#21475;&#26159;&#27809;&#26377;&#24433;&#21709;&#30340;&#65292;&#25152;&#20197;&#25105;&#24050;&#32463;&#24320;&#22987;&#30528;&#25163;&#20102;&#19968;&#20010;&#24322;&#24120;&#23433;&#20840;&#30340;&#26041;&#27861;&#65292;&#25105;&#30475;&#19981;&#21040;&#26377;&#20160;&#20040;&#29702;&#30001;&#25918;&#24323;&#23427;&#24182;&#22686;&#21152;&#23545;&#21478;&#19968;&#20010;&#24211;&#30340;&#20381;&#36182;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>你能否更详细地说明一下?我考虑过使用 multi_index - 来实现属性的索引,但它只对库的实现部分有影响,对接口是没有影响 的,所以我已经开始着手了一个异常安全的方法,我看不到有什么理由放弃它并增加对 另一个库的依赖。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Gennadiy</strong></span>
@@ -87,18 +94,20 @@
data structure. You have parsers that produce property tree out of different sources. But you mat as well produce maps or something else. Here for example All that I need to do to "implement" similar functionality
-            as your property tree: </em></span>
+ as your property tree:<br> &#25105;&#30340;&#24847;&#24605;&#26159;&#65292;&#20026;&#20160;&#20040;&#25105;&#38656;&#35201;&#36825;&#20010;&#21322;&#25104;&#21697;&#30340; + property_tree &#20316;&#20026;&#21478;&#19968;&#20010;&#25968;&#25454;&#32467;&#26500;&#65311;&#23646;&#24615;&#26641;&#26412;&#36523;&#24182;&#19981;&#25903;&#25345;&#20160;&#20040;&#12290; + &#23427;&#21482;&#26159;&#19968;&#20010;&#25968;&#25454;&#32467;&#26500;&#12290;&#20320;&#26377;&#35299;&#26512;&#22120;&#20174;&#19981;&#21516;&#26469;&#28304;&#29983;&#25104;&#23646;&#24615;&#26641;&#12290;&#20294;&#20320;&#20498;&#19981;&#22914;&#29983;&#25104;&#26144;&#23556;&#25110;&#20854;&#23427;&#21035;&#30340;&#19996;&#35199;&#12290; + &#36825;&#26377;&#19968;&#20010;&#20363;&#23376;&#65292;&#25105;&#25152;&#38656;&#35201;&#20570;&#30340;&#23601;&#26159;"&#23454;&#29616;"&#21644;&#20320;&#30340;&#23646;&#24615;&#26641;&#25152;&#31867;&#20284;&#30340;&#21151;&#33021;&#65306;
+            </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>我的意思是,为什么我需要这个半成品的
-property_tree
-作为另一个数据结构?属性树本身并不支持什么。它只是一个数据结构。你有解析器 从不同来源生成属性树。但你倒不如生成映射或其它别的东西。这有一个例子,
-我所需要做的就是"实现"和你的属性树所类似的功能:</em></span></p>
+        </p>
 </blockquote></div>
 <p>

 </p>
-<pre class="programlisting"><span class="comment">// Data structure itself 数据结构本身<br></span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">ValueType</span><span class="special">,</span><span class="keyword">typename</span> <span class="identifier">KeyType</span><span class="special">&gt;</span> +<pre class="programlisting"><span class="comment">// Data structure itself &#25968;&#25454;&#32467;&#26500;&#26412;&#36523; +</span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">ValueType</span><span class="special">,</span><span class="keyword">typename</span> <span class="identifier">KeyType</span><span class="special">&gt;</span> <span class="keyword">struct</span> <span class="identifier">Node</span><span class="special">;</span> <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">ValueType</span><span class="special">,</span><span class="keyword">typename</span> <span class="identifier">KeyType</span><span class="special">&gt;</span> <span class="keyword">struct</span> <span class="identifier">ptree_gen</span> <span class="special">{</span>
@@ -110,14 +119,16 @@
<span class="identifier">ValueType</span> <span class="identifier">v</span><span class="special">;</span> <span class="identifier">ptree_gen</span><span class="special">&lt;</span><span class="identifier">ValueType</span><span class="special">,</span><span class="identifier">KeyType</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="identifier">children</span><span class="special">;</span>
 <span class="special">};</span>
-<span class="comment">// serialization support 序列化支持<br></span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Archive</span><span class="special">,</span><span class="keyword">typename</span> <span class="identifier">ValueType</span><span class="special">,</span><span class="keyword">typename</span> <span class="identifier">KeyType</span><span class="special">&gt;</span> +<span class="comment">// serialization support &#24207;&#21015;&#21270;&#25903;&#25345; +</span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">class</span> <span class="identifier">Archive</span><span class="special">,</span><span class="keyword">typename</span> <span class="identifier">ValueType</span><span class="special">,</span><span class="keyword">typename</span> <span class="identifier">KeyType</span><span class="special">&gt;</span> <span class="keyword">void</span> <span class="identifier">serialize</span><span class="special">(</span><span class="identifier">Archive</span> <span class="special">&amp;</span> <span class="identifier">ar</span><span class="special">,</span> <span class="identifier">Node</span><span class="special">&lt;</span><span class="identifier">ValueType</span><span class="special">,</span><span class="identifier">KeyType</span><span class="special">&gt;&amp;</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">unsigned</span> <span class="keyword">int</span> <span class="identifier">version</span><span class="special">)</span>
 <span class="special">{</span>
<span class="identifier">ar</span> <span class="special">&amp;</span> <span class="identifier">n</span><span class="special">.</span><span class="identifier">v</span><span class="special">;</span> <span class="identifier">ar</span> <span class="special">&amp;</span> <span class="identifier">n</span><span class="special">.</span><span class="identifier">children</span><span class="special">;</span>
 <span class="special">}</span>
-<span class="comment">// some access methods 一些访问方法<br></span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">ValueType</span><span class="special">,</span><span class="keyword">typename</span> <span class="identifier">KeyType</span><span class="special">&gt;</span> +<span class="comment">// some access methods &#19968;&#20123;&#35775;&#38382;&#26041;&#27861; +</span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> <span class="identifier">ValueType</span><span class="special">,</span><span class="keyword">typename</span> <span class="identifier">KeyType</span><span class="special">&gt;</span> <span class="identifier">ValueType</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">get</span><span class="special">(</span> <span class="identifier">string</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">keys</span><span class="special">,</span> <span class="identifier">ptree_gen</span><span class="special">&lt;</span><span class="identifier">ValueType</span><span class="special">,</span><span class="identifier">KeyType</span><span class="special">&gt;::</span><span class="identifier">type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="identifier">src</span> <span class="special">)</span>
 <span class="special">{</span>
@@ -132,10 +143,10 @@
 <p>
           </p>
 <p>
-            <span class="emphasis"><em> Use it like this: </em></span>
+ <span class="emphasis"><em> Use it like this:<br> &#23427;&#30340;&#29992;&#27861;&#22914;&#19979;&#65306; </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>它的用法如下:</em></span></p>
+        </p>
 </blockquote></div>
 <p>

@@ -152,11 +163,12 @@
           </p>
 <p>
<span class="emphasis"><em> Now tell me how property_tree interface is easier? And what - is the value in 50k of Code you need to implement this data structure. + is the value in 50k of Code you need to implement this data structure.<br> + &#29616;&#22312;&#35831;&#21578;&#35785;&#25105;&#65292;property_tree &#30340;&#25509;&#21475;&#22914;&#20309;&#26356;&#26131;&#29992;&#65311;&#20320;&#35201;&#29992;50k&#20195;&#30721;&#26469;&#23454;&#29616;&#36825;&#20010;&#25968;&#25454;&#32467;&#26500;&#26377;&#20160;&#20040;&#20215;&#20540;&#12290;
             </em></span>
           </p>
 <p>
- <span class="emphasis"><em>现在请告诉我,property_tree 的接口如何更 易用?你要用50k代码来实现这个数据结构有什么价值。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Thorsten</strong></span>
@@ -166,10 +178,11 @@
           </p>
 <p>
<span class="emphasis"><em> Seriously Gennadiy, do you really see newbies writing the
-            code you just did? </em></span>
+ code you just did?<br> &#35748;&#30495;&#30340; Gennadiy&#65292;&#20320;&#30495;&#30340;&#30475;&#19981;&#20986;&#20320;&#21018;&#25165;&#25152;&#20570;&#30340;&#26159;&#26032;&#25163;&#20889;&#30340;&#20195;&#30721;&#65311;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em> 认真的 Gennadiy,你真的看不出你刚才所做 的是新手写的代码?</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Marcin</strong></span>
@@ -187,13 +200,15 @@
trying to smooth rough edges in the interface. Then write tests. Write docs. At the end, I believe you will not get much less code than there is in the library already. Maybe you get some savings by using multi_index
-            instead of manual indexing. </em></span>
+ instead of manual indexing.<br> &#20320;&#21018;&#25165;&#25152;&#20889;&#26159;&#21098;&#19979;&#26469;&#30340; property_tree + &#30340;&#39592;&#24178;&#29256;&#26412;&#65292;&#19981;&#20801;&#35768;&#20320;&#29983;&#25104;&#29992;&#25143;&#21487;&#32534;&#36753;&#30340; XML &#25991;&#20214;&#12290; + &#29616;&#22312;&#24050;&#22686;&#21152;&#20102;&#26356;&#22810;&#30340;&#25509;&#21475;(&#22914; get &#20989;&#25968;)&#65292;&#20026;&#24207;&#21015;&#21270;&#24211;&#22686;&#21152;&#20102;&#26356;&#22810;&#23384;&#26723;&#26684;&#24335;&#65292;&#22686;&#21152;&#23458;&#25143;&#21270;&#65292;&#22686;&#21152;&#20102;&#20174;&#23383;&#31526;&#20018;&#30340;&#36879;&#26126;&#36716;&#25442;&#21450;&#30456;&#21453;&#25805;&#20316;&#12290; + &#20320;&#20808;&#33457;&#20102;&#20960;&#21608;&#26469;&#35753;&#25152;&#26377;&#26497;&#31471;&#30340;&#26696;&#20363;&#27491;&#30830;&#36816;&#34892;&#65292;&#36824;&#26377;&#20960;&#21608;&#29992;&#20110;&#35797;&#22270;&#25226;&#25509;&#21475;&#36793;&#30028;&#21464;&#24179;&#28369;&#12290;&#28982;&#21518;&#32534;&#20889;&#27979;&#35797;&#65292;&#32534;&#20889;&#25991;&#26723;&#12290; + &#26368;&#21518;&#65292;&#25105;&#30456;&#20449;&#20320;&#19981;&#20250;&#24471;&#21040;&#27604;&#26412;&#24211;&#26356;&#23569;&#30340;&#20195;&#30721;&#12290;&#20063;&#35768;&#20320;&#20250;&#29992; + multi_index &#26367;&#20195;&#25163;&#24037;&#32034;&#24341;&#26469;&#33410;&#30465;&#19968;&#20123;&#20195;&#30721;&#12290; </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>你刚才所写是剪下来的 property_tree
-的骨干版本,不允许你生成用户可编辑的 XML 文件。现在已增加了更多的接口(如 get -函数),为序列化库增加了更多存档格式,增加客户化,增加了从字符串的透明转换及 相反操作。你先花了几周来让所有极端的案例正确运行,还有几周用于试图把 -接口边界变平滑。然后编写测试,编写文档。最后,我相信你不会得到比本库更少的 代码。也许你会用 multi_index 替代手工索引来节省一些代码。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -204,17 +219,17 @@
even I knew of multi index existence. It was working well. Later, when I was improving it during pre-review process, I seriously considered using multi-index. But I decided it is not worth throwing everything
-            out. </em></span>
+ out.<br> ptree &#19981;&#20351;&#29992; multi index &#30340;&#21407;&#22240;&#26159;&#65292;&#22240;&#20026;&#22312;&#25105;&#32771;&#34385;&#23558;&#23427;&#25552;&#20132;&#21040; + boost &#20043;&#21069;&#24456;&#20037;&#35813;&#23454;&#29616;&#23601;&#24050;&#32463;&#23384;&#22312;&#20102;&#65292;&#29978;&#33267;&#21487;&#33021;&#26159;&#22312;&#25105;&#30693;&#36947;&#26377; + multi index &#20043;&#21069;&#12290; &#23427;&#24037;&#20316;&#24471;&#24456;&#22909;&#12290;&#20197;&#21518;&#24403;&#25105;&#22312;&#39044;&#23457;&#26597;&#36807;&#31243;&#20013;&#23545;&#23427;&#36827;&#34892;&#25913;&#36827;&#26102;&#65292;&#25105;&#20250;&#35748;&#30495;&#32771;&#34385;&#20351;&#29992; + multi-index&#12290;&#20294;&#25105;&#35748;&#20026;&#19981;&#20540;&#24471;&#25243;&#24323;&#25152;&#26377;&#19968;&#20999;&#12290; </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>ptree 不使用 multi index
-的原因是,因为在我考虑将它提交到 boost 之前很久该实现就已经存在了,甚至可能 是在我知道有 multi index -之前。它工作得很好。以后当我在预审查过程中对它进行改进时,我会认真考虑使用 multi-index。但我认为不值得抛弃所有一切。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
-
 <p>
<span class="emphasis"><em> Although ptree has large interface with many functions modifying
             state of the tree, it uses "single point of change" approach.
@@ -223,13 +238,16 @@
to erase. This function has 9 lines of code in case of insert, and (by coincidence) also 9 in case of erase. By using multi index these functions would obviously be simplified, maybe to 4 lines each. Net gain: 10 lines - of code (out of several hundred in ptree_implementation.hpp).</em></span></p> + of code (out of several hundred in ptree_implementation.hpp).<br> &#34429;&#28982; + ptree &#24102;&#26377;&#24456;&#22823;&#30340;&#25509;&#21475;&#65292;&#23427;&#26377;&#24456;&#22810;&#20989;&#25968;&#26469;&#20462;&#25913;&#26641;&#30340;&#29366;&#24577;&#65292;&#23427;&#20351;&#29992;&#20102; + "&#21333;&#28857;&#20462;&#25913;" &#26041;&#27861;&#12290; &#27599;&#20010;&#25554;&#20837;&#26368;&#32456;&#37117;&#36890;&#36807;&#19968;&#20010;&#20989;&#25968;&#23436;&#25104;&#65292;&#35813;&#20989;&#25968;&#32771;&#34385;&#20102;&#24322;&#24120;&#23433;&#20840;&#24615;&#65292;&#24182;&#20445;&#25345;&#25968;&#25454;&#21644;&#32034;&#24341;&#30340;&#21516;&#27493;&#12290; + &#23545;&#20110;&#21024;&#38500;&#20063;&#19968;&#26679;&#12290;&#36825;&#20010;&#20989;&#25968;&#26377;9&#34892;&#20195;&#30721;&#29992;&#20110;&#25554;&#20837;&#65292;&#21516;&#26679;&#20063;&#26377;9&#34892;&#29992;&#20110;&#21024;&#38500;&#12290;&#36890;&#36807;&#20351;&#29992; + multi index&#65292;&#36825;&#20123;&#20989;&#25968;&#21487;&#20197;&#26126;&#26174;&#31616;&#21270;&#65292;&#20063;&#35768;&#27599;&#20010;&#21482;&#35201;4&#34892;&#12290; + &#20928;&#25910;&#30410;&#65306;10&#34892;&#20195;&#30721;(&#30456;&#23545;&#20110; ptree_implementation.hpp &#30340;&#20960;&#30334;&#34892;&#20195;&#30721;)&#12290;
+            </em></span>
+          </p>
 <p>
-            <span class="emphasis"><em>虽然 ptree
-带有很大的接口,它有很多函数来修改树的状态,它使用了 "单点修改"
-方法。每个插入最终都通过一个函数完成,该函数考虑了异常安全性,并保持数据和 索引的同步。对于删除也一样。这个函数有9行代码用于插入,同样也有9行用 -于删除。通过使用 multi index,这些函数可以明显简化,也许每个只要4行。净收 益:10行代码(相对于
-ptree_implementation.hpp 的几百行代码)。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -237,10 +255,11 @@
 <p>
<span class="emphasis"><em> I'm aware that there are performance gains to be reaped as well, but at that time I was rather focusing on getting the interface
-            right. </em></span>
+ right.<br> &#25105;&#30693;&#36947;&#36824;&#21487;&#20197;&#33719;&#24471;&#24615;&#33021;&#30340;&#25552;&#21319;&#65292;&#20294;&#26159;&#24403;&#26102;&#25105;&#21482;&#20851;&#27880;&#20110;&#25509;&#21475;&#30340;&#27491;&#30830;&#24615;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我知道还可以获得性能的提升,但是当时我只 关注于接口的正确性。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Dave</strong></span>
@@ -251,11 +270,12 @@
 <p>
<span class="emphasis"><em> That's perfectly reasonable, but (through no fault of yours) it misses the point I was trying to make. I guess I should have said, - "...that demonstrates it to be the best implementation." </em></span>
+            "...that demonstrates it to be the best implementation."<br>
+ &#36825;&#26159;&#23436;&#20840;&#21512;&#29702;&#30340;&#65292;&#20294;&#26159;(&#36825;&#19981;&#26159;&#20320;&#30340;&#38169;)&#23427;&#35823;&#20250;&#20102;&#25105;&#30340;&#35266;&#28857;&#12290;&#25105;&#24819;&#25105;&#24212;&#35813;&#35828;, + "...&#36825;&#34920;&#31034;&#23427;&#26159;&#26368;&#22909;&#30340;&#23454;&#29616;&#12290;" </em></span>
           </p>
 <p>
- <span class="emphasis"><em>这是完全合理的,但是(这不是你的错)它误会 了我的观点。我想我应该说,
-            "...这表示它是最好的实现。"</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -264,11 +284,13 @@
<span class="emphasis"><em> All I'm saying is that the extent to which a Boost library implementation should leverage other Boost libraries is not a question that can always be decided based on following simple guidelines, and - that if this library is accepted, it's worth revisiting your decision. + that if this library is accepted, it's worth revisiting your decision.<br> + &#25105;&#35201;&#35828;&#30340;&#26159;&#65292;&#19968;&#20010; Boost &#24211;&#30340;&#23454;&#29616;&#30340;&#31243;&#24230;&#24212;&#35813;&#20419;&#36827;&#20854;&#23427;&#30340; + Boost &#24211;&#65292;&#36825;&#19981;&#26159;&#19968;&#20010;&#38382;&#39064;&#65292; &#23427;&#24212;&#35813;&#22522;&#20110;&#20197;&#19979;&#30340;&#31616;&#21333;&#25351;&#24341;&#26469;&#20915;&#23450;&#65292;&#22914;&#26524;&#36825;&#20010;&#24211;&#26159;&#34987;&#25509;&#21463;&#30340;&#65292;&#23601;&#20540;&#24471;&#37325;&#26032;&#23457;&#35270;&#20320;&#30340;&#20915;&#23450;&#12290;
             </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我要说的是,一个 Boost 库的实现的程度应 该促进其它的 Boost 库,这不是一个问题,它应该基于以下的简单指引来决定,如果 这个库是被接受的,就值得重新审视你的决定。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Thorsten</strong></span>
@@ -278,39 +300,42 @@
           </p>
 <p>
<span class="emphasis"><em> I think it is important to focus on the interface in the review, - but I also see several benefits of an implementation that builds on Boost.MultiIndex:'
-            </em></span>
+ but I also see several benefits of an implementation that builds on Boost.MultiIndex:'<br> + &#25105;&#24819;&#22312;&#23457;&#26597;&#20013;&#65292;&#37325;&#35201;&#30340;&#26159;&#20851;&#27880;&#25509;&#21475;&#65292;&#20294;&#26159;&#25105;&#20063;&#30475;&#21040;&#20102;&#29992; + Boost.MultiIndex &#26469;&#26500;&#24314;&#30340;&#20960;&#20010;&#20248;&#28857;&#65306; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我想在审查中,重要的是关注接口,但是我也 看到了用 Boost.MultiIndex 来构建的几个优点:</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
- <span class="emphasis"><em>- fewer bugs like the one Joaquin found</em></span> + <span class="emphasis"><em>- fewer bugs like the one Joaquin found<br> - &#26356;&#23569;&#30340;&#32570;&#38519;&#65292;&#35937;
+            Joaquin &#21457;&#29616;&#30340;&#37027;&#20010;</em></span>
           </p>
 <p>
- <span class="emphasis"><em>- 更少的缺陷,象 Joaquin 发现的那个 </em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
- <span class="emphasis"><em>- better space efficiency</em></span> + <span class="emphasis"><em>- better space efficiency<br> - &#26356;&#22909;&#30340;&#31354;&#38388;&#25928;&#29575;</em></span>
           </p>
 <p>
-        <span class="emphasis"><em>- 更好的空间效率</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
<span class="emphasis"><em>- exception-safety guarantees are immediately full-filled (I - haven't looked, but I suspect that there are several bugs in this area)</em></span> + haven't looked, but I suspect that there are several bugs in this area)<br> + - &#24322;&#24120;&#23433;&#20840;&#24615;&#20445;&#35777;&#21487;&#20197;&#31435;&#21363;&#28385;&#36275;(&#25105;&#36824;&#27809;&#26377;&#30475;&#36807;&#65292;&#20294;&#25105;&#24576;&#30097;&#22312;&#36825;&#26041;&#38754;&#23384;&#22312;&#19968;&#20123;&#32570;&#38519;)</em></span>
           </p>
 <p>
- <span class="emphasis"><em>- 异常安全性保证可以立即满足(我还没有看 过,但我怀疑在这方面存在一些缺陷)</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Daniel</strong></span>
@@ -324,11 +349,15 @@
one, but I would happily use property_tree. I've also only used multi_index once, and that was to use it as a bidirectional map. Property_tree covers other areas as well as being a potential subset of an XML library, but
-            I still hold there is value in such a subset. </em></span>
+ I still hold there is value in such a subset.<br> Multi_index &#25903;&#25345; + bimap &#25152;&#35201;&#30340;&#20219;&#20309;&#19996;&#35199;&#65292;&#20294;&#23427;&#30340;&#25509;&#21475;&#22826;&#36807;&#31528;&#37325;&#12290;&#25105;&#19981;&#20250;&#20351;&#29992;&#19968;&#20010;&#35937; + W3DOM &#37027;&#26679;&#30340;&#24211;&#65292; &#20294;&#26159;&#25105;&#20250;&#24456;&#39640;&#20852;&#20351;&#29992; property_tree&#12290;&#25105;&#20063;&#21482;&#29992;&#36807; + multi_index &#19968;&#27425;&#65292;&#26159;&#25226;&#23427;&#29992;&#20316;&#19968;&#20010;&#21452;&#21521;&#26144;&#23556;&#12290; Property_tree + &#28085;&#30422;&#20102;&#20854;&#23427;&#26041;&#38754;&#65292;&#24182;&#20316;&#20026;&#19968;&#20010; XML &#24211;&#30340;&#28508;&#22312;&#23376;&#38598;&#65292;&#20294;&#25105;&#20173;&#28982;&#35748;&#20026;&#36825;&#26679;&#30340;&#23376;&#38598;&#26159;&#26377;&#20215;&#20540;&#30340;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em> Multi_index 支持 bimap 所要的任何东 西,但它的接口太过笨重。我不会使用一个象 W3DOM 那样的库,但是我会很高兴使用 property_tree。我也只用过 multi_index - 一次,是把它用作一个双向映射。Property_tree 涵盖了其它方面,并 作为一个 XML 库的潜在子集,但我仍然认为这样的子集是有价值的。 </em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Boris</strong></span>
@@ -340,10 +369,11 @@
<span class="emphasis"><em> I haven't used program_options yet. But if I understand correctly both libraries seem to support storing and accessing data with strings that might describe some kind of hierarchy. This seems to be the core
-            idea of both libraries - is this correct? </em></span>
+ idea of both libraries - is this correct?<br> &#25105;&#36824;&#27809;&#26377;&#29992;&#36807; program_options&#12290;&#20294;&#22914;&#26524;&#25105;&#30340;&#29702;&#35299;&#26159;&#27491;&#30830;&#30340;&#65292;&#36825;&#20004;&#20010;&#24211;&#20284;&#20046;&#37117;&#25903;&#25345;&#20197;&#21487;&#33021;&#25551;&#36848;&#20102;&#26576;&#31181;&#23618;&#27425;&#30340;&#23383;&#31526;&#20018;&#26469;&#20445;&#23384;&#21644;&#35775;&#38382;&#25968;&#25454;&#12290; + &#36825;&#20284;&#20046;&#26159;&#36825;&#20004;&#20010;&#24211;&#30340;&#26680;&#24515;&#29702;&#24565; - &#36825;&#26159;&#27491;&#30830;&#30340;&#21527;&#65311; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我还没有用过 program_options。但如果我的 理解是正确的,这两个库似乎都支持以可能描述了某种层次的字符串来保存和访问数 据。这似乎是这两个库的核心理念 - 这是正确的吗?</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -352,10 +382,11 @@
<span class="emphasis"><em> Then it wouldn't matter much what container is used. However a generic tree which can store data hierarchically probably makes most sense. If I understand correctly both libraries could make use of such
-            a class? </em></span>
+ a class?<br> &#37027;&#20040;&#23427;&#24182;&#19981;&#27604;&#24050;&#32463;&#20351;&#29992;&#30340;&#23481;&#22120;&#22810;&#20123;&#20160;&#20040;&#65311;&#19968;&#33324;&#30340;&#26641;&#37117;&#21487;&#20197;&#25353;&#23618;&#27425;&#23384;&#20648;&#25968;&#25454;&#65292;&#21487;&#33021;&#26356;&#26377;&#24847;&#20041;&#12290;&#22914;&#26524;&#25105;&#29702;&#35299;&#24471;&#27491;&#30830;&#30340;&#35805;&#65292;&#26159;&#21542;&#20004;&#20010;&#24211;&#37117;&#21487;&#20197;&#21033;&#29992;&#36825;&#26679;&#30340;&#31867;&#65311;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>那么它并不比已经使用的容器多些什么?一般 的树都可以按层次存储数据,可能更有意义。如果我理解得正确的话,是否两个库都可 以利用这样的类?</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Marcin</strong></span>
@@ -363,16 +394,20 @@
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
-
 <p>
<span class="emphasis"><em> I think generic tree container is material for another library. Whether property_tree should be based on it or not is a matter of internal implementation, and generally of little interest to users. The biggest value of property_tree is in its easy to use interface, that should not be compromised, if at all possible. I have been already reassured in - this view by quite many people who took their time to review the library.</em></span></p> + this view by quite many people who took their time to review the library.<br> + &#25105;&#35273;&#24471;&#36890;&#29992;&#30340;&#26641;&#23481;&#22120;&#26159;&#21478;&#19968;&#20010;&#24211;&#30340;&#21407;&#26448;&#26009;&#12290;property_tree + &#26159;&#21542;&#24212;&#35813;&#22522;&#20110;&#23427;&#65292;&#26159;&#19968;&#20010;&#20869;&#37096;&#23454;&#29616;&#30340;&#38382;&#39064;&#65292;&#36890;&#24120;&#29992;&#25143;&#19981;&#24863;&#20852;&#36259;&#12290; + property_tree &#30340;&#26368;&#22823;&#20215;&#20540;&#26159;&#23427;&#23481;&#26131;&#20351;&#29992;&#30340;&#25509;&#21475;&#65292;&#22914;&#26524;&#21487;&#33021;&#30340;&#35805;&#65292;&#36825;&#19981;&#24212;&#34987;&#25439;&#23475;&#12290;&#25105;&#24050;&#32463;&#20174;&#33457;&#26102;&#38388;&#26469;&#23457;&#26597;&#26412;&#24211;&#30340;&#22810;&#25968;&#20154;&#20013;&#24471;&#21040;&#20445;&#35777;&#12290;
+            </em></span>
+          </p>
 <p>
- <span class="emphasis"><em>我觉得通用的树容器是另一个库的原材 料。property_tree 是否应该基于它,是一个内部实现的问题,通常用户不感兴趣。 property_tree 的最大价值是它容易使用的接口,如果可能的话,这不应被损害。我已 经从花时间来审查本库的多数人中得到保证。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Boris</strong></span>
@@ -386,11 +421,13 @@
algorithms etc. instead of having a C++ standard with hundreds of components which are tailored for specific needs, collaborate with only a handful of other components and think they provide an easy-to-use interface while - all the easy-to-use interfaces make the whole standard less easy-to-use. + all the easy-to-use interfaces make the whole standard less easy-to-use.<br> + &#25105;&#23581;&#35797;&#20174;&#22823;&#30340;&#26041;&#38754;&#26469;&#30475;&#65306;&#25105;&#23425;&#24895;&#35201;&#19968;&#20010;&#22522;&#20110;&#23569;&#37327;&#33879;&#21517;&#27010;&#24565;&#22914;&#23481;&#22120;&#12289;&#36845;&#20195;&#22120;&#12289;&#31639;&#27861;&#31561;&#30340;C++&#26631;&#20934;&#65292; + &#32780;&#19981;&#35201;&#19968;&#20010;&#26377;&#25968;&#30334;&#20010;&#29305;&#23450;&#38656;&#35201;&#30340;&#32452;&#20214;&#12289;&#21482;&#26377;&#23569;&#25968;&#32452;&#20214;&#21487;&#20197;&#21512;&#20316;&#30340;C++&#26631;&#20934;&#65292;&#27599;&#20010;&#32452;&#20214;&#24212;&#25552;&#20379;&#26131;&#29992;&#30340;&#25509;&#21475;&#32780;&#25152;&#26377;&#26131;&#29992;&#30340;&#25509;&#21475;&#21487;&#20197;&#20351;&#25972;&#20010;&#26631;&#20934;&#26131;&#20110;&#20351;&#29992;&#12290;
             </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我尝试从大的方面来看:我宁愿要一个基于少 量著名概念如容器、迭代器、算法等的C++标准,而不要一个有数百个特定需要的组 件、只有少数组件可以合作的C++标准,每个组件应提供易用的接口而所有易用的接口 可以使整个标准易于使用。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -402,11 +439,14 @@
before like eg. an iterator. For now I will definitely use your property tree library but would appreciate if existing concepts were reused many C++ developers are familiar with. My opinion is that your library should - be a part of Boost but should be more generalized in the future. </em></span> + be a part of Boost but should be more generalized in the future.<br> + &#25105;&#29992;&#36807;&#20320;&#30340; property tree &#24211;&#26469;&#35835;&#20889;&#19968;&#20010;&#37197;&#32622;&#25991;&#20214;&#12290;&#23427;&#30830;&#23454;&#24456;&#23481;&#26131;&#20351;&#29992;&#12290;&#20294;&#26159;&#65292;&#22914;&#26524;&#23427;&#20855;&#26377;&#25105;&#24050;&#30693;&#30340;&#26576;&#20123;&#19996;&#35199;&#65292;&#22914;&#36845;&#20195;&#22120;&#65292;&#30340;&#35805;&#65292;&#20250;&#26356;&#26131;&#29992;&#12290; + &#29616;&#22312;&#65292;&#25105;&#19968;&#23450;&#20250;&#20351;&#29992;&#20320;&#30340; property tree &#24211;&#65292;&#20294;&#26159;&#22914;&#26524;&#33021;&#22815;&#22797;&#29992;&#24050;&#26377;&#30340;&#12289;&#20026;&#24191;&#22823;C++&#24320;&#21457;&#32773;&#25152;&#29087;&#24713;&#30340;&#27010;&#24565;&#65292;&#23601;&#26356;&#22909;&#20102;&#12290; + &#25105;&#30340;&#24847;&#35265;&#26159;&#65292;&#20320;&#30340;&#24211;&#24212;&#35813;&#25104;&#20026; Boost &#30340;&#19968;&#37096;&#20998;&#65292;&#20294;&#26159;&#22312;&#20197;&#21518;&#24212;&#35813;&#26356;&#20026;&#36890;&#29992;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我用过你的 property tree 库来读写一个配 置文件。它确实很容易使用。但是,如果它具有我已知的某些东西,如迭代器,的 话,会更易用。现在,我一定会使用你的 property - tree 库,但是如果能够复用已有的、为广大C++开发者所熟悉的概 念,就更好了。我的意见是,你的库应该成为 Boost 的一部分,但是在以后应该更为 通用。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Thorsten</strong></span>
@@ -418,10 +458,12 @@
<span class="emphasis"><em> Well, I think we need both. Boost.MultiIndex is a great library and can do all kinds of wonderful things. But I would still like to see a bidirectional map (boost::bimap) written as a wrapper around it to
-            get an easy and specialized interface. </em></span>
+ get an easy and specialized interface.<br> &#22909;&#30340;&#65292;&#25105;&#24819;&#25105;&#20204;&#20004;&#20010;&#37117;&#38656;&#35201;&#12290;Boost.MultiIndex + &#26159;&#19968;&#20010;&#24378;&#22823;&#30340;&#24211;&#65292;&#21487;&#20197;&#20570;&#21508;&#31181;&#22855;&#22937;&#30340;&#20107;&#24773;&#12290; &#20294;&#26159;&#25105;&#20063;&#24819;&#30475;&#21040;&#19968;&#20010;&#21452;&#21521;&#26144;&#23556;(boost::bimap)&#65292;&#20316;&#20026;&#23427;&#30340;&#19968;&#20010;&#21253;&#35013;&#22120;&#65292;&#20855;&#26377;&#26131;&#29992;&#21644;&#29305;&#21270;&#30340;&#25509;&#21475;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>好的,我想我们两个都需要。 Boost.MultiIndex 是一个强大的库,可以做各种奇妙的事情。但是我也想看到一个双 向映射(boost::bimap),作为它的一个包装器,具有易用和特化的接口。 </em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Pavel</strong></span>
@@ -430,11 +472,11 @@
 <p>
           </p>
 <p>
- <span class="emphasis"><em> Bimap is available in libs/multi-index/examples/bimap.cpp.
-            </em></span>
+ <span class="emphasis"><em> Bimap is available in libs/multi-index/examples/bimap.cpp.<br> + Bimap &#24050;&#22312; libs/multi-index/examples/bimap.cpp &#19979;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em> Bimap 已在 libs/multi-index/examples/bimap.cpp 下。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Thorsten</strong></span>
@@ -444,10 +486,12 @@
           </p>
 <p>
<span class="emphasis"><em> Right, but the real value comes when somebody designs a nice - STL-like interface and write docs etc, at least that was my point. </em></span> + STL-like interface and write docs etc, at least that was my point.<br> + &#22909;&#30340;&#65292;&#20294;&#21482;&#26377;&#24403;&#26377;&#20154;&#35774;&#35745;&#20102;&#19968;&#20010;&#31867;&#20284;&#20110;STL&#30340;&#25509;&#21475;&#24182;&#19988;&#20889;&#20986;&#25991;&#26723;&#26102;&#65292;&#25165;&#26377;&#30495;&#27491;&#30340;&#20215;&#20540;&#65292;&#33267;&#23569;&#25105;&#26159;&#36825;&#20040;&#35748;&#20026;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>好的,但只有当有人设计了一个类似于STL的 接口并且写出文档时,才有真正的价值,至少我是这么认为。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Dave</strong></span>
@@ -458,10 +502,12 @@
 <p>
<span class="emphasis"><em> IMO Thorsten is exactly right. This is precisely the sort of thing that could be added to the library as part of its ongoing maintenance
-            and development (without review, of course). </em></span>
+ and development (without review, of course).<br> &#22312;&#25105;&#30475;&#26469;&#65292;Thorsten + &#26159;&#23545;&#30340;&#12290;&#27491;&#26159;&#36825;&#20123;&#19996;&#35199;&#21487;&#20197;&#21152;&#20837;&#21040;&#24211;&#20013;&#65292;&#20316;&#20026;&#32500;&#25252;&#21644;&#24320;&#21457;&#30340;&#19968;&#37096;&#20998;(&#24403;&#28982;&#26080;&#38656;&#23457;&#26597;)&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>在我看来,Thorsten 是对的。正是这些东西 可以加入到库中,作为维护和开发的一部分(当然无需审查)。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -472,10 +518,11 @@
 <p>
<span class="emphasis"><em> Thorsten, we have talked about this privately in the past, but I feel like bringing it to the list in the hope of getting the attention
-            of potential contributors: </em></span>
+ of potential contributors:<br> Thorsten, &#36807;&#21435;&#25105;&#20204;&#24050;&#32463;&#31169;&#19979;&#35752;&#35770;&#36825;&#19968;&#28857;&#65292;&#25105;&#24819;&#25226;&#23427;&#25918;&#21040;&#21015;&#34920;&#20013;&#65292;&#24076;&#26395;&#24471;&#21040;&#28508;&#22312;&#30340;&#36129;&#29486;&#32773;&#30340;&#20851;&#27880;&#65306;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em> Thorsten, 过去我们已经私下讨论这一 点,我想把它放到列表中,希望得到潜在的贡献者的关注:</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -486,11 +533,13 @@
map or bimap. A lean and mean implementation is provided in the aforementioned example, but certainly a much carefully crafted interface can be provided keeping B.MI as the implementation core: operator[], selection of 1-1/1-N/N-1/N-N
-            variants, hashing/ordering, etc. </em></span>
+ variants, hashing/ordering, etc.<br> &#26377;&#20123;&#21487;&#20197;&#29992; B.MI &#26500;&#24314;&#30340;&#25968;&#25454;&#32467;&#26500;&#34987;&#35748;&#20026;&#26159;&#29305;&#21035;&#26377;&#29992;&#25110;&#36890;&#29992;&#30340;&#65292;&#20363;&#22914;&#21452;&#21521;&#26144;&#23556;&#25110; + bimap&#12290; &#22312;&#19978;&#36848;&#20363;&#23376;&#20013;&#25552;&#20379;&#20102;&#19968;&#20010;&#31934;&#31616;&#30340;&#23454;&#29616;&#65292;&#20294;&#26159;&#26080;&#30097;&#65292;&#21487;&#20197;&#25552;&#20379;&#19968;&#20010;&#31934;&#24515;&#21046;&#20316;&#30340;&#25509;&#21475;&#24182;&#20197; + B.MI &#20316;&#20026;&#23454;&#29616;&#26680;&#24515;&#65306; operator[], 1-1/1-N/N-1/N-N &#22810;&#31181;&#36873;&#25321;&#65292;&#25955;&#21015;/&#25490;&#24207;&#65292;&#31561;&#31561;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>有些可以用 B.MI 构建的数据结构被认为是特 别有用或通用的,例如双向映射或 bimap。在上述例子中提供了一个精简的实现,但是 无疑,可以提供一个精心制作的接口并以 B.MI 作为实现核心:operator[], 1-1/1-N/N-1/N-N
-            多种选择,散列/排序,等等。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -502,11 +551,15 @@
jumping in who can develop this and other singular containers using B.MI (a cache container comes to mind) and then propose the results here either as a stand alone library of as part of B.MI --I'd prefer the former so
-            as to keep the size of B.MI bounded. </em></span>
+ as to keep the size of B.MI bounded.<br> &#25105;&#24656;&#24597;&#27809;&#26377;&#26102;&#38388;&#21435;&#36861;&#27714;&#36825;&#19968;&#28857;&#65292;&#22240;&#20026;&#24403;&#21069;&#30340; + B.MI &#26680;&#24515;&#29305;&#24615;&#30340;&#36335;&#32447;&#22270;&#24050;&#32463;&#21344;&#25454;&#20102;&#25105;&#21487;&#20197;&#22857;&#29486;&#32473;&#26412;&#24211;&#30340;&#25152;&#26377;&#31354;&#38386;&#26102;&#38388;&#12290; + &#22240;&#27492;&#65292;&#25105;&#24076;&#26395;&#30475;&#21040;&#26377;&#19968;&#20123;&#24535;&#24895;&#32773;&#21487;&#20197;&#21442;&#19982;&#24320;&#21457;&#26412;&#24211;&#21644;&#20854;&#23427;&#20351;&#29992; + B.MI &#30340;&#29305;&#23450;&#23481;&#22120;(&#27491;&#22312;&#32771;&#34385;&#19968;&#20010;&#32531;&#20914;&#23481;&#22120;)&#65292;&#28982;&#21518;&#32473;&#20986;&#32467;&#26524;&#65292; + &#26080;&#35770;&#26159;&#20316;&#20026;&#19968;&#20010;&#29420;&#31435;&#30340;&#24211;&#36824;&#26159; B.MI &#30340;&#19968;&#37096;&#20998; -- &#25105;&#23425;&#24895;&#36873;&#25321;&#21069;&#32773;&#65292;&#20197;&#20445;&#25345; + B.MI &#30340;&#36793;&#30028;&#22823;&#23567;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我恐怕没有时间去追求这一点,因为当前的 B.MI&nbsp;核心特性的路线图已经占据了我可以奉献给本库的所有空闲时间。因此,我 希望看到有一些志愿者可以参与开发本库和其它使用 B.MI - 的特定容器(</em></span><span class="emphasis"><em>正在考虑 </em></span><span class="emphasis"><em>一个缓冲容器),然后给出结果,无论是作 为一个独立的库还是 B.MI 的一部分 -- 我宁愿选择前者,以保持 B.MI 的边界大小。 </em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -514,11 +567,11 @@
 <p>
<span class="emphasis"><em> If there's such a volunteer I can provide her with some help/mentoring. I also wonder whether this is a task suitable to be proposed for Google
-            Summer of Code. </em></span>
+ Summer of Code.<br> &#22914;&#26524;&#26377;&#36825;&#26679;&#30340;&#24535;&#24895;&#32773;&#65292;&#25105;&#21487;&#20197;&#25552;&#20379;&#19968;&#20123;&#24110;&#21161;/&#25351;&#23548;&#12290;&#25105;&#24819;&#30693;&#36947;&#36825;&#20010;&#20219;&#21153;&#26159;&#21542;&#36866;&#21512;&#20316;&#20026; + Google Summer of Code &#30340;&#25552;&#35758;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>如果有这样的志愿者,我可以提供一些帮助 /指导。我想知道这个任务是否适合作为 Google
-            Summer of Code 的提议。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Thorsten</strong></span>
@@ -529,10 +582,12 @@
 <p>
<span class="emphasis"><em> I think it would be good for SOC. All the really hard things are taken care of by B.MI, and so it seems reasonable for a student to
-            be able to fill in the details. </em></span>
+ be able to fill in the details.<br> &#25105;&#24819;&#23427;&#20316;&#20026; SOC &#19981;&#38169;&#12290;&#25152;&#26377;&#36739;&#22256;&#38590;&#30340;&#20107;&#24773;&#30001; + B.MI &#36127;&#36131;&#65292;&#25152;&#20197;&#23427;&#30475;&#26469;&#27604;&#36739;&#36866;&#21512;&#35753;&#23398;&#29983;&#26469;&#22635;&#34917;&#32454;&#33410;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我想它作为 SOC 不错。所有较困难的事情由 B.MI 负责,所以它看来比较适合让学生来填补细节。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Dave</strong></span>
@@ -541,10 +596,10 @@
 <p>
           </p>
 <p>
-            <span class="emphasis"><em> Great! </em></span>
+ <span class="emphasis"><em> Great!<br> &#19981;&#38169;&#65281; </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>不错!</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Jeff</strong></span>
@@ -553,10 +608,10 @@
 <p>
           </p>
 <p>
- <span class="emphasis"><em> Please write a proposal! </em></span> + <span class="emphasis"><em> Please write a proposal!<br> &#35831;&#20889;&#19968;&#20010;&#24314;&#35758;&#20070;&#65281; </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>请写一个建议书!</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -565,32 +620,34 @@
 <p>
           </p>
 <p>
-            <span class="emphasis"><em> I've just done so: </em></span>
+ <span class="emphasis"><em> I've just done so:<br> &#25105;&#24050;&#32463;&#20889;&#20102;&#19968;&#20010;&#65306; </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>我已经写了一个:</em></span></p>
+        </p>
 </blockquote></div>
 <div class="sidebar">
 <p class="title"><b></b></p>
 <p>
- <span class="bold"><strong>Specialized containers with Boost.MultiIndex 由&nbsp;Boost.MultiIndex 构建的专用容器</strong></span> + *Specialized containers with Boost.MultiIndex &#30001;Boost.MultiIndex&#26500;&#24314;&#30340;&#19987;&#29992;&#23481;&#22120;*
       </p>
 <p>
-        <span class="bold"><strong>Introduction 简介</strong></span>
+        *Introduction &#31616;&#20171;*
       </p>
 <p>
Boost.MultiIndex allows the construction of complex data structures involving two or more indexing mechanisms on the same set of elements. Out of the unlimited range of possible data structures specifiable within Boost.MultiIndex, some - particular configurations arise recurrently:<br>Boost.MultiIndex 可 以构造出复杂的数据结构,在同一组元素中包含两个或以上的索引机制。虽然在 Boost.MultiIndex 中可以指定不受限制的各种可能的数据结构,但是有些特定的配置 经常反复出现: + particular configurations arise recurrently:<br> Boost.MultiIndex &#21487;&#20197;&#26500;&#36896;&#20986;&#22797;&#26434;&#30340;&#25968;&#25454;&#32467;&#26500;&#65292;&#22312;&#21516;&#19968;&#32452;&#20803;&#32032;&#20013;&#21253;&#21547;&#20004;&#20010;&#25110;&#20197;&#19978;&#30340;&#32034;&#24341;&#26426;&#21046;&#12290; + &#34429;&#28982;&#22312; Boost.MultiIndex &#20013;&#21487;&#20197;&#25351;&#23450;&#19981;&#21463;&#38480;&#21046;&#30340;&#21508;&#31181;&#21487;&#33021;&#30340;&#25968;&#25454;&#32467;&#26500;&#65292;&#20294;&#26159;&#26377;&#20123;&#29305;&#23450;&#30340;&#37197;&#32622;&#32463;&#24120;&#21453;&#22797;&#20986;&#29616;&#65306;
       </p>
 <p>
<span class="bold"><strong>a.</strong></span> A bidirectional map or bimap is a container of elements of type pair&lt;T,Q&gt; where fast look up is provided both for the T and the Q field, in contrast with a regular STL map which only allows - for fast look up on T.<br><span class="bold"><strong>a.</strong></span> 双向映射或 bimap 是一种元素类型为 pair&lt;T,Q&gt; 的容器,它提供了按 T 和 Q 字段的快速查找,而普通的 STL map 只允许按 T 进行快速查找。 + for fast look up on T.<br> <span class="bold"><strong>a.</strong></span> &#21452;&#21521;&#26144;&#23556;&#25110; + bimap &#26159;&#19968;&#31181;&#20803;&#32032;&#31867;&#22411;&#20026; pair&lt;T,Q&gt; &#30340;&#23481;&#22120;&#65292;&#23427;&#25552;&#20379;&#20102;&#25353; + T &#21644; Q &#23383;&#27573;&#30340;&#24555;&#36895;&#26597;&#25214;&#65292; &#32780;&#26222;&#36890;&#30340; STL map &#21482;&#20801;&#35768;&#25353; T &#36827;&#34892;&#24555;&#36895;&#26597;&#25214;&#12290;
       </p>
-
 <p>
<span class="bold"><strong>b.</strong></span> An MRU (most recently used) list keeps the n last referenced elements: when a new item is inserted and the list
@@ -598,15 +655,19 @@
an insertion is tried of a preexistence element, this gets promoted to the first position. MRU lists can be used to implement dynamic caches and the
         kind of behavior exhibited by programs featuring a "Recent files"
- menu command, for instance.<br><span class="bold"><strong>b.</strong></span> MRU (最近最常使用)列表可以保持最后引 用的 n 个元素:当插入一个新元素而列表已达到最大长度时,最旧的元素被删除,但 是如果插入的是已存在的元素,则将它提升到第一个位置。MRU 列表可用于实现动态缓 冲以及象程序中的"最近使用的文件"此类功能。 + menu command, for instance.<br> <span class="bold"><strong>b.</strong></span> MRU + (&#26368;&#36817;&#26368;&#24120;&#20351;&#29992;)&#21015;&#34920;&#21487;&#20197;&#20445;&#25345;&#26368;&#21518;&#24341;&#29992;&#30340; n &#20010;&#20803;&#32032;&#65306;&#24403;&#25554;&#20837;&#19968;&#20010;&#26032;&#20803;&#32032;&#32780;&#21015;&#34920;&#24050;&#36798;&#21040;&#26368;&#22823;&#38271;&#24230;&#26102;&#65292; + &#26368;&#26087;&#30340;&#20803;&#32032;&#34987;&#21024;&#38500;&#65292;&#20294;&#26159;&#22914;&#26524;&#25554;&#20837;&#30340;&#26159;&#24050;&#23384;&#22312;&#30340;&#20803;&#32032;&#65292;&#21017;&#23558;&#23427;&#25552;&#21319;&#21040;&#31532;&#19968;&#20010;&#20301;&#32622;&#12290; + MRU &#21015;&#34920;&#21487;&#29992;&#20110;&#23454;&#29616;&#21160;&#24577;&#32531;&#20914;&#20197;&#21450;&#35937;&#31243;&#24207;&#20013;&#30340;"&#26368;&#36817;&#20351;&#29992;&#30340;&#25991;&#20214;"&#27492;&#31867;&#21151;&#33021;&#12290;
       </p>
 <p>
Although Boost.MultiIndex provides the mechanisms to build these common structures, the resulting interface can be cumbersome and too general in comparison with - specialized containers focusing on such particular structures.&nbsp;<br>虽然 Boost.MultiIndex 提供了构建这些常用结构的机制,但 是所得到的接口非常笨重,与这些特定容器所关注的这些特定结构相比也过于通用。 + specialized containers focusing on such particular structures.<br> &#34429;&#28982; + Boost.MultiIndex &#25552;&#20379;&#20102;&#26500;&#24314;&#36825;&#20123;&#24120;&#29992;&#32467;&#26500;&#30340;&#26426;&#21046;&#65292;&#20294;&#26159;&#25152;&#24471;&#21040;&#30340;&#25509;&#21475;&#38750;&#24120;&#31528;&#37325;&#65292;&#19982;&#36825;&#20123;&#29305;&#23450;&#23481;&#22120;&#25152;&#20851;&#27880;&#30340;&#36825;&#20123;&#29305;&#23450;&#32467;&#26500;&#30456;&#27604;&#20063;&#36807;&#20110;&#36890;&#29992;&#12290;
       </p>
 <p>
-        <span class="bold"><strong>Goal 目标</strong></span>
+        *Goal &#30446;&#26631;*
       </p>
 <p>
To write a library of specialized containers like the ones described above,
@@ -617,60 +678,64 @@
implies a strong emphasis on interface design, documentation and unit testing; the mentor will be guiding the student through the complete cycle from specification and requirements gathering to documentation and actual coding. The final
-        result of the project must then contain:<br>编
-写一个如上所述的专用容器库,用 Boost.MultiIndex 作为实现核心。除了 bimap 和 MRU -列表以外,学生还可以提议其它感兴趣的专用容器。我们希望这个库符合 Boost 所要 求的质量标准,最后有可能将该库纳入 -Boost,这意味着对接口设计、文档和单元测试的特别强调;导师将在整个开发周期中 指导学生,从规格和需求收集到文档和具体编码。本项目的最终结果必须
-包含: </p>
+ result of the project must then contain:<br> &#32534;&#20889;&#19968;&#20010;&#22914;&#19978;&#25152;&#36848;&#30340;&#19987;&#29992;&#23481;&#22120;&#24211;&#65292;&#29992; + Boost.MultiIndex &#20316;&#20026;&#23454;&#29616;&#26680;&#24515;&#12290;&#38500;&#20102; bimap &#21644; MRU &#21015;&#34920;&#20197;&#22806;&#65292;&#23398;&#29983;&#36824;&#21487;&#20197;&#25552;&#35758;&#20854;&#23427;&#24863;&#20852;&#36259;&#30340;&#19987;&#29992;&#23481;&#22120;&#12290; + &#25105;&#20204;&#24076;&#26395;&#36825;&#20010;&#24211;&#31526;&#21512; Boost &#25152;&#35201;&#27714;&#30340;&#36136;&#37327;&#26631;&#20934;&#65292;&#26368;&#21518;&#26377;&#21487;&#33021;&#23558;&#35813;&#24211;&#32435;&#20837; + Boost&#65292;&#36825;&#24847;&#21619;&#30528;&#23545;&#25509;&#21475;&#35774;&#35745;&#12289;&#25991;&#26723;&#21644;&#21333;&#20803;&#27979;&#35797;&#30340;&#29305;&#21035;&#24378;&#35843;&#65307; + &#23548;&#24072;&#23558;&#22312;&#25972;&#20010;&#24320;&#21457;&#21608;&#26399;&#20013;&#25351;&#23548;&#23398;&#29983;&#65292;&#20174;&#35268;&#26684;&#21644;&#38656;&#27714;&#25910;&#38598;&#21040;&#25991;&#26723;&#21644;&#20855;&#20307;&#32534;&#30721;&#12290;&#26412;&#39033;&#30446;&#30340;&#26368;&#32456;&#32467;&#26524;&#24517;&#39035;&#21253;&#21547;&#65306;
+      </p>
 <p>
<span class="bold"><strong>a.</strong></span> Source code following <a href="http://boost.org/more/lib_guide.htm#Guidelines"; target="_top">Boost - programming guidelines</a>.<br><span class="bold"><strong>a.</strong></span> 符合 <a href="http://boost.org/more/lib_guide.htm#Guidelines"; target="_top">Boost
-        编程指引</a> 的源代码。
+ programming guidelines</a>.<br> <span class="bold"><strong>a.</strong></span> + &#31526;&#21512; <a href="http://boost.org/more/lib_guide.htm#Guidelines"; target="_top">Boost&#32534;&#31243;&#25351;&#24341;</a>
+        &#30340;&#28304;&#20195;&#30721;&#12290;
       </p>
 <p>
<span class="bold"><strong>b.</strong></span> User documentation. Requirements on the format are loose, though the <a href="http://www.boost.org/tools/quickbook/doc/html/index.html"; target="_top">QuickBook</a> - format is gaining acceptance within Boost.<br><span class="bold"><strong>b.</strong></span> 用户文档。对格式的要求较松,不过 <a href="http://www.boost.org/tools/quickbook/doc/html/index.html"; target="_top">QuickBook</a>
-        格式在 Boost 内部是广为接受的。
+ format is gaining acceptance within Boost.<br> <span class="bold"><strong>b.</strong></span> + &#29992;&#25143;&#25991;&#26723;&#12290;&#23545;&#26684;&#24335;&#30340;&#35201;&#27714;&#36739;&#26494;&#65292;&#19981;&#36807; <a href="http://www.boost.org/tools/quickbook/doc/html/index.html"; target="_top">QuickBook</a> + &#26684;&#24335;&#22312; Boost &#20869;&#37096;&#26159;&#24191;&#20026;&#25509;&#21463;&#30340;&#12290;
       </p>
 <p>
<span class="bold"><strong>c.</strong></span> Complete set of unit tests powered by <a href="http://boost.sourceforge.net/boost-build2/"; target="_top">Boost Build System
-        V2</a>.<br><span class="bold"><strong>c.</strong></span> 可用于
- <a href="http://boost.sourceforge.net/boost-build2/"; target="_top">Boost Build System
-        V2</a> 的完整的单元测试集。
+ V2</a>.<br> <span class="bold"><strong>c.</strong></span> &#21487;&#29992;&#20110; <a href="http://boost.sourceforge.net/boost-build2/"; target="_top">Boost + Build System V2</a> &#30340;&#23436;&#25972;&#30340;&#21333;&#20803;&#27979;&#35797;&#38598;&#12290;
       </p>
 <p>
-        <span class="bold"><strong>Requirements 要求</strong></span>
+        *Requirements &#35201;&#27714;*
       </p>
 <p>
<span class="bold"><strong>a.</strong></span> Intermediate-to-high level in C++, with - emphasis in generic programming (templates).<br><span class="bold"><strong>a.</strong></span> C++水平为中至高级,在泛型编程(模板 )方面较强。 + emphasis in generic programming (templates).<br> <span class="bold"><strong>a.</strong></span> + C++&#27700;&#24179;&#20026;&#20013;&#33267;&#39640;&#32423;&#65292;&#22312;&#27867;&#22411;&#32534;&#31243;(&#27169;&#26495;)&#26041;&#38754;&#36739;&#24378;&#12290;
       </p>
 <p>
<span class="bold"><strong>b.</strong></span> Knowledge of the STL framework and design principles. Of course, knowledge of Boost in general and Boost.MultiIndex - in particular is a big plus.<br><span class="bold"><strong>b.</strong></span> 熟悉STL框架和设计原理。当然熟悉 Boost 尤其是 Boost.MultiIndex
-        就更好了。
+ in particular is a big plus.<br> <span class="bold"><strong>b.</strong></span> &#29087;&#24713;STL&#26694;&#26550;&#21644;&#35774;&#35745;&#21407;&#29702;&#12290;&#24403;&#28982;&#29087;&#24713; + Boost &#23588;&#20854;&#26159; Boost.MultiIndex &#23601;&#26356;&#22909;&#20102;&#12290;
       </p>
 <p>
<span class="bold"><strong>c.</strong></span> Acquaintance with at least two different - C++ programming environments.<br><span class="bold"><strong>c.</strong></span> 至少熟悉两个不同的C++编程环境。 + C++ programming environments.<br> <span class="bold"><strong>c.</strong></span> &#33267;&#23569;&#29087;&#24713;&#20004;&#20010;&#19981;&#21516;&#30340;C++&#32534;&#31243;&#29615;&#22659;&#12290;
       </p>
 <p>
<span class="bold"><strong>d.</strong></span> Some fluency in the English language; subsequent reviews of the documentation can help smooth rough edges here, - though.<br><span class="bold"><strong>d.</strong></span> 流利的英 语;不过后续的文档审查可以有所帮助。 + though.<br> <span class="bold"><strong>d.</strong></span> &#27969;&#21033;&#30340;&#33521;&#35821;&#65307;&#19981;&#36807;&#21518;&#32493;&#30340;&#25991;&#26723;&#23457;&#26597;&#21487;&#20197;&#26377;&#25152;&#24110;&#21161;&#12290;
       </p>
 <p>
<span class="bold"><strong>e.</strong></span> A mathematical inclination and previous - exposure to a formal Algorithms course would help very much.<br><span class="bold"><strong>e.</strong></span> 爱好数学,以前接触过 正式的算法课程会有很大帮助。 + exposure to a formal Algorithms course would help very much.<br> <span class="bold"><strong>e.</strong></span> &#29233;&#22909;&#25968;&#23398;&#65292;&#20197;&#21069;&#25509;&#35302;&#36807;&#27491;&#24335;&#30340;&#31639;&#27861;&#35838;&#31243;&#20250;&#26377;&#24456;&#22823;&#24110;&#21161;&#12290;
       </p>
 <p>
- <span class="bold"><strong>f.</strong></span> A craving for extreme quality work.<br><span class="bold"><strong>f.</strong></span> 追求 高质量的工作。 + <span class="bold"><strong>f.</strong></span> A craving for extreme quality work.<br> + <span class="bold"><strong>f.</strong></span> &#36861;&#27714;&#39640;&#36136;&#37327;&#30340;&#24037;&#20316;&#12290;
       </p>
 <p>
- <span class="bold"><strong>Benefits for the student 对学生的好处 </strong></span> + *Benefits for the student &#23545;&#23398;&#29983;&#30340;&#22909;&#22788;*
       </p>
 <p>
The student taking on this project will have the opportunity to learn the
@@ -680,10 +745,10 @@
design and so-called modern C++ programming, high quality user documentation and unit testing. The student will also learn, perhaps to her surprise, that most of the time will be spent gathering and trying ideas and, in general,
-        thinking, rather than writing actual code.<br>参
-与这一项目的学生,将有机会学习在一个高度重视C++开源的机构中进行软件生产的完 整过程,甚至最终会在 Boost -中见到自己的作品。完成这个项目包括在C++接口设计中的一些不简单的问题,以及所 谓的现代C++编程,还有高质量的用户文档和单元测试。学生可能会惊 -讶,他还将学到大部分时间将用于收集和尝试各种思路,通常来说是思考而不是实际 编写代码。 </p> + thinking, rather than writing actual code.<br> &#21442;&#19982;&#36825;&#19968;&#39033;&#30446;&#30340;&#23398;&#29983;&#65292;&#23558;&#26377;&#26426;&#20250;&#23398;&#20064;&#22312;&#19968;&#20010;&#39640;&#24230;&#37325;&#35270;C++&#24320;&#28304;&#30340;&#26426;&#26500;&#20013;&#36827;&#34892;&#36719;&#20214;&#29983;&#20135;&#30340;&#23436;&#25972;&#36807;&#31243;&#65292;&#29978;&#33267;&#26368;&#32456;&#20250;&#22312; + Boost &#20013;&#35265;&#21040;&#33258;&#24049;&#30340;&#20316;&#21697;&#12290; &#23436;&#25104;&#36825;&#20010;&#39033;&#30446;&#21253;&#25324;&#22312;C++&#25509;&#21475;&#35774;&#35745;&#20013;&#30340;&#19968;&#20123;&#19981;&#31616;&#21333;&#30340;&#38382;&#39064;&#65292;&#20197;&#21450;&#25152;&#35859;&#30340;&#29616;&#20195;C++&#32534;&#31243;&#65292;&#36824;&#26377;&#39640;&#36136;&#37327;&#30340;&#29992;&#25143;&#25991;&#26723;&#21644;&#21333;&#20803;&#27979;&#35797;&#12290; + &#23398;&#29983;&#21487;&#33021;&#20250;&#24778;&#35766;&#65292;&#20182;&#36824;&#23558;&#23398;&#21040;&#22823;&#37096;&#20998;&#26102;&#38388;&#23558;&#29992;&#20110;&#25910;&#38598;&#21644;&#23581;&#35797;&#21508;&#31181;&#24605;&#36335;&#65292;&#36890;&#24120;&#26469;&#35828;&#26159;&#24605;&#32771;&#32780;&#19981;&#26159;&#23454;&#38469;&#32534;&#20889;&#20195;&#30721;&#12290;
+      </p>
 </div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -694,20 +759,22 @@
 <p>
<span class="emphasis"><em> I am planning to submit an application to SoC. I will love to make real the specialized containers you mention and try to include
-            some useful others. </em></span>
+ some useful others.<br> &#25105;&#27491;&#35745;&#21010;&#23558;&#23427;&#25552;&#20132;&#21040; SoC. &#25105;&#24076;&#26395;&#20320;&#25152;&#25552;&#21040;&#30340;&#19987;&#29992;&#23481;&#22120;&#25104;&#20026;&#30495;&#23454;&#65292;&#24182;&#23581;&#35797;&#21152;&#20837;&#19968;&#20123;&#26377;&#29992;&#30340;&#20854;&#23427;&#19996;&#35199;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我正计划将它提交到 SoC. 我希望你所提到的 专用容器成为真实,并尝试加入一些有用的其它东西。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
<code class="literal"> And then... after long hours of coding (and fun) this library
-            saw the light. </code>
+ saw the light.<br> &#28982;&#21518;... &#22312;&#38271;&#26102;&#38388;&#30340;&#32534;&#30721;(&#21644;&#20048;&#36259;)&#21518;&#65292;&#36825;&#20010;&#24211;&#30475;&#21040;&#20102;&#20809;&#26126;&#12290;
+            </code>
           </p>
 <p>
- <code class="literal">然后... 在长时间的编码(和乐趣)后,这个库看到 了光明。</code></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -719,16 +786,17 @@
         </p>
 </blockquote></div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="../history.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../history.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../acknowledgements.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/history.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/history.html Mon Mar 8 01:27:36 2010
@@ -1,45 +1,48 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>History</title><link rel="stylesheet" href="../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>History &#21382;&#21490;</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="up" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="prev" href="rationale/the_student_and_the_mentor.html" title="The student and the mentor"> -<link rel="next" href="history/multiindex_and_bimap.html" title="MultiIndex and Bimap"></head> -<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="rationale/the_student_and_the_mentor.html" title="The student and the mentor &#23398;&#29983;&#19982;&#23548;&#24072;"> +<link rel="next" href="history/multiindex_and_bimap.html" title="MultiIndex and Bimap">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../index.html">Home</a></td>
 <td align="center"><a href="../../../../libraries.htm">Libraries</a></td>
-<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="rationale/the_student_and_the_mentor.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both;">
-<a name="boost_bimap.history"></a><a class="link" href="history.html" title="History">History 历史</a>
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_bimap.history"></a><a class="link" href="history.html" title="History &#21382;&#21490;"> History &#21382;&#21490;</a>
 </h2></div></div></div>
 <div class="toc"><dl>
-<dt><span class="section"><a href="history.html#boost_bimap.history.the_long_path_from_code_project_to_boost">The - long path from Code Project to Boost 从代码项目到Boost的漫长路程 </a></span></dt> +<dt><span class="section"><a href="history.html#boost_bimap.history.the_long_path_from_code_project_to_boost"> + The long path from Code Project to Boost &#20174;&#20195;&#30721;&#39033;&#30446;&#21040;Boost&#30340;&#28459;&#38271;&#36335;&#31243;
+      </a></span></dt>
<dt><span class="section"><a href="history/multiindex_and_bimap.html">MultiIndex
-      and Bimap &nbsp;MultiIndex 和 Bimap</a></span></dt>
+      and Bimap</a></span></dt>
 </dl></div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.history.the_long_path_from_code_project_to_boost"></a><a class="link" href="history.html#boost_bimap.history.the_long_path_from_code_project_to_boost" title="The long path from Code Project to Boost">The
-      long path from Code Project to Boost 从代码项目到Boost的漫长路程</a>
+<a name="boost_bimap.history.the_long_path_from_code_project_to_boost"></a><a class="link" href="history.html#boost_bimap.history.the_long_path_from_code_project_to_boost" title="The long path from Code Project to Boost &#20174;&#20195;&#30721;&#39033;&#30446;&#21040;Boost&#30340;&#28459;&#38271;&#36335;&#31243;"> + The long path from Code Project to Boost &#20174;&#20195;&#30721;&#39033;&#30446;&#21040;Boost&#30340;&#28459;&#38271;&#36335;&#31243;
+      </a>
 </h3></div></div></div>
 <div class="variablelist">
 <p class="title"><b></b></p>
 <dl>
-<dt><span class="term">2002 - bimap at Code Project 在代码项目中的 bimap</span></dt> +<dt><span class="term">2002 - bimap at Code Project &#22312;&#20195;&#30721;&#39033;&#30446;&#20013;&#30340;bimap</span></dt>
 <dd><p>
Joaquin Lopez Muñoz posted his first <a href="http://www.codeproject.com/vcpp/stl/bimap.asp#test_suite"; target="_top">bimap library</a> in 2002. Tons of users have been using it. He then <a href="http://aspn.activestate.com/ASPN/Mail/Message/boost/1404881"; target="_top">asked
@@ -47,15 +50,21 @@
was a lot of interest and Joaquin started to boostify the code. At some point all the developers seemed to agree that, rather than a bidirectional map, it would be better to work on an N-indexed set that contained Joaquin's - library as a particular case.</p></dd><dd><p>&nbsp;Joaquin Lopez Muñoz 在2002年贴出了他第一个 <a href="http://www.codeproject.com/vcpp/stl/bimap.asp#test_suite"; target="_top">bimap - 库</a>。大量用户开始使用它。接着他在2003年 <a href="http://aspn.activestate.com/ASPN/Mail/Message/boost/1404881"; target="_top">出于兴趣询问了列表</a>。幸运的是,引趣了很多人的兴趣,Joaquin 开始推进他的代码。在某个时刻,似乎所有用户都同意,构建一个N个索引的集合而不 是一个双向映射是更好的选择,它应该将 Joaquin 的库作为一个特例而包含在内。 + library as a particular case.<br> Joaquin Lopez Muñoz &#22312;2002&#24180;&#36148;&#20986;&#20102;&#20182;&#31532;&#19968;&#20010; + <a href="http://www.codeproject.com/vcpp/stl/bimap.asp#test_suite"; target="_top">bimap + &#24211;</a>&#12290; &#22823;&#37327;&#29992;&#25143;&#24320;&#22987;&#20351;&#29992;&#23427;&#12290;&#25509;&#30528;&#20182;&#22312;2003&#24180; <a href="http://aspn.activestate.com/ASPN/Mail/Message/boost/1404881"; target="_top">&#20986;&#20110;&#20852;&#36259;&#35810;&#38382;&#20102;&#21015;&#34920;</a>&#12290; + &#24184;&#36816;&#30340;&#26159;&#65292;&#24341;&#36259;&#20102;&#24456;&#22810;&#20154;&#30340;&#20852;&#36259;&#65292;Joaquin &#24320;&#22987;&#25512;&#36827;&#20182;&#30340;&#20195;&#30721;&#12290;&#22312;&#26576;&#20010;&#26102;&#21051;&#65292;&#20284;&#20046;&#25152;&#26377;&#29992;&#25143;&#37117;&#21516;&#24847;&#65292; + &#26500;&#24314;&#19968;&#20010;N&#20010;&#32034;&#24341;&#30340;&#38598;&#21512;&#32780;&#19981;&#26159;&#19968;&#20010;&#21452;&#21521;&#26144;&#23556;&#26159;&#26356;&#22909;&#30340;&#36873;&#25321;&#65292;&#23427;&#24212;&#35813;&#23558; + Joaquin &#30340;&#24211;&#20316;&#20026;&#19968;&#20010;&#29305;&#20363;&#32780;&#21253;&#21547;&#22312;&#20869;&#12290;
           </p></dd>
 <dt><span class="term">2003 - multiindex_set</span></dt>
 <dd><p>
The library grew enormously and was ready for a formal review in 2003. At this point, the container was a lot more powerful, but everything comes with a price and this new beast lacked the simplicity of the original - bimap.</p></dd><dd><p>这个库得到了非常大的成长,在2003年准备进 行正式审查。这个时候,这个容器非常强大,但任何事情都是有代价的,其缺点是没有 了原来 bimap 的简单性。 + bimap.<br> &#36825;&#20010;&#24211;&#24471;&#21040;&#20102;&#38750;&#24120;&#22823;&#30340;&#25104;&#38271;&#65292;&#22312;2003&#24180;&#20934;&#22791;&#36827;&#34892;&#27491;&#24335;&#23457;&#26597;&#12290;&#36825;&#20010;&#26102;&#20505;&#65292;&#36825;&#20010;&#23481;&#22120;&#38750;&#24120;&#24378;&#22823;&#65292; + &#20294;&#20219;&#20309;&#20107;&#24773;&#37117;&#26159;&#26377;&#20195;&#20215;&#30340;&#65292;&#20854;&#32570;&#28857;&#26159;&#27809;&#26377;&#20102;&#21407;&#26469; bimap
+            &#30340;&#31616;&#21333;&#24615;&#12290;
           </p></dd>
 <dt><span class="term">2004 - indexed_set</span></dt>
 <dd><p>
@@ -63,14 +72,17 @@
This Swiss army knife introduced several new features, such as non-unique indexes, hashed indices and sequenced indices. In the list of improvements to the library, it was mentioned that a bidirectional map should be coded - in top of this container.</p></dd><dd><p>在2004年,对于多索引容 器的正式审查结束了。这把瑞士军刀引入了几个新特性,如非唯一索引、散列索引和序 列索引。在这个库的改进列表中,提及了双向映射应该在这个容器的基础之上进行编 码。 + in top of this container.<br> &#22312;2004&#24180;&#65292;&#23545;&#20110;&#22810;&#32034;&#24341;&#23481;&#22120;&#30340;&#27491;&#24335;&#23457;&#26597;&#32467;&#26463;&#20102;&#12290;&#36825;&#25226;&#29790;&#22763;&#20891;&#20992;&#24341;&#20837;&#20102;&#20960;&#20010;&#26032;&#29305;&#24615;&#65292;&#22914;&#38750;&#21807;&#19968;&#32034;&#24341;&#12289;&#25955;&#21015;&#32034;&#24341;&#21644;&#24207;&#21015;&#32034;&#24341;&#12290; + &#22312;&#36825;&#20010;&#24211;&#30340;&#25913;&#36827;&#21015;&#34920;&#20013;&#65292;&#25552;&#21450;&#20102;&#21452;&#21521;&#26144;&#23556;&#24212;&#35813;&#22312;&#36825;&#20010;&#23481;&#22120;&#30340;&#22522;&#30784;&#20043;&#19978;&#36827;&#34892;&#32534;&#30721;&#12290;
           </p></dd>
 <dt><span class="term">2005 - multi_index_container</span></dt>
 <dd><p>
Once in Boost, the library switched to the now familiar name "Boost.MultiIndex". Late in 2004, it formally became a member of Boost. Joaquin continued to enchance the library and added new features such as composite keys - and random-access indices.</p></dd><dd><p>进入 Boost 后,这个库 换成现在的名字 "Boost.MultiIndex"。在2004年后期,它正式成为了 Boost 的成员。 Joaquin 继续对库进行加强,增加了象组合键、随机访问索引等新特性。 + and random-access indices.<br> &#36827;&#20837; Boost &#21518;&#65292;&#36825;&#20010;&#24211;&#25442;&#25104;&#29616;&#22312;&#30340;&#21517;&#23383;
+            
"Boost.MultiIndex"&#12290;&#22312;2004&#24180;&#21518;&#26399;&#65292;&#23427;&#27491;&#24335;&#25104;&#20026;&#20102;
+ Boost &#30340;&#25104;&#21592;&#12290; Joaquin &#32487;&#32493;&#23545;&#24211;&#36827;&#34892;&#21152;&#24378;&#65292;&#22686;&#21152;&#20102;&#35937;&#32452;&#21512;&#38190;&#12289;&#38543;&#26426;&#35775;&#38382;&#32034;&#24341;&#31561;&#26032;&#29305;&#24615;&#12290;
           </p></dd>
 <dt><span class="term">2006 - Multi Index Specialized Containers
         SoC project</span></dt>
@@ -84,32 +96,34 @@
for the SoC and was elected, along with nine other students. Matias's and Joaquin's SoC project ends with a working implementation of the bimap library that was presented in an informal review. By the end of the year
-            the library was queued for a formal review.</p></dd><dd><p>2006
-年,在 Boost.Property_tree 的正式审查过程中,基于 Boost.MultiIndex
-构建一个双向映射容器的需求被再次提及。同一时间,Boost 作为一个导师组织进入 了 Google SoC 2006。Joaquin -推举自己成为导师。他提议要构建的不应仅仅是一个双向映射,而且应该是一个多索 引的专用容器。Matias Capeletto 提出为 SoC 引入 -Boost.Misc 并被推举,同时还有另个九个学生。Matias 和 Joaquin 的 SoC 项目以 bimap
-库的实现并进入正式审查而结束。到当年年底,该库等待进入正式审查。 </p></dd>
+ the library was queued for a formal review.<br> 2006 &#24180;&#65292;&#22312; Boost.Property_tree + &#30340;&#27491;&#24335;&#23457;&#26597;&#36807;&#31243;&#20013;&#65292;&#22522;&#20110; Boost.MultiIndex &#26500;&#24314;&#19968;&#20010;&#21452;&#21521;&#26144;&#23556;&#23481;&#22120;&#30340;&#38656;&#27714;&#34987;&#20877;&#27425;&#25552;&#21450;&#12290; + &#21516;&#19968;&#26102;&#38388;&#65292;Boost &#20316;&#20026;&#19968;&#20010;&#23548;&#24072;&#32452;&#32455;&#36827;&#20837;&#20102; Google SoC 2006&#12290;Joaquin + &#25512;&#20030;&#33258;&#24049;&#25104;&#20026;&#23548;&#24072;&#12290; &#20182;&#25552;&#35758;&#35201;&#26500;&#24314;&#30340;&#19981;&#24212;&#20165;&#20165;&#26159;&#19968;&#20010;&#21452;&#21521;&#26144;&#23556;&#65292;&#32780;&#19988;&#24212;&#35813;&#26159;&#19968;&#20010;&#22810;&#32034;&#24341;&#30340;&#19987;&#29992;&#23481;&#22120;&#12290; + Matias Capeletto &#25552;&#20986;&#20026; SoC &#24341;&#20837; Boost.Misc &#24182;&#34987;&#25512;&#20030;&#65292;&#21516;&#26102;&#36824;&#26377;&#21478;&#20010;&#20061;&#20010;&#23398;&#29983;&#12290; + Matias &#21644; Joaquin &#30340; SoC &#39033;&#30446;&#20197; bimap &#24211;&#30340;&#23454;&#29616;&#24182;&#36827;&#20837;&#27491;&#24335;&#23457;&#26597;&#32780;&#32467;&#26463;&#12290;&#21040;&#24403;&#24180;&#24180;&#24213;&#65292;&#35813;&#24211;&#31561;&#24453;&#36827;&#20837;&#27491;&#24335;&#23457;&#26597;&#12290;
+          </p></dd>
 <dt><span class="term">2007 - Boost.Bimap</span></dt>
 <dd><p>
The formal review took place at the beggining of the year and Boost.Bimap - was accepted in Boost.</p></dd><dd><p>正式审查在年初开 始,Boost.Bimap
-            被接受进入 Boost。
+ was accepted in Boost.<br> &#27491;&#24335;&#23457;&#26597;&#22312;&#24180;&#21021;&#24320;&#22987;&#65292;Boost.Bimap
+            &#34987;&#25509;&#21463;&#36827;&#20837; Boost&#12290;
           </p></dd>
 </dl>
 </div>
 </div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="rationale/the_student_and_the_mentor.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/introduction.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/introduction.html Mon Mar 8 01:27:36 2010
@@ -1,64 +1,70 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Introduction</title><link rel="stylesheet" href="../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Introduction &#31616;&#20171;</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="up" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="prev" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="next" href="one_minute_tutorial.html" title="One minute tutorial"></head> -<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="next" href="one_minute_tutorial.html" title="One minute tutorial &#19968;&#20998;&#38047;&#25945;&#31243;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../index.html">Home</a></td>
 <td align="center"><a href="../../../../libraries.htm">Libraries</a></td>
-<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="one_minute_tutorial.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both;">
-<a name="boost_bimap.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction 简介</a>
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_bimap.introduction"></a><a class="link" href="introduction.html" title="Introduction &#31616;&#20171;"> Introduction &#31616;&#20171;</a>
 </h2></div></div></div>
-<a name="boost_bimap.introduction.how_to_use_this_document"></a><h4>
-<a name="id2586460"></a>
- <a class="link" href="introduction.html#boost_bimap.introduction.how_to_use_this_document">How to use
-      this document 如何使用本文档</a>
+<a name="boost_bimap.introduction.how_to_use_this_document______________________"></a><h4>
+<a name="id4808490"></a>
+ <a class="link" href="introduction.html#boost_bimap.introduction.how_to_use_this_document______________________">How + to use this document &#22914;&#20309;&#20351;&#29992;&#26412;&#25991;&#26723;</a>
     </h4>
 <p>
This documentation contains a large amount of information. Whereas it may be worth reading it all, this documentation is intended for programmers with various - motives:</p><p>本文档包含大量信息。虽然所有内容都值得一读,不过还是应 该分别针对不同目标的程序员: + motives:<br> &#26412;&#25991;&#26723;&#21253;&#21547;&#22823;&#37327;&#20449;&#24687;&#12290;&#34429;&#28982;&#25152;&#26377;&#20869;&#23481;&#37117;&#20540;&#24471;&#19968;&#35835;&#65292;&#19981;&#36807;&#36824;&#26159;&#24212;&#35813;&#20998;&#21035;&#38024;&#23545;&#19981;&#21516;&#30446;&#26631;&#30340;&#31243;&#24207;&#21592;&#65306;
     </p>
 <div class="variablelist">
 <p class="title"><b></b></p>
 <dl>
 <dt><span class="term">I have to finished this today, I just want
- a bidirectional map! 我必须今天就完成任务,我只想要一个双向 map!</span></dt> + a bidirectional map! &#25105;&#24517;&#39035;&#20170;&#22825;&#23601;&#23436;&#25104;&#20219;&#21153;&#65292;&#25105;&#21482;&#24819;&#35201;&#19968;&#20010;&#21452;&#21521;map&#65281;</span></dt>
 <dd><p>
If your boss will kill you if the project is not finished by the end of - the day, just read the <a class="link" href="one_minute_tutorial.html" title="One minute tutorial">One-minute + the day, just read the <a class="link" href="one_minute_tutorial.html" title="One minute tutorial &#19968;&#20998;&#38047;&#25945;&#31243;">One-minute tutorial</a>. If you have a background in STL, you can be testing a - bimap within ten minutes.</p></dd><dd><p>如果你今天不能完成这个项 目就会被老板杀掉,那么只需阅读 <a class="link" href="one_minute_tutorial.html" title="One minute tutorial">一分钟教程</a>。 如果你具有STL的背景,你可以在10分钟内对 bimap 进行测试。 + bimap within ten minutes.<br> &#22914;&#26524;&#20320;&#20170;&#22825;&#19981;&#33021;&#23436;&#25104;&#36825;&#20010;&#39033;&#30446;&#23601;&#20250;&#34987;&#32769;&#26495;&#26432;&#25481;&#65292;&#37027;&#20040;&#21482;&#38656;&#38405;&#35835; + <a class="link" href="one_minute_tutorial.html" title="One minute tutorial &#19968;&#20998;&#38047;&#25945;&#31243;">&#19968;&#20998;&#38047;&#25945;&#31243;</a>&#12290; + &#22914;&#26524;&#20320;&#20855;&#26377;STL&#30340;&#32972;&#26223;&#65292;&#20320;&#21487;&#20197;&#22312;10&#20998;&#38047;&#20869;&#23545; bimap &#36827;&#34892;&#27979;&#35797;&#12290;
         </p></dd>
 <dt><span class="term">I am a serious programmer and want to learn
-      Boost.Bimap 我是一个认真的程序员,想学习 Boost.Bimap</span></dt>
+ Boost.Bimap &#25105;&#26159;&#19968;&#20010;&#35748;&#30495;&#30340;&#31243;&#24207;&#21592;&#65292;&#24819;&#23398;&#20064; Boost.Bimap</span></dt>
 <dd><p>
Boost.Bimap has a lot to offer if you are prepared to spend some time reading - this documentation. You will need to read <a class="link" href="the_tutorial.html" title="The tutorial">The - tutorial</a> and skim through some of the <a class="link" href="examples.html" title="Examples">Examples</a>. + this documentation. You will need to read <a class="link" href="the_tutorial.html" title="The tutorial &#25351;&#21335;">The + tutorial</a> and skim through some of the <a class="link" href="examples.html" title="Examples &#31034;&#20363;">Examples</a>. The best way to read this documentation is in the order given here. Just click on the arrow at the right bottom corner as you finish each page. You may skip the reference section, and return to it later to look up a - function signature or to find a specific metafunction.</p></dd><dd><p>如果你准备花上一点时间来阅读本文 档,Boost.Bimap 有很多内容。你需要阅读 <a class="link" href="the_tutorial.html" title="The tutorial">指南</a> 一节并浏览一些 <a class="link" href="examples.html" title="Examples">示例</a>。阅读本文档的最 好方法是按这里给出的顺序来读。每看完一页就点一下右下角的箭头。你可以跳过"参 考"章节,在需要查找某个函数的签名或是一个特定的元函数时再回过头来读它。 + function signature or to find a specific metafunction.<br> &#22914;&#26524;&#20320;&#20934;&#22791;&#33457;&#19978;&#19968;&#28857;&#26102;&#38388;&#26469;&#38405;&#35835;&#26412;&#25991;&#26723;&#65292;Boost.Bimap + &#26377;&#24456;&#22810;&#20869;&#23481;&#12290;&#20320;&#38656;&#35201;&#38405;&#35835; <a class="link" href="the_tutorial.html" title="The tutorial &#25351;&#21335;">&#25351;&#21335;</a> + &#19968;&#33410;&#65292; &#24182;&#27983;&#35272;&#19968;&#20123; <a class="link" href="examples.html" title="Examples &#31034;&#20363;">&#31034;&#20363;</a>&#12290;&#38405;&#35835;&#26412;&#25991;&#26723;&#30340;&#26368;&#22909;&#26041;&#27861;&#26159;&#25353;&#36825;&#37324;&#32473;&#20986;&#30340;&#39034;&#24207;&#26469;&#35835;&#12290; + &#27599;&#30475;&#23436;&#19968;&#39029;&#23601;&#28857;&#19968;&#19979;&#21491;&#19979;&#35282;&#30340;&#31661;&#22836;&#12290;&#20320;&#21487;&#20197;&#36339;&#36807;"&#21442;&#32771;"&#31456;&#33410;&#65292;&#22312;&#38656;&#35201;&#26597;&#25214;&#26576;&#20010;&#20989;&#25968;&#30340;&#31614;&#21517;&#25110;&#26159;&#19968;&#20010;&#29305;&#23450;&#30340;&#20803;&#20989;&#25968;&#26102;&#20877;&#22238;&#36807;&#22836;&#26469;&#35835;&#23427;&#12290;
         </p></dd>
 <dt><span class="term">I just love C++, I want to see the inner
- workings of Boost.Bimap. 我只是喜爱C++,我想看看 Boost.Bimap 的内部工 作方式。</span></dt> + workings of Boost.Bimap. &#25105;&#21482;&#26159;&#21916;&#29233;C++&#65292;&#25105;&#24819;&#30475;&#30475; Boost.Bimap &#30340;&#20869;&#37096;&#24037;&#20316;&#26041;&#24335;&#12290;</span></dt>
 <dd><p>
If you are a library developer, this documentation is the best place to learn how Boost.Bimap is implemented. It is strongly recommended that you
@@ -68,16 +74,17 @@
The rationale section is very large and contains a lot of information. There is a history section for those who might find it useful. Finally, in the reference section, each entity of the library is documented and - its source code is presented.</p></dd><dd><p>如果你是一名程序库开 发者,这份文档就是你学习如何实现 -Boost.Bimap 的最好地方。强烈建议你先象以上第二类程序员那样学习如何使用本 库。本库是在 Google SoC 2006 -中开发的,导师和学生在构建的过程中产生了大量文档。原理一节非常大,包含了大 量信息。在历史一节中,你可能会发现它也很有用。最后,在参考一节中,本库
-中的每一个实体都被记录在文档中,并且还介绍了源代码。 </p></dd>
+ its source code is presented.<br> &#22914;&#26524;&#20320;&#26159;&#19968;&#21517;&#31243;&#24207;&#24211;&#24320;&#21457;&#32773;&#65292;&#36825;&#20221;&#25991;&#26723;&#23601;&#26159;&#20320;&#23398;&#20064;&#22914;&#20309;&#23454;&#29616; + Boost.Bimap &#30340;&#26368;&#22909;&#22320;&#26041;&#12290; &#24378;&#28872;&#24314;&#35758;&#20320;&#20808;&#35937;&#20197;&#19978;&#31532;&#20108;&#31867;&#31243;&#24207;&#21592;&#37027;&#26679;&#23398;&#20064;&#22914;&#20309;&#20351;&#29992;&#26412;&#24211;&#12290;&#26412;&#24211;&#26159;&#22312; + Google SoC 2006 &#20013;&#24320;&#21457;&#30340;&#65292; &#23548;&#24072;&#21644;&#23398;&#29983;&#22312;&#26500;&#24314;&#30340;&#36807;&#31243;&#20013;&#20135;&#29983;&#20102;&#22823;&#37327;&#25991;&#26723;&#12290;"&#21407;&#29702;"&#19968;&#33410;&#38750;&#24120;&#22823;&#65292;&#21253;&#21547;&#20102;&#22823;&#37327;&#20449;&#24687;&#12290;&#22312;"&#21382;&#21490;"&#19968;&#33410;&#20013;&#65292; + &#20320;&#21487;&#33021;&#20250;&#21457;&#29616;&#23427;&#20063;&#24456;&#26377;&#29992;&#12290;&#26368;&#21518;&#65292;&#22312;"&#21442;&#32771;"&#19968;&#33410;&#20013;&#65292;&#26412;&#24211;&#20013;&#30340;&#27599;&#19968;&#20010;&#23454;&#20307;&#37117;&#34987;&#35760;&#24405;&#22312;&#25991;&#26723;&#20013;&#65292;&#24182;&#19988;&#36824;&#20171;&#32461;&#20102;&#28304;&#20195;&#30721;&#12290;
+        </p></dd>
 </dl>
 </div>
-<div class="note"><table summary="Note" border="0">
-<tbody><tr>
+<div class="note"><table border="0" summary="Note">
+<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/html/images/note.png"></td>
-<th align="left">Note 说明</th>
+<th align="left">Note</th>
 </tr>
 <tr><td align="left" valign="top"><p>
If anything in the documentation is unclear, please email me at <span class="emphasis"><em>matias
@@ -86,107 +93,120 @@
Please use the following notation for the subject: <span class="emphasis"><em>[boost][bimap] Your problem</em></span> as this will help me to identify it more easily. If appropriate, I will act on your advice to improve the documentation. Thanks - and enjoy!</p><p>如果本文档中有任何不清楚的地方,请发邮件给 我,<span class="emphasis"><em>matias.capeletto@xxxxxxxxx</em></span>,告诉 我你属于以上三类程序员中的哪一类,哪一节需要改进。请使用以下主题:<span class="emphasis"><em>[boost][bimap] - Your problem</em></span>,这样可以帮助我更容易地识别它。如果适 合,我会参考你的意见来改进本文件。感谢并祝开心! + and enjoy!<br> &#22914;&#26524;&#26412;&#25991;&#26723;&#20013;&#26377;&#20219;&#20309;&#19981;&#28165;&#26970;&#30340;&#22320;&#26041;&#65292;&#35831;&#21457;&#37038;&#20214;&#32473;&#25105;&#65292;<span class="emphasis"><em>matias.capeletto@xxxxxxxxx</em></span>&#65292; + &#21578;&#35785;&#25105;&#20320;&#23646;&#20110;&#20197;&#19978;&#19977;&#31867;&#31243;&#24207;&#21592;&#20013;&#30340;&#21738;&#19968;&#31867;&#65292;&#21738;&#19968;&#33410;&#38656;&#35201;&#25913;&#36827;&#12290;&#35831;&#20351;&#29992;&#20197;&#19979;&#20027;&#39064;&#65306;<span class="emphasis"><em>[boost][bimap] + &#20320;&#30340;&#38382;&#39064;</em></span>&#65292; &#36825;&#26679;&#21487;&#20197;&#24110;&#21161;&#25105;&#26356;&#23481;&#26131;&#22320;&#35782;&#21035;&#23427;&#12290;&#22914;&#26524;&#36866;&#21512;&#65292;&#25105;&#20250;&#21442;&#32771;&#20320;&#30340;&#24847;&#35265;&#26469;&#25913;&#36827;&#26412;&#25991;&#20214;&#12290;&#24863;&#35874;&#24182;&#31069;&#24320;&#24515;&#65281;
       </p></td></tr>
-</tbody></table></div>
-<div class="important"><table summary="Important" border="0">
-<tbody><tr>
+</table></div>
+<div class="important"><table border="0" summary="Important">
+<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../doc/html/images/important.png"></td>
-<th align="left">Important 重点</th>
+<th align="left">Important</th>
 </tr>
 <tr><td align="left" valign="top"><p>
If you should find a bug or would like to see an additional feature in the library, please use the standard Boost methods of dealing with this kind of issue rather than emailing me directly. Boost has a very good system to <a href="http://www.boost.org/more/bugs.htm"; target="_top">track bugs</a> and <a href="http://www.boost.org/more/requesting_new_features.htm"; target="_top">features requests</a>, - and using it is the best way of dealing with them as soon as possible.</p><p>如果你在本库中发现一个缺陷,或者希望看到增加一个特性,请使用 标准的 Boost 处理方式而不是直接给我发邮件。Boost 有一个非常好的系统来 - <a href="http://www.boost.org/more/bugs.htm"; target="_top">跟踪缺陷 </a> 和 <a href="http://www.boost.org/more/requesting_new_features.htm"; target="_top">申请新特性</a>,使用它们是处理此类事情的最好方法。 + and using it is the best way of dealing with them as soon as possible.<br> + &#22914;&#26524;&#20320;&#22312;&#26412;&#24211;&#20013;&#21457;&#29616;&#19968;&#20010;&#32570;&#38519;&#65292;&#25110;&#32773;&#24076;&#26395;&#30475;&#21040;&#22686;&#21152;&#19968;&#20010;&#29305;&#24615;&#65292;&#35831;&#20351;&#29992;&#26631;&#20934;&#30340; + Boost &#22788;&#29702;&#26041;&#24335;&#32780;&#19981;&#26159;&#30452;&#25509;&#32473;&#25105;&#21457;&#37038;&#20214;&#12290; Boost &#26377;&#19968;&#20010;&#38750;&#24120;&#22909;&#30340;&#31995;&#32479;&#26469; + <a href="http://www.boost.org/more/bugs.htm"; target="_top">&#36319;&#36394;&#32570;&#38519;</a> &#21644; + <a href="http://www.boost.org/more/requesting_new_features.htm"; target="_top">&#30003;&#35831;&#26032;&#29305;&#24615;</a>&#65292;&#20351;&#29992;&#23427;&#20204;&#26159;&#22788;&#29702;&#27492;&#31867;&#20107;&#24773;&#30340;&#26368;&#22909;&#26041;&#27861;&#12290;
       </p></td></tr>
-</tbody></table></div>
-<a name="boost_bimap.introduction.navigation"></a><h4>
-<a name="id2585321"></a>
- <a class="link" href="introduction.html#boost_bimap.introduction.navigation">Navigation 导读 </a>
+</table></div>
+<a name="boost_bimap.introduction.navigation_______"></a><h4>
+<a name="id4808756"></a>
+ <a class="link" href="introduction.html#boost_bimap.introduction.navigation_______">Navigation &#23548;&#35835;</a>
     </h4>
 <p>
Used in combination with the configured browser key (usually Alt), the following - keys act as handy shortcuts for common navigation tasks.</p><p>通过与 配置好的浏览器键(通常是 Alt)一起使用,以下键可用作常用导读任务的热键。 + keys act as handy shortcuts for common navigation tasks.<br> &#36890;&#36807;&#19982;&#37197;&#32622;&#22909;&#30340;&#27983;&#35272;&#22120;&#38190;(&#36890;&#24120;&#26159; + Alt)&#19968;&#36215;&#20351;&#29992;&#65292;&#20197;&#19979;&#38190;&#21487;&#29992;&#20316;&#24120;&#29992;&#23548;&#35835;&#20219;&#21153;&#30340;&#28909;&#38190;&#12290;
     </p>
 <div class="itemizedlist"><ul type="disc">
 <li>
-<span class="bold"><strong>General 通用</strong></span><div class="itemizedlist"><ul type="circle"> +<span class="bold"><strong>General &#36890;&#29992;</strong></span><div class="itemizedlist"><ul type="circle">
 <li>
-<code class="literal"><span class="bold"><strong>p</strong></span></code> - Previous page 前一页 +<code class="literal"><span class="bold"><strong>p</strong></span></code> - Previous page
+            &#21069;&#19968;&#39029;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>n</strong></span></code> - Next page 下一页 +<code class="literal"><span class="bold"><strong>n</strong></span></code> - Next page &#19979;&#19968;&#39029;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>h</strong></span></code> - home 返回首页 +<code class="literal"><span class="bold"><strong>h</strong></span></code> - home &#36820;&#22238;&#39318;&#39029;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>u</strong></span></code> - Up 向上一层 +<code class="literal"><span class="bold"><strong>u</strong></span></code> - Up &#21521;&#19978;&#19968;&#23618;
           </li>
 </ul></div>
 </li>
 <li>
-<span class="bold"><strong>Main TOC 主目录</strong></span><div class="itemizedlist"><ul type="circle"> +<span class="bold"><strong>Main TOC &#20027;&#30446;&#24405;</strong></span><div class="itemizedlist"><ul type="circle">
 <li>
-<code class="literal"><span class="bold"><strong>i</strong></span></code> - Introduction 简介 +<code class="literal"><span class="bold"><strong>i</strong></span></code> - Introduction
+            &#31616;&#20171;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>o</strong></span></code> - One minute tutorial 一分钟教程 +<code class="literal"><span class="bold"><strong>o</strong></span></code> - One minute tutorial
+            &#19968;&#20998;&#38047;&#25945;&#31243;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>t</strong></span></code> - The tutorial 指南 +<code class="literal"><span class="bold"><strong>t</strong></span></code> - The tutorial
+            &#25351;&#21335;
           </li>
 <li>
<code class="literal"><span class="bold"><strong>b</strong></span></code> - Bimap and Boost
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>r</strong></span></code> - Reference 参考 +<code class="literal"><span class="bold"><strong>r</strong></span></code> - Reference &#21442;&#32771;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>c</strong></span></code> - Compiler specifics 编译器相关特性 +<code class="literal"><span class="bold"><strong>c</strong></span></code> - Compiler specifics
+            &#32534;&#35793;&#22120;&#30456;&#20851;&#29305;&#24615;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>v</strong></span></code> - Performance 性能 +<code class="literal"><span class="bold"><strong>v</strong></span></code> - Performance &#24615;&#33021;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>e</strong></span></code> - Examples 示例 +<code class="literal"><span class="bold"><strong>e</strong></span></code> - Examples &#31034;&#20363;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>s</strong></span></code> - Test Suite 测试套件 +<code class="literal"><span class="bold"><strong>s</strong></span></code> - Test Suite &#27979;&#35797;&#22871;&#20214;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>f</strong></span></code> - Future work 未来的工作 +<code class="literal"><span class="bold"><strong>f</strong></span></code> - Future work &#26410;&#26469;&#30340;&#24037;&#20316;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>m</strong></span></code> - Release notes 发布说明 +<code class="literal"><span class="bold"><strong>m</strong></span></code> - Release notes
+            &#21457;&#24067;&#35828;&#26126;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>w</strong></span></code> - Rationale 原理 +<code class="literal"><span class="bold"><strong>w</strong></span></code> - Rationale &#21407;&#29702;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>y</strong></span></code> - History 历史 +<code class="literal"><span class="bold"><strong>y</strong></span></code> - History &#21382;&#21490;
           </li>
 <li>
-<code class="literal"><span class="bold"><strong>a</strong></span></code> - Acknowledgements 鸣谢 +<code class="literal"><span class="bold"><strong>a</strong></span></code> - Acknowledgements
+            &#40483;&#35874;
           </li>
 </ul></div>
 </li>
 </ul></div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="one_minute_tutorial.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/performance.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/performance.html Mon Mar 8 01:27:36 2010
@@ -1,44 +1,46 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Performance</title><link rel="stylesheet" href="../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Performance &#24615;&#33021;</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="up" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="prev" href="compiler_specifics.html" title="Compiler specifics">
-<link rel="next" href="examples.html" title="Examples"></head>
-<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="compiler_specifics.html" title="Compiler specifics &#32534;&#35793;&#22120;&#30456;&#20851;&#35828;&#26126;">
+<link rel="next" href="examples.html" title="Examples &#31034;&#20363;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../index.html">Home</a></td>
 <td align="center"><a href="../../../../libraries.htm">Libraries</a></td>
-<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="compiler_specifics.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both;">
-<a name="boost_bimap.performance"></a><a class="link" href="performance.html" title="Performance">Performance 性能</a>
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_bimap.performance"></a><a class="link" href="performance.html" title="Performance &#24615;&#33021;"> Performance &#24615;&#33021;</a>
 </h2></div></div></div>
 <p>
-      Section under construction.</p><p>本节正在编写中。
+ Section under construction.<br> &#26412;&#33410;&#27491;&#22312;&#32534;&#20889;&#20013;&#12290;
     </p>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="compiler_specifics.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html Mon Mar 8 01:27:36 2010
@@ -1,130 +1,154 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"><title>Additional Features</title>
-
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Additional Features &#20854;&#23427;&#29305;&#24615;</title>
 <link rel="stylesheet" href="../../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="up" href="../rationale.html" title="Rationale">
-<link rel="prev" href="../rationale.html" title="Rationale">
-<link rel="next" href="code.html" title="Code">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../rationale.html" title="Rationale &#21407;&#29702;">
+<link rel="prev" href="../rationale.html" title="Rationale &#21407;&#29702;">
+<link rel="next" href="code.html" title="Code &#20195;&#30721;">
 </head>
-<body style="color: black; background-color: white;" alink="#0000ff" link="#0000ff" vlink="#840084">
-<table cellpadding="2" width="100%">
-<tbody>
-<tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../../boost.png" height="86" width="277"></td> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libraries.htm">Libraries</a></td> -<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../../more/index.htm">More</a></td>
-</tr>
-</tbody>
-</table>
+</tr></table>
 <hr>
-<div class="spirit-nav"><a accesskey="p" href="../rationale.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="code.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<div class="spirit-nav">
+<a accesskey="p" href="../rationale.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="code.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage">
-<div>
-<div>
-<h3 class="title"><a name="boost_bimap.rationale.additional_features"></a><a class="link" href="additional_features.html" title="Additional Features">Additional Features 其它特性</a>
-</h3>
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_bimap.rationale.additional_features"></a><a class="link" href="additional_features.html" title="Additional Features &#20854;&#23427;&#29305;&#24615;"> Additional
+      Features &#20854;&#23427;&#29305;&#24615;</a>
+</h3></div></div></div>
+<a name="boost_bimap.rationale.additional_features.n_1__n_n__hashed_maps__n_1__n_n______________"></a><h5>
+<a name="id5004000"></a>
+ <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.n_1__n_n__hashed_maps__n_1__n_n______________">N-1,
+        N-N, hashed maps N-1, N-N, &#25955;&#21015;&#26144;&#23556;</a>
+      </h5>
+<p>
+ This is a very interesting point of the design. The framework introduced + in <span class="emphasis"><em>std::set theory</em></span> permits the management of the different + constraints with a very simple and conceptual approach. It is easy both to + remember and to learn. The idea here is to allow the user to specify the + collection type of each key directly. In order to implement this feature, + we have to solve two problems:<br> &#36825;&#26159;&#19968;&#20010;&#24456;&#26377;&#36259;&#30340;&#35774;&#35745;&#28857;&#12290;&#22312; + <span class="emphasis"><em>std::set &#29702;&#35770;</em></span> &#20013;&#24341;&#29992;&#30340;&#26694;&#26550;&#20801;&#35768;&#20197;&#19968;&#20010;&#38750;&#24120;&#31616;&#21333;&#21644;&#30452;&#35266;&#30340;&#26041;&#27861;&#31649;&#29702;&#19981;&#21516;&#30340;&#32422;&#26463;&#12290; + &#23427;&#24456;&#23481;&#26131;&#35760;&#20303;&#21644;&#23398;&#20064;&#12290;&#36825;&#37324;&#30340;&#24819;&#27861;&#26159;&#65292;&#20801;&#35768;&#29992;&#25143;&#30452;&#25509;&#25351;&#23450;&#27599;&#20010;&#38190;&#30340;&#32452;&#21512;&#31867;&#22411;&#12290;&#20026;&#20102;&#23454;&#29616;&#36825;&#19968;&#29305;&#24615;&#65292;&#25105;&#20204;&#24517;&#39035;&#35299;&#20915;&#20004;&#20010;&#38382;&#39064;&#65306;
+      </p>
+<div class="itemizedlist"><ul type="disc">
+<li>
+ The index types of the <code class="computeroutput"><span class="identifier">multi_index_container</span></code> + core now depends on the collection type used for each key.<br><code class="computeroutput"><span class="identifier">multi_index_container</span></code> &#26680;&#24515;&#30340;&#32034;&#24341;&#31867;&#22411;&#29616;&#22312;&#20381;&#36182;&#20110;&#27599;&#20010;&#38190;&#25152;&#20351;&#29992;&#30340;&#32452;&#21512;&#31867;&#22411;&#12290;
+        </li>
+<li>
+ The map views now change their semantics according to the collection type + chosen.<br> &#26144;&#23556;&#35270;&#22270;&#30340;&#35821;&#20041;&#29616;&#22312;&#26681;&#25454;&#25152;&#36873;&#25321;&#30340;&#32452;&#21512;&#31867;&#22411;&#32780;&#26377;&#25152;&#25913;&#21464;&#12290;
+        </li>
+</ul></div>
+<p>
+ Boost.Bimap relies heavily on Boost.MPL to implement all of the metaprogramming + necessary to make this framework work. By default, if the user does not specify + the kind of the set, a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">set</span></code> type + is used.<br> Boost.Bimap &#20005;&#37325;&#20381;&#36182;&#20110; Boost.MPL&#65292;&#20197;&#23454;&#29616;&#26412;&#26694;&#26550;&#25152;&#38656;&#30340;&#25152;&#26377;&#20803;&#32534;&#31243;&#12290; + &#32570;&#30465;&#22320;&#65292;&#22914;&#26524;&#29992;&#25143;&#27809;&#26377;&#25351;&#23450; set &#30340;&#31181;&#31867;&#65292;&#21017;&#20351;&#29992; <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">set</span></code>
+        &#31867;&#22411;&#12290;
+      </p>
+<p>
+ <span class="inlinemediaobject"><img src="../../images/bimap/bimap.structures.png" alt="bimap.structures"></span>
+      </p>
+<a name="boost_bimap.rationale.additional_features.collection_type_of_relation_constraints____________________________"></a><h5>
+<a name="id5004176"></a>
+ <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.collection_type_of_relation_constraints____________________________">Collection + type of relation constraints &#20851;&#31995;&#32452;&#21512;&#31867;&#22411;&#30340;&#32422;&#26463;</a>
+      </h5>
+<p>
+ The constraints of the bimap set view are another very important feature. + In general, Boost.Bimap users will base the set view type on one of the two + collection types of their keys. It may be useful however to give this set + other constraints or simply to order it differently. By default, Boost.Bimap + bases the collection type of relations on the left collection type, but the + user may choose between:<br> bimap &#38598;&#21512;&#35270;&#22270;&#30340;&#32422;&#26463;&#26159;&#21478;&#19968;&#20010;&#38750;&#24120;&#37325;&#35201;&#30340;&#29305;&#24615;&#12290;&#36890;&#24120;&#65292;Boost.Bimap + &#30340;&#29992;&#25143;&#23558;&#38598;&#21512;&#35270;&#22270;&#31867;&#22411;&#22522;&#20110;&#38190;&#30340;&#20004;&#20010;&#32452;&#21512;&#31867;&#22411;&#20043;&#19968;&#12290; &#19981;&#36807;&#65292;&#26377;&#26102;&#20063;&#38656;&#35201;&#23545;&#36825;&#19968;&#38598;&#21512;&#32473;&#20104;&#20854;&#23427;&#32422;&#26463;&#25110;&#31616;&#21270;&#65292;&#20197;&#20351;&#20043;&#19981;&#21516;&#12290;&#32570;&#30465;&#22320;&#65292;Boost.Bimap + &#23558;&#20851;&#31995;&#32452;&#21512;&#31867;&#22411;&#22522;&#20110;&#24038;&#32452;&#21512;&#31867;&#22411;&#65292; &#20294;&#29992;&#25143;&#21487;&#20197;&#36873;&#25321;&#20197;&#19979;&#20043;&#19968;&#65306;
+      </p>
+<div class="itemizedlist"><ul type="disc">
+<li>
+          left_based
+        </li>
+<li>
+          right_based
+        </li>
+<li>
+          set_of_relation&lt;&gt;
+        </li>
+<li>
+          multiset_of_relation&lt;&gt;
+        </li>
+<li>
+          unordered_set_of_relation&lt;&gt;
+        </li>
+<li>
+          unordered_multiset_of_relation&lt;&gt;
+        </li>
+<li>
+          list_of
+        </li>
+<li>
+          vector_of
+        </li>
+</ul></div>
+<p>
+ In the first two cases, there are only two indices in the <code class="computeroutput"><span class="identifier">multi_index_core</span></code>, + and for this reason, these are the preferred options. The implementation + uses further metaprogramming to define a new index if necessary.<br> &#22312;&#21069;&#20004;&#20010;&#36873;&#25321;&#20013;&#65292;&#22312; + <code class="computeroutput"><span class="identifier">multi_index_core</span></code> &#20013;&#21482;&#26377;&#20004;&#20010;&#32034;&#24341;&#65292;&#22240;&#27492;&#36825;&#26159;&#39318;&#36873;&#30340;&#26041;&#24335;&#12290; + &#22914;&#26524;&#26377;&#24517;&#35201;&#65292;&#23454;&#29616;&#20250;&#29992;&#20803;&#32534;&#31243;&#26469;&#23450;&#20041;&#26032;&#30340;&#32034;&#24341;&#12290;
+      </p>
+<a name="boost_bimap.rationale.additional_features.tagged_______"></a><h5>
+<a name="id5004298"></a>
+ <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.tagged_______">Tagged
+        &#26631;&#31614;</a>
+      </h5>
+<p>
+ The idea of using tags instead of the <code class="literal">member_at::side</code> + idiom is very appealing since code that uses it is more readable. The only + cost is compile time. <span class="emphasis"><em>boost/bimap/tagged</em></span> is the implementation + of a non-invasive tagged idiom. The <code class="literal">relation</code> class is + built in such a way that even when the user uses tags, the <code class="literal">member_at::side</code> + idiom continues to work. This is good since an user can start tagging even + before completing the coding of the algorithm, and the untagged code continues + to work. The development becomes a little more complicated when user-defined + tags are included, but there are many handy metafunctions defined in the + <code class="literal">tagged</code> idiom that help to keep things simple enough.<br> + &#20351;&#29992;&#26631;&#20934;&#30340;&#26041;&#27861;&#26469;&#20195;&#26367; <code class="literal">member_at::side</code> &#24815;&#29992;&#27861;&#26159;&#24456;&#21560;&#24341;&#20154;&#30340;&#65292;&#22240;&#20026;&#36825;&#26679;&#30340;&#20195;&#30721;&#26356;&#26131;&#35835;&#12290;&#21807;&#19968;&#30340;&#20195;&#20215;&#26159;&#32534;&#35793;&#26102;&#38388;&#12290; + <span class="emphasis"><em>boost/bimap/tagged</em></span> &#26159;&#19968;&#20010;&#38750;&#20405;&#20837;&#24335;&#26631;&#31614;&#24815;&#29992;&#27861;&#30340;&#23454;&#29616;&#12290;<code class="literal">relation</code> + &#31867;&#26159;&#20197;&#36825;&#26679;&#19968;&#31181;&#26041;&#24335;&#26469;&#26500;&#24314;&#30340;&#65292;&#21363;&#20351;&#29992;&#25143;&#20351;&#29992;&#20102;&#26631;&#31614;&#65292; + <code class="literal">member_at::side</code> &#24815;&#29992;&#27861;&#20063;&#21487;&#20197;&#32487;&#32493;&#20351;&#29992;&#12290;&#36825;&#26159;&#22909;&#20107;&#65292;&#22240;&#20026;&#29992;&#25143;&#29978;&#33267;&#21487;&#20197;&#23545;&#20043;&#21069;&#24050;&#23436;&#25104;&#30340;&#31639;&#27861;&#20195;&#30721;&#36827;&#34892;&#26631;&#31614;&#65292;&#19988;&#26410;&#26631;&#31614;&#30340;&#20195;&#30721;&#20063;&#21487;&#20197;&#32487;&#32493;&#20351;&#29992;&#12290; + &#24403;&#21253;&#21547;&#20102;&#29992;&#25143;&#33258;&#23450;&#20041;&#26631;&#31614;&#26102;&#65292;&#24320;&#21457;&#20250;&#21464;&#24471;&#26377;&#19968;&#28857;&#22797;&#26434;&#65292;&#20294;&#26159;&#22312; + <code class="literal">tagged</code> &#24815;&#29992;&#27861;&#20013;&#23450;&#20041;&#20102;&#24456;&#22810;&#26041;&#20415;&#30340;&#20803;&#20989;&#25968;&#65292;&#24110;&#21161;&#23558;&#20107;&#24773;&#20445;&#25345;&#22312;&#36275;&#22815;&#31616;&#21333;&#12290;
+      </p>
+<p>
+ <span class="inlinemediaobject"><img src="../../images/bimap/tagged.png" alt="tagged"></span>
+      </p>
 </div>
-</div>
-</div>
-<a name="boost_bimap.rationale.additional_features.n_1__n_n__hashed_maps"></a> -<h5><a name="id2749714"></a> <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.n_1__n_n__hashed_maps">N-1,
-N-N, hashed maps &nbsp;N-1, N-N, 散列映射</a> </h5>
-<p> This is a very interesting point of the design. The framework
-introduced in <span class="emphasis"><em>std::set
-theory</em></span> permits the management of the different
-constraints with a very simple and conceptual approach. It is easy both
-to remember and to learn. The idea here is to allow the user to specify
-the collection type of each key directly. In order to implement this
-feature, we have to solve two problems:</p>
-<p>这是一个很有趣的设计点。在 <span class="emphasis"><em>std::set
-理论</em></span>
-中引用的框架允许以一个非常简单和直观的方法管理不同的约束。它很容易记住和学 习。这里的想法是,允许用户直接指定每个键的组合类型。为了实现这一特性,
-我们必须解决两个问题: </p>
-<div class="itemizedlist">
-<ul type="disc">
-<li> The index types of the <code class="computeroutput"><span class="identifier">multi_index_container</span></code> -core now depends on the collection type used for each key. <br><code class="computeroutput"><span class="identifier">multi_index_container</span></code>
-核心的索引类型现在依赖于每个键所使用的组合类型。 </li>
-<li> The map views now change their semantics according to the
-collection type chosen.<br>映射视图的语义现在根据所选择的组合类型而有所改 变。 </li>
-</ul>
-</div>
-<p> Boost.Bimap relies heavily on Boost.MPL to implement all of
-the metaprogramming necessary to make this framework work. By default,
-if the user does not specify the kind of the set, a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">set</span></code>
-type is used.</p>
-<p>Boost.Bimap 严重依赖于 Boost.MPL,以实现本框架所需的所有元编程。缺省 地,如果用户没有指定 set 的种类,则使用 <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">set</span></code> 类型。 </p> -<p> <span class="inlinemediaobject"><img src="../../images/bimap/bimap.structures.png" alt="bimap.structures"></span> </p> -<a name="boost_bimap.rationale.additional_features.collection_type_of_relation_constraints"></a> -<h5><a name="id2749822"></a> <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.collection_type_of_relation_constraints">Collection
-type of relation constraints 关系组合类型的约束</a> </h5>
-<p> The constraints of the bimap set view are another very
-important feature. In general, Boost.Bimap users will base the set view
-type on one of the two collection types of their keys. It may be useful
-however to give this set other constraints or simply to order it
-differently. By default, Boost.Bimap bases the collection type of
-relations on the left collection type, but the user may choose between:</p><p>bimap
-集合视图的约束是另一个非常重要的特性。通常,Boost.Bimap
-的用户将集合视图类型基于键的两个组合类型之一。不过,有时也需要对这一集合给 予其它约束或简化,以使之不同。缺省地,Boost.Bimap
-将关系组合类型基于左组合类型,但用户可以选择以下之一:
-</p>
-<div class="itemizedlist">
-<ul type="disc">
-<li> left_based </li>
-<li> right_based </li>
-<li> set_of_relation&lt;&gt; </li>
-<li> multiset_of_relation&lt;&gt; </li>
-<li> unordered_set_of_relation&lt;&gt; </li>
-<li> unordered_multiset_of_relation&lt;&gt; </li>
-<li> list_of </li>
-<li> vector_of </li>
-</ul>
-</div>
-<p> In the first two cases, there are only two indices in the <code class="computeroutput"><span class="identifier">multi_index_core</span></code>,
-and for this reason, these are the preferred options. The
-implementation uses further metaprogramming to define a new index if
-necessary.</p><p>在前两个选择中,在 <code class="computeroutput"><span class="identifier">multi_index_core</span></code> 中只有两个索引,因此这是首 选的方式。如果有必要,实现会用元编程来定义新的索引。 </p>
-<a name="boost_bimap.rationale.additional_features.tagged"></a>
-<h5><a name="id2749910"></a> <a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.tagged">Tagged 标签</a>
-</h5>
-<p> The idea of using tags instead of the <code class="literal">member_at::side</code> idiom is very
-appealing since code that uses it is more readable. The only cost is
-compile time. <span class="emphasis"><em>boost/bimap/tagged</em></span>
-is the implementation of a non-invasive tagged idiom. The <code class="literal">relation</code> class is built in such -a way that even when the user uses tags, the <code class="literal">member_at::side</code>
-idiom continues to work. This is good since an user can start tagging
-even before completing the coding of the algorithm, and the untagged
-code continues to work. The development becomes a little more
-complicated when user-defined tags are included, but there are many
-handy metafunctions defined in the <code class="literal">tagged</code>
-idiom that help to keep things simple enough.</p><p>使用标准的方法来代替 <code class="literal">member_at::side</code> 惯用法是很吸引人的,因为这样的 代码更易读。唯一的代价是编译时间。<span class="emphasis"><em>boost/bimap/tagged</em></span> 是一个非侵入式标签惯用法 的实现。<code class="literal">relation</code> 类是以这样一种方式来构建的,即 使用户使用了标签,<code class="literal">member_at::side</code> 惯用法也可以 继续使用。这是好事,因为用户甚至可以对之前已完成的算法代码进行标签,且未标签 的代码也可以继续使用。当包含了用户自定义标签时,开发会变得有一点复杂,但是在 &nbsp;<code class="literal">tagged</code> 惯用法中定义了很多方便的元函数,帮 助将事情保持在足够简单。 </p> -<p> <span class="inlinemediaobject"><img src="../../images/bimap/tagged.png" alt="tagged"></span>
-</p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%">
-<tbody>
-<tr>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
-<td align="right">
-<div class="copyright-footer">Copyright © 2006 -2007
-Matias Capeletto
-<p> Distributed under the Boost Software License, Version
-1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
-</p>
-</div>
-</td>
-</tr>
-</tbody>
-</table>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
 <hr>
-<div class="spirit-nav"><a accesskey="p" href="../rationale.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="code.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<div class="spirit-nav">
+<a accesskey="p" href="../rationale.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="code.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/rationale/code.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/rationale/code.html Mon Mar 8 01:27:36 2010
@@ -1,52 +1,57 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Code</title><link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Code &#20195;&#30721;</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="up" href="../rationale.html" title="Rationale">
-<link rel="prev" href="additional_features.html" title="Additional Features"> -<link rel="next" href="the_student_and_the_mentor.html" title="The student and the mentor"></head> -<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../rationale.html" title="Rationale &#21407;&#29702;">
+<link rel="prev" href="additional_features.html" title="Additional Features &#20854;&#23427;&#29305;&#24615;"> +<link rel="next" href="the_student_and_the_mentor.html" title="The student and the mentor &#23398;&#29983;&#19982;&#23548;&#24072;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libraries.htm">Libraries</a></td> -<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="additional_features.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_student_and_the_mentor.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.rationale.code"></a><a class="link" href="code.html" title="Code">Code 代码</a> +<a name="boost_bimap.rationale.code"></a><a class="link" href="code.html" title="Code &#20195;&#30721;"> Code &#20195;&#30721;</a>
 </h3></div></div></div>
 <p>
- You can browse the code using the <a href="../../doxydoc/index.html" target="_top"><span class="bold"><strong>Boost.Bimap doxygen docs</strong></span></a>.</p><p>你 可以用 <a href="../../doxydoc/index.html" target="_top"><span class="bold"><strong>Boost.Bimap doxygen 文档</strong></span></a> 浏览代码。 + You can browse the code using the <a href="../../doxydoc/index.html" target="_top"><span class="bold"><strong>Boost.Bimap doxygen docs</strong></span></a>.<br> &#20320;&#21487;&#20197;&#29992; + <a href="../../doxydoc/index.html" target="_top"><span class="bold"><strong>Boost.Bimap doxygen&#25991;&#26723;</strong></span></a>
+        &#27983;&#35272;&#20195;&#30721;&#12290;
       </p>
 <p>
The code follows the <a href="http://www.boost.org/more/lib_guide.htm"; target="_top">Boost - Library Requirement and Guidelines</a> as closely as possible.</p><p> - 代码尽可能接近于 <a href="http://www.boost.org/more/lib_guide.htm"; target="_top">Boost
-        库的要求和指导</a>。
+        Library Requirement and Guidelines</a> as closely as possible.<br>
+ &#20195;&#30721;&#23613;&#21487;&#33021;&#25509;&#36817;&#20110; <a href="http://www.boost.org/more/lib_guide.htm"; target="_top">Boost&#24211;&#30340;&#35201;&#27714;&#21644;&#25351;&#23548;</a>&#12290;
       </p>
 <div class="table">
-<a name="id2750025"></a><p class="title"><b>Table&nbsp;1.10.&nbsp;folders in boost/bimap</b></p><p class="title"><b>表 1.10. boost/bimap 中的文件夹 </b></p> -<div class="table-contents"><table class="table" summary="folders in boost/bimap">
-<colgroup><col><col></colgroup>
+<a name="id5004491"></a><p class="title"><b>Table 1.10. folders in boost/bimap boost/bimap&#20013;&#30340;&#25991;&#20214;&#22841;</b></p> +<div class="table-contents"><table class="table" summary="folders in boost/bimap boost/bimap&#20013;&#30340;&#25991;&#20214;&#22841;">
+<colgroup>
+<col>
+<col>
+</colgroup>
 <thead><tr>
 <th>
             <p>
-              name 名字
+              name &#21517;&#23383;
             </p>
             </th>
 <th>
             <p>
-              what is inside? 里面有什么?
+ what is inside? &#37324;&#38754;&#26377;&#20160;&#20040;&#65311;
             </p>
             </th>
 </tr></thead>
@@ -54,10 +59,14 @@
 <tr>
 <td>
             <p>
-              user level header files</p><p>用户级头文件
+ <code class="computeroutput"><span class="special">/</span></code>
             </p>
             </td>
-<td class="auto-generated">&nbsp;</td>
+<td>
+            <p>
+ user level header files <br> &#29992;&#25143;&#32423;&#22836;&#25991;&#20214;
+            </p>
+            </td>
 </tr>
 <tr>
 <td>
@@ -67,7 +76,7 @@
             </td>
 <td>
             <p>
-              tagged idiom</p><p>标签惯用法
+              tagged idiom <br> &#26631;&#31614;&#24815;&#29992;&#27861;
             </p>
             </td>
 </tr>
@@ -79,7 +88,7 @@
             </td>
 <td>
             <p>
-              the bimap data</p><p>bimap 的数据
+              the bimap data <br> bimap &#30340;&#25968;&#25454;
             </p>
             </td>
 </tr>
@@ -91,7 +100,7 @@
             </td>
 <td>
             <p>
-              easy way of adapting containers</p><p>适配容器的简单方法
+ easy way of adapting containers <br> &#36866;&#37197;&#23481;&#22120;&#30340;&#31616;&#21333;&#26041;&#27861;
             </p>
             </td>
 </tr>
@@ -103,7 +112,7 @@
             </td>
 <td>
             <p>
-              bimap views</p><p>bimap 的视图
+              bimap views <br> bimap &#30340;&#35270;&#22270;
             </p>
             </td>
 </tr>
@@ -115,7 +124,7 @@
             </td>
 <td>
             <p>
-              support for property map concept</p><p>对属性映射概念的支持
+ support for property map concept <br> &#23545;&#23646;&#24615;&#26144;&#23556;&#27010;&#24565;&#30340;&#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -123,18 +132,21 @@
 </table></div>
 </div>
 <br class="table-break"><div class="table">
-<a name="id2750155"></a><p class="title"><b>Table&nbsp;1.11.&nbsp;folders in each folder</b></p><p class="title"><b>表 1.11. 在各个文件夹中的文件夹 </b></p> -<div class="table-contents"><table class="table" summary="folders in each folder">
-<colgroup><col><col></colgroup>
+<a name="id5004660"></a><p class="title"><b>Table 1.11. folders in each folder &#22312;&#21508;&#20010;&#25991;&#20214;&#22841;&#20013;&#30340;&#25991;&#20214;&#22841;</b></p> +<div class="table-contents"><table class="table" summary="folders in each folder &#22312;&#21508;&#20010;&#25991;&#20214;&#22841;&#20013;&#30340;&#25991;&#20214;&#22841;">
+<colgroup>
+<col>
+<col>
+</colgroup>
 <thead><tr>
 <th>
             <p>
-              name 名字
+              name &#21517;&#23383;
             </p>
             </th>
 <th>
             <p>
-              what is inside? 里面有什么?
+ what is inside? &#37324;&#38754;&#26377;&#20160;&#20040;&#65311;
             </p>
             </th>
 </tr></thead>
@@ -146,7 +158,7 @@
             </td>
 <td>
             <p>
-              class definitions&nbsp;</p><p>类定义
+              class definitions<br> &#31867;&#23450;&#20041;
             </p>
             </td>
 </tr>
@@ -158,7 +170,7 @@
             </td>
 <td>
             <p>
- optional metafunctions and free functions</p><p>可选的元函数 和普通函数 + optional metafunctions and free functions<br> &#21487;&#36873;&#30340;&#20803;&#20989;&#25968;&#21644;&#26222;&#36890;&#20989;&#25968;
             </p>
             </td>
 </tr>
@@ -170,7 +182,7 @@
             </td>
 <td>
             <p>
- things not intended for the user's eyes</p><p>不打算给用户看 的东西 + things not intended for the user's eyes<br> &#19981;&#25171;&#31639;&#32473;&#29992;&#25143;&#30475;&#30340;&#19996;&#35199;
             </p>
             </td>
 </tr>
@@ -179,16 +191,17 @@
 </div>
 <br class="table-break">
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="additional_features.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_student_and_the_mentor.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html Mon Mar 8 01:27:36 2010
@@ -1,51 +1,54 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>The student and the mentor</title><link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>The student and the mentor &#23398;&#29983;&#19982;&#23548;&#24072;</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="up" href="../rationale.html" title="Rationale">
-<link rel="prev" href="code.html" title="Code">
-<link rel="next" href="../history.html" title="History"></head>
-<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../rationale.html" title="Rationale &#21407;&#29702;">
+<link rel="prev" href="code.html" title="Code &#20195;&#30721;">
+<link rel="next" href="../history.html" title="History &#21382;&#21490;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libraries.htm">Libraries</a></td> -<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="code.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../history.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.rationale.the_student_and_the_mentor"></a><a class="link" href="the_student_and_the_mentor.html" title="The student and the mentor">The
-      student and the mentor 学生与导师</a>
+<a name="boost_bimap.rationale.the_student_and_the_mentor"></a><a class="link" href="the_student_and_the_mentor.html" title="The student and the mentor &#23398;&#29983;&#19982;&#23548;&#24072;"> The
+      student and the mentor &#23398;&#29983;&#19982;&#23548;&#24072;</a>
 </h3></div></div></div>
-<div class="tip"><table summary="Tip" border="0">
-<tbody><tr>
+<div class="tip"><table border="0" summary="Tip">
+<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../doc/html/images/tip.png"></td>
-<th align="left">Tip 提示</th>
+<th align="left">Tip</th>
 </tr>
 <tr><td align="left" valign="top"><p>
It is a good idea to read the original <a href="http://h1.ripway.com/mcape/boost/libs/misc/"; target="_top">Boost.Misc - SoC proposal</a> first.</p><p>请先阅读原有的 <a href="http://h1.ripway.com/mcape/boost/libs/misc/"; target="_top">Boost.Misc
-          SoC 建议书</a>。
+ SoC proposal</a> first.<br> &#35831;&#20808;&#38405;&#35835;&#21407;&#26377;&#30340; <a href="http://h1.ripway.com/mcape/boost/libs/misc/"; target="_top">Boost.Misc
+          SoC &#24314;&#35758;&#20070;</a>&#12290;
         </p></td></tr>
-</tbody></table></div>
+</table></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
<code class="literal">- The discussion starts with Joaquin trying to strip out the
-            "misc" name out of the library -</code>
+ "misc" name out of the library -</code><br> <code class="literal">- + &#36825;&#19968;&#35752;&#35770;&#20174; Joaquin &#35797;&#22270;&#21093;&#21435;&#26412;&#24211;&#30340; "misc" &#21517;&#23383;&#24320;&#22987;
+            -</code>
           </p>
 <p>
- <code class="literal">- 这一讨论从 Joaquin 试图剥去本库的 "misc" 名 字开始 -</code></p>
+        </p>
 </blockquote></div>
 <p>
<span class="inlinemediaobject"><img src="../../images/people/joaquin.png" alt="joaquin"></span>
@@ -67,13 +70,13 @@
boost::mru, etc, and no common intro to them. This also opens up the possibility to add other containers to the suite which aren't based on B.MI. What's your stance on this? Do you see a value in keeping miscs - conceptually together?</em></span></p><p><span class="emphasis"><em></em></span><span class="emphasis"><em>思
-考一下这个问题,MISC容器的统一原则也许是具有误导性的:当然所有 miscs
-在其内部使用了多索引,但是这在外部接口中并不会反映出来(因为它应该如 此,OTOH)。所以,从用户的角度来看,miscs -是完全异构的东西。此外,在你的建议中没有任何全局的机制为所有 miscs 共用。如 果放开这个 misc -原则,将每个容器作为一个单独的库,又如何?你就有了 boost::bimap, boost::mru, -等等,它们没有共同的说明。这也开放了一个可能性,添加其它容器到这个不是基于 B.MI 的套件中。你对此有何立场?你认为值得一起保持 miscs
-概念吗? </em></span>
+ conceptually together?<br> &#24605;&#32771;&#19968;&#19979;&#36825;&#20010;&#38382;&#39064;&#65292;MISC&#23481;&#22120;&#30340;&#32479;&#19968;&#21407;&#21017;&#20063;&#35768;&#26159;&#20855;&#26377;&#35823;&#23548;&#24615;&#30340;&#65306;&#24403;&#28982;&#25152;&#26377; + miscs &#22312;&#20854;&#20869;&#37096;&#20351;&#29992;&#20102;&#22810;&#32034;&#24341;&#65292; &#20294;&#26159;&#36825;&#22312;&#22806;&#37096;&#25509;&#21475;&#20013;&#24182;&#19981;&#20250;&#21453;&#26144;&#20986;&#26469;(&#22240;&#20026;&#23427;&#24212;&#35813;&#22914;&#27492;&#65292;OTOH)&#12290;&#25152;&#20197;&#65292;&#20174;&#29992;&#25143;&#30340;&#35282;&#24230;&#26469;&#30475;&#65292;miscs + &#26159;&#23436;&#20840;&#24322;&#26500;&#30340;&#19996;&#35199;&#12290; &#27492;&#22806;&#65292;&#22312;&#20320;&#30340;&#24314;&#35758;&#20013;&#27809;&#26377;&#20219;&#20309;&#20840;&#23616;&#30340;&#26426;&#21046;&#20026;&#25152;&#26377; + miscs &#20849;&#29992;&#12290;&#22914;&#26524;&#25918;&#24320;&#36825;&#20010; misc &#21407;&#21017;&#65292;&#23558;&#27599;&#20010;&#23481;&#22120;&#20316;&#20026;&#19968;&#20010;&#21333;&#29420;&#30340;&#24211;&#65292;&#21448;&#22914;&#20309;&#65311; + &#20320;&#23601;&#26377;&#20102; boost::bimap, boost::mru, &#31561;&#31561;&#65292;&#23427;&#20204;&#27809;&#26377;&#20849;&#21516;&#30340;&#35828;&#26126;&#12290;&#36825;&#20063;&#24320;&#25918;&#20102;&#19968;&#20010;&#21487;&#33021;&#24615;&#65292;&#28155;&#21152;&#20854;&#23427;&#23481;&#22120;&#21040;&#36825;&#20010;&#19981;&#26159;&#22522;&#20110; + B.MI &#30340;&#22871;&#20214;&#20013;&#12290; &#20320;&#23545;&#27492;&#26377;&#20309;&#31435;&#22330;&#65311;&#20320;&#35748;&#20026;&#20540;&#24471;&#19968;&#36215;&#20445;&#25345;
+            miscs &#27010;&#24565;&#21527;&#65311; </em></span>
           </p>
 <p>
         </p>
@@ -85,8 +88,8 @@
         <span class="bold"><strong>Matias</strong></span>
       </p>
 <div class="blockquote"><blockquote class="blockquote">
-
-
+<p>
+          </p>
 <p>
<span class="emphasis"><em> As the original proposal states only two containers (bimap and mru set) both based in B.MI, it was straight forward to group them
@@ -103,15 +106,20 @@
the libraries will be consistent and what I will learn coding the bimap family will be used when I start to code the mru family. When the mru family is in place, I will surely have learnt other things to improve
-            the bimap group. </em></span>
+ the bimap group.<br> &#20316;&#20026;&#21407;&#26469;&#30340;&#25552;&#26696;&#65292;&#21482;&#26377;&#20004;&#20010;&#23481;&#22120; (bimap + &#21644; mru set)&#65292;&#23427;&#20204;&#22343;&#22522;&#20110; B.MI, &#23558;&#23427;&#20204;&#32452;&#21512;&#22312;&#19968;&#36215;&#26159;&#24456;&#26174;&#28982;&#30340;&#12290; + &#24403;&#25105;&#32534;&#20889; SoC &#24314;&#35758;&#26102;&#65292;&#25105;&#32463;&#21382;&#20102;&#31867;&#20284;&#30340;&#24863;&#35273;&#65292;&#20004;&#20010;&#31867;&#26063;&#24320;&#22987;&#22686;&#38271;&#12290;&#27491;&#22914;&#20320;&#25152;&#35828;&#65292;&#21807;&#19968;&#30340;&#20849;&#21516;&#28857;&#26159;&#23427;&#20204;&#30340;&#20869;&#37096;&#23454;&#29616;&#12290; + &#25105;&#24819;&#20102;&#19968;&#20010;&#26356;&#20026;&#36890;&#29992;&#30340;&#26694;&#26550;&#65292;&#20197;&#21512;&#24182;&#36825;&#20004;&#20010;&#31867;&#26063;(&#20197;&#21450;&#20854;&#23427;&#20869;&#37096;&#30456;&#20851;&#30340;&#31867;)&#65292;&#26368;&#32456;&#24819;&#20986;&#19968;&#20010;&#20027;&#24847;&#65306;Boost.MultiIndex! + &#22240;&#27492;&#65292;&#25105;&#35748;&#20026;&#35797;&#22270;&#32479;&#19968;&#36825;&#20004;&#20010;&#31867;&#26063;&#24182;&#19981;&#26159;&#19968;&#20010;&#22909;&#20027;&#24847;&#65292;&#25105;&#25237;&#31080;&#36190;&#21516;&#21435;&#38500; + boost::misc::bimap &#21644; boost::misc::mru &#30340; misc &#37096;&#20998;&#12290; &#26080;&#35770;&#22914;&#20309;&#65292;&#23545;&#20110;&#25105;&#20204; + SoC &#24212;&#29992;&#26469;&#35828;&#65292;&#23558;&#36825;&#20004;&#20010;&#31867;&#26063;&#25918;&#22312;&#21516;&#19968;&#20010;&#39033;&#30446;&#20013;&#26159;OK&#30340;&#65292;&#22240;&#20026;&#27605;&#31455;&#20174;&#22806;&#38754;&#30475;&#23427;&#20204;&#26159;&#23436;&#20840;&#26080;&#20851;&#30340;&#65292; + &#20026;&#20102;&#26500;&#24314;&#36825;&#20123;&#24211;&#65292;&#25105;&#24517;&#39035;&#35201;&#20570;&#30340;&#24037;&#20316;&#23601;&#26159;&#19968;&#33268;&#24615;&#65292;&#25105;&#20174; + bimap &#31867;&#26063;&#30340;&#32534;&#30721;&#20013;&#23398;&#21040;&#30340;&#65292;&#22312;&#25105;&#32534;&#20889; mru &#31867;&#26063;&#26102;&#20063;&#20250;&#26377;&#29992;&#12290; + &#24403; mru &#31867;&#26063;&#20889;&#22909;&#21518;&#65292;&#25105;&#20063;&#30830;&#23450;&#20250;&#23398;&#21040;&#20854;&#23427;&#19996;&#35199;&#20197;&#25913;&#36827;
+            bimap &#31867;&#26063;&#12290; </em></span>
           </p>
-<p><span class="emphasis"><em>作为原来的提案,只有两个容器 (bimap 和 mru set),它们均基于
-B.MI, 将它们组合在一起是很显然的。当我编写 SoC
-建议时,我经历了类似的感觉,两个类族开始增长。正如你所说,唯一的共同点是它 们的内部实现。我想了一个更为通用的框架,以合并这两个类族(以及其它内部 -相关的类),最终想出一个主意:Boost.MultiIndex! 因此,我认为试图统一这两个类 族并不是一个好主意,我投票赞同去除
-boost::misc::bimap 和 boost::misc::mru 的 misc 部分。无论如何,对于我们 SoC
-应用来说,将这两个类族放在同一个项目中是OK的,因为毕竟从外面看它们是完全无 关的,为了构建这些库,我必须要做的工作就是一致性,我从 bimap -类族的编码中学到的,在我编写 mru 类族时也会有用。当 mru 类族写好后,我也确 定会学到其它东西以改进 bimap 类族。</em></span><br></p>
+<p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -124,10 +132,13 @@
containers. For now, a link to boost::bimap and other one to boost::mru will suffice. If you think about the title of such a document, you will probably come up with something like: Common Multi Index Specialized - Containers, and we are back to our misc proposal. So, to order some ideas:</em></span></p><p><span class="emphasis"><em></em></span><span class="emphasis"><em> -另一方面,我认为普通用户至少有一些文档链接到 B.MI 文档是有帮助的,这些文档 列举了最常见的用例(例如一个 bimap 和一个 mru -set&nbsp;),并指出在哪里可以找到这些容器的干净实现。现在,有一个到 boost::bimap 的链接和另一个到 boost::mru -的链接就足够了。如果你要为这个文档想一个标题,你可以用这样的名字:通用多索 引专用容器,我们又回到了我们的 misc 建议。所以,有以下想法: </em></span> + Containers, and we are back to our misc proposal. So, to order some ideas:<br> + &#21478;&#19968;&#26041;&#38754;&#65292;&#25105;&#35748;&#20026;&#26222;&#36890;&#29992;&#25143;&#33267;&#23569;&#26377;&#19968;&#20123;&#25991;&#26723;&#38142;&#25509;&#21040; B.MI + &#25991;&#26723;&#26159;&#26377;&#24110;&#21161;&#30340;&#65292;&#36825;&#20123;&#25991;&#26723;&#21015;&#20030;&#20102;&#26368;&#24120;&#35265;&#30340;&#29992;&#20363;(&#20363;&#22914;&#19968;&#20010; + bimap &#21644;&#19968;&#20010; mru set )&#65292; &#24182;&#25351;&#20986;&#22312;&#21738;&#37324;&#21487;&#20197;&#25214;&#21040;&#36825;&#20123;&#23481;&#22120;&#30340;&#24178;&#20928;&#23454;&#29616;&#12290;&#29616;&#22312;&#65292;&#26377;&#19968;&#20010;&#21040; + boost::bimap &#30340;&#38142;&#25509;&#21644;&#21478;&#19968;&#20010;&#21040; boost::mru &#30340;&#38142;&#25509;&#23601;&#36275;&#22815;&#20102;&#12290; + &#22914;&#26524;&#20320;&#35201;&#20026;&#36825;&#20010;&#25991;&#26723;&#24819;&#19968;&#20010;&#26631;&#39064;&#65292;&#20320;&#21487;&#20197;&#29992;&#36825;&#26679;&#30340;&#21517;&#23383;&#65306;&#36890;&#29992;&#22810;&#32034;&#24341;&#19987;&#29992;&#23481;&#22120;&#65292;&#25105;&#20204;&#21448;&#22238;&#21040;&#20102;&#25105;&#20204;&#30340; + misc &#24314;&#35758;&#12290;&#25152;&#20197;&#65292;&#26377;&#20197;&#19979;&#24819;&#27861;&#65306; </em></span>
           </p>
 <p>
         </p>
@@ -137,30 +148,31 @@
           </p>
 <p>
<span class="emphasis"><em>- A new family of containers that can be accessed by both key
-            will be created. (boost::bimap)</em></span>
+ will be created. (boost::bimap)<br> - &#19968;&#20010;&#26032;&#30340;&#65292;&#21487;&#20197;&#36890;&#36807;&#20004;&#20010;&#38190;&#26469;&#35775;&#38382;&#30340;&#23481;&#22120;&#26063;&#34987;&#21019;&#24314;&#12290;(boost::bimap)</em></span>
           </p>
 <p>
- <span class="emphasis"><em>-&nbsp;一个新的,可以通过两个键来访问的 容器族被创建。(boost::bimap)</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
<span class="emphasis"><em>- A new family of time aware containers will see the light.
-            (boost::mru)</em></span>
+ (boost::mru)<br> - &#19968;&#20010;&#26032;&#30340;&#26102;&#38388;&#24863;&#30693;&#30340;&#23481;&#22120;&#26063;&#23558;&#38382;&#19990;&#12290;(boost::mru)</em></span>
           </p>
 <p>
- <span class="emphasis"><em>- 一个新的时间感知的容器族将问世。 (boost::mru)</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
<span class="emphasis"><em>- A page can be added to B.MI documentation, titled misc that
-            links this new libraries.</em></span>
+ links this new libraries.<br> - &#21521; B.MI &#25991;&#26723;&#20013;&#22686;&#21152;&#19968;&#39029;&#65292;&#26631;&#39064;&#20026; + misc&#65292;&#38142;&#25509;&#21040;&#26032;&#30340;&#24211;&#12290;</em></span>
           </p>
 <p>
- <span class="emphasis"><em>- 向 B.MI 文档中增加一页,标题为 misc,链接到新的库。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -176,15 +188,17 @@
disappear from the code and the documentation of bimap and mru. From now on the only use for it will be to identify our SoC project. I am thinking in a name for the bimap library. What about Boost.BidirectionalMap?
-            Ideas? </em></span>
+ Ideas?<br> &#23545;&#20110;&#29992;&#25143;&#26469;&#35828;&#65292;&#36825;&#26159;&#19968;&#20010;&#26356;&#20026;&#28165;&#26224;&#30340;&#26694;&#26550;&#12290;&#20182;&#20204;&#21487;&#20197;&#20351;&#29992; + mru &#23481;&#22120;&#32780;&#26080;&#39035;&#30693;&#36947; Boost.MultiIndex&#12290; &#32780;&#19988; B.MI &#30340;&#29992;&#25143;&#21017;&#24471;&#21040;&#19968;&#20123;&#20182;&#20204;&#24120;&#29992;&#30340;&#23481;&#22120;&#65292;&#36825;&#20123;&#23481;&#22120;&#24050;&#32463;&#22312;&#20854;&#23427;&#24211;&#20013;&#23454;&#29616;&#20102;STL&#21451;&#22909;&#30340;&#25509;&#21475;&#12290; + &#27491;&#22914;&#20320;&#25152;&#25351;&#20986;&#30340;&#65292;&#36825;&#26679;&#26356;&#21487;&#25193;&#23637;&#65292;&#22240;&#20026;&#23427;&#21521; bimap &#21644; mru + &#31867;&#26063;&#30340;&#20854;&#23427;&#24211;&#25171;&#24320;&#20102;&#22823;&#38376;&#65292;&#32780;&#19981;&#20165;&#26159; Boost.MultiIndex&#65292; + &#21516;&#26102;&#20063;&#27809;&#26377;&#25439;&#23475;&#26356;&#20026;&#36890;&#29992;&#30340; boost &#26694;&#26550;&#12290;&#21333;&#35789; "misc" + &#27491;&#20174;&#20195;&#30721;&#21644; bimap &#21450; mru &#30340;&#25991;&#26723;&#20013;&#28040;&#22833;&#12290; &#20174;&#29616;&#22312;&#36215;&#65292;&#23427;&#30340;&#21807;&#19968;&#29992;&#22788;&#23601;&#26159;&#30830;&#23450;&#25105;&#20204;&#30340; + SoC &#39033;&#30446;&#12290;&#25105;&#27491;&#22312;&#32771;&#34385;&#20026; bimap &#24211;&#36215;&#19968;&#20010;&#21517;&#23383;&#12290; &#21483; Boost.BidirectionalMap + &#22914;&#20309;&#65311;&#26377;&#27809;&#26377;&#20854;&#23427;&#24819;&#27861;&#65311; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>对于用户来说,这是一个更为清晰的框架。他 们可以使用 mru
-容器而无须知道 Boost.MultiIndex。而且 B.MI
-的用户则得到一些他们常用的容器,这些容器已经在其它库中实现了STL友好的接口。 正如你所指出的,这样更可扩展,因为它向 bimap 和 mru -类族的其它库打开了大门,而不仅是 Boost.MultiIndex,同时也没有损害更为通用 的 boost 框架。单词 "misc" 正从代码和 -bimap 及 mru 的文档中消失。从现在起,它的唯一用处就是确定我们的 SoC 项目。 我正在考虑为 bimap 库起一个名字。叫
-Boost.BidirectionalMap 如何?有没有其它想法?</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -195,13 +209,16 @@
 <p>
<span class="emphasis"><em> Yes, Boost.Bimap. In my opinion, bimap is a well known name in the Boost and even in the C++ community. It sounds and is short. Why - not to vindicate yourself as the owner of this name? </em></span> + not to vindicate yourself as the owner of this name?<br> &#26159;&#30340;&#65292;&#21483; + Boost.Bimap &#21543;&#12290;&#25105;&#35748;&#20026;&#65292;bimap &#26159;&#19968;&#20010;&#22312; Boost &#29978;&#33267;&#22312; C++ + &#31038;&#21306;&#20013;&#20154;&#25152;&#20849;&#30693;&#30340;&#21517;&#23383;&#12290; &#23427;&#24456;&#21709;&#20142;&#65292;&#20063;&#36739;&#30701;&#12290;&#20316;&#20026;&#36825;&#20010;&#21517;&#23383;&#30340;&#25152;&#26377;&#32773;&#65292;&#20320;&#20026;&#20160;&#20040;&#32500;&#25252;&#33258;&#36523;&#21602;&#65311;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>是的,叫 Boost.Bimap 吧。我认为,bimap 是一个在 Boost 甚至在 C++ 社区中人所共知的名字。它很响亮,也较短。作为这个名 字的所有者,你为什么维护自身呢?</em></span></p>
+        </p>
 </blockquote></div>
 <p>
- <code class="literal">- Then after a week of work -</code></p><p><code class="literal">- 在一周的工作后 -</code> + <code class="literal">- Then after a week of work -<br> - &#22312;&#19968;&#21608;&#30340;&#24037;&#20316;&#21518; -</code>
       </p>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -214,11 +231,13 @@
you have told me, we must offer a "one_to_many_map" and a "multi_bimap" as part of the library. The framework I am actually working allowed to construct this kind of bidirectional maps and it is easy to understand
-            from the user side. </em></span>
+ from the user side.<br> &#29616;&#22312; Boost.Bimap &#24050;&#32463;&#26377;&#28857;&#25104;&#24418;&#20102;&#65292;&#25105;&#30475;&#21040;&#20102;&#20320;&#25152;&#35828;&#30340;&#65292;&#25105;&#20204;&#24517;&#39035;&#25552;&#20379;&#19968;&#20010; + "&#19968;&#23545;&#22810;&#26144;&#23556;" &#21644;&#19968;&#20010; "multi_bimap" &#20316;&#20026;&#26412;&#24211;&#30340;&#19968;&#37096;&#20998;&#12290; + &#25105;&#25152;&#20351;&#29992;&#30340;&#26694;&#26550;&#20854;&#23454;&#26159;&#20801;&#35768;&#26500;&#24314;&#36825;&#31181;&#21452;&#21521;&#26144;&#23556;&#30340;&#65292;&#32780;&#19988;&#20174;&#29992;&#25143;&#20391;&#26469;&#35828;&#20063;&#24456;&#23481;&#26131;&#29702;&#35299;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>现在 Boost.Bimap 已经有点成形了,我看到 了你所说的,我们必须提供一个 "一对多映射" 和一个 "multi_bimap" - 作为本库的一部分。我所使用的框架其实是允许构建这种双向映射 的,而且从用户侧来说也很容易理解。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -227,10 +246,11 @@
 <p>
           </p>
 <p>
- <span class="emphasis"><em> OK, I am glad we agree on this point. </em></span> + <span class="emphasis"><em> OK, I am glad we agree on this point.<br> &#22909;&#30340;&#65292;&#25105;&#24456;&#39640;&#20852;&#25105;&#20204;&#37117;&#21516;&#24847;&#36825;&#19968;&#28857;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>好的,我很高兴我们都同意这一点。 </em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -240,11 +260,12 @@
           </p>
 <p>
<span class="emphasis"><em> With respect to the symmetry of the key access names, I have - to agree that there is not much a difference between the following ones: + to agree that there is not much a difference between the following ones:<br> + &#20851;&#20110;&#38190;&#35775;&#38382;&#21517;&#30340;&#23545;&#31216;&#24615;&#65292;&#25105;&#24517;&#39035;&#21516;&#24847;&#20197;&#19979;&#20960;&#20010;&#24182;&#27809;&#26377;&#22826;&#22823;&#30340;&#21306;&#21035;&#65306;
             </em></span>
           </p>
 <p>
- <span class="emphasis"><em>关于键访问名的对称性,我必须同意以下几个 并没有太大的区别:</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -287,10 +308,11 @@
           </p>
 <p>
<span class="emphasis"><em> In my opinion it is a matter of taste, but left/right sounds
-            more symmetrical than the others. </em></span>
+ more symmetrical than the others.<br> &#25105;&#35748;&#20026;&#36825;&#21482;&#26159;&#19968;&#20010;&#21697;&#21619;&#30340;&#38382;&#39064;&#65292;&#20294;&#22909;&#35937; + left/right &#27604;&#20854;&#23427;&#20960;&#20010;&#26356;&#20026;&#23545;&#31216;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我认为这只是一个品味的问题,但好象 left/right 比其它几个更为对称。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -300,10 +322,12 @@
           </p>
 <p>
<span class="emphasis"><em> I like very much the left/right notation, it is very simple - to remember and it is a lot more symmetrical than to/from. </em></span> + to remember and it is a lot more symmetrical than to/from.<br> &#25105;&#21916;&#27426; + left/right &#30340;&#35760;&#27861;&#65292;&#23427;&#24456;&#23481;&#26131;&#34987;&#35760;&#20303;&#65292;&#32780;&#19988;&#27604; to/from &#26356;&#20026;&#23545;&#31216;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我喜欢 left/right 的记法,它很容易被记 住,而且比 to/from 更为对称。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -319,12 +343,15 @@
bimap <span class="bold"><strong>is-a</strong></span> multi_index_container specializes with a data type very comfortable called bipair, that can be seen like any of the two maps that integrates it using map views. This scheme has
-            great benefits for users: </em></span>
+ great benefits for users:<br> &#39318;&#20808;&#65292;&#25105;&#30340;&#24819;&#27861;&#26159;&#20026;&#20102;&#26131;&#29992;&#24615;&#38544;&#34255; + B.MI &#30340;&#26680;&#24515;&#65292;&#35753;&#23427;&#30452;&#35266;&#19978;&#26356;&#35937; STL&#12290;&#19981;&#36807;&#65292;&#25105;&#20063;&#24847;&#35782;&#21040; + B.MI &#27604;&#25105;&#24819;&#35937;&#30340;&#26356;&#20026;&#19968;&#33268;&#21644;&#26131;&#29992;&#12290; &#36825;&#20351;&#24471;&#25105;&#20877;&#27425;&#32771;&#34385;&#20102;&#36825;&#20010;&#38382;&#39064;&#12290;&#22312;&#25105;&#29616;&#22312;&#25152;&#32534;&#30721;&#30340;&#35774;&#35745;&#20013;&#65292;bimap + &#26159;&#19968;&#20010;&#20197;&#26576;&#20010;&#25968;&#25454;&#31867;&#22411;&#29305;&#21270;&#30340; multi_index_container&#65292; &#35813;&#25968;&#25454;&#31867;&#22411;&#36866;&#21512;&#21483;&#20316; + bipair&#65292;&#21487;&#20197;&#30475;&#20986;&#65292;&#23427;&#30001;&#20219;&#24847;&#20004;&#20010;&#26144;&#23556;&#20351;&#29992;&#26144;&#23556;&#35270;&#22270;&#38598;&#25104;&#32780;&#24471;&#12290;&#36825;&#31181;&#26426;&#21046;&#23545;&#20110;&#29992;&#25143;&#26377;&#24456;&#22823;&#22909;&#22788;&#65306;
+            </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>首先,我的想法是为了易用性隐藏 B.MI
-            的核心,让它直观上更象 STL。不过,我也意识到
- B.MI 比我想象的更为一致和易用。这使得我再次考虑了这个问题。在我 现在所编码的设计中,bimap <span class="bold"><strong>是一个</strong></span> 以某个数据类型特化的 multi_index_container,该数据类型适合叫作 bipair,可以 看出,它由任意两个映射使用映射视图集成而得。这种机制对于用户有很大好 处:</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -333,10 +360,12 @@
<span class="emphasis"><em> - If the user already knows B.MI, he can take advantage of the tools that it provides and that are not present in the STL containers. In addition, in some cases the use to indices to see the data can be
-            very useful. </em></span>
+ very useful.<br> - &#22914;&#26524;&#29992;&#25143;&#24050;&#32463;&#30693;&#36947; B.MI&#65292;&#20182;&#21487;&#20197;&#21033;&#29992;&#25152;&#25552;&#20379;&#30340;&#22312; + STL &#23481;&#22120;&#20013;&#25152;&#27809;&#26377;&#30340;&#24037;&#20855;&#12290;&#21478;&#22806;&#65292;&#22312;&#26576;&#20123;&#24773;&#24418;&#19979;&#20351;&#29992;&#32034;&#24341;&#23519;&#30475;&#25968;&#25454;&#26159;&#24456;&#26377;&#29992;&#30340;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em> - 如果用户已经知道 B.MI,他可以利用所提 供的在 STL 容器中所没有的工具。另外,在某些情形下使用索引察看数据是很有用 的。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -344,14 +373,12 @@
 <p>
<span class="emphasis"><em> - If the user does not know anything about B.MI but have an STL framework, the learning curve is reduced to understand the bimap - instantiation and how a is obtained the desired map view. </em></span> + instantiation and how a is obtained the desired map view.<br> - &#22914;&#26524;&#29992;&#25143;&#19981;&#20102;&#35299; + B.MI &#20294;&#26159;&#26377;&#19968;&#20010; STL &#26694;&#26550;&#65292;&#37027;&#20040;&#23398;&#20064;&#26354;&#32447;&#21487;&#20197;&#38477;&#20302;&#20026;&#20102;&#35299; + bimap &#23454;&#20363;&#20197;&#21450;&#22914;&#20309;&#24471;&#21040;&#24819;&#35201;&#30340;&#26144;&#23556;&#35270;&#22270;&#12290; </em></span>
           </p>
-
 <p>
-            <span class="emphasis"><em> - 如果用户不了解 B.MI 但是有一个
-            STL 框架,那么学习曲线可以降低为了解 bimap
-            实例以及如何得到想要的映射视图。 </em></span>
-          </p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -359,10 +386,12 @@
 <p>
<span class="emphasis"><em> Another very important benefit holds: All the algorithms done for B.MI continues to work with Boost.Bimap and if B.MI continues growing,
-            bimap grow automatically. </em></span>
+ bimap grow automatically.<br> &#21478;&#19968;&#20010;&#38750;&#24120;&#37325;&#35201;&#30340;&#22909;&#22788;&#26159;&#65306;&#25152;&#26377;&#23545;&#20110; + B.MI &#21487;&#29992;&#30340;&#31639;&#27861;&#21516;&#26679;&#21487;&#29992;&#20110; Boost.Bimap&#65292;&#22914;&#26524; B.MI &#32487;&#32493;&#21457;&#23637;&#65292;bimap + &#21487;&#20197;&#33258;&#21160;&#36319;&#38543;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>另一个非常重要的好处是:所有对于 B.MI 可 用的算法同样可用于 Boost.Bimap,如果 B.MI 继续发展,bimap 可以自动跟随。 </em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -382,13 +411,15 @@
is of course heavier to maintain, but it gives a degree of freedom to change the guts of your software if you need to. Do not take this like a frontal objection, but I think that it is quite important design decision,
-            not only in the context of bimap but in general. </em></span>
+ not only in the context of bimap but in general.<br> &#21999;... &#36825;&#26159;&#19968;&#20010;&#26377;&#36259;&#30340;&#35774;&#35745;&#20915;&#31574;&#65292;&#20294;&#26159;&#25105;&#26377;&#20445;&#30041;&#24847;&#35265;&#12290;&#22522;&#26412;&#19978;&#20320;&#26159;&#20915;&#23450;&#26292;&#38706; + bimap &#30340;&#23454;&#29616;&#65307; &#22914;&#20320;&#25152;&#35828;&#65292;&#23427;&#26377;&#22909;&#22788;&#65292;&#19981;&#36807;&#20063;&#26377;&#19981;&#23567;&#30340;&#22351;&#22788;&#65306;&#19968;&#26086;*&#20320;&#23558;&#36825;&#20010;&#23454;&#29616;&#35760;&#24405;&#21040;&#25991;&#26723;&#20013;*&#65292;&#23601;&#19981;&#33021;&#20877;&#20462;&#25913;&#23427;&#20102;&#12290; + &#36825;&#30456;&#24403;&#20110;&#19982; B.MI &#32467;&#21512;&#32780;&#27809;&#26377;&#26426;&#20250;&#20877;&#20998;&#24320;&#20102;&#12290;&#21478;&#19968;&#31181;&#21487;&#33021;&#24615;&#26159;&#38544;&#34255;&#20855;&#20307;&#30340;&#23454;&#29616;&#65292;&#22797;&#21046;&#24182;&#35760;&#24405;&#25152;&#25552;&#20379;&#30340;&#21151;&#33021;&#65292; + &#30456;&#21516;&#30340;&#23454;&#29616;&#29305;&#24615;&#24403;&#28982;&#26159;&#22686;&#21152;&#20102;&#32500;&#25252;&#37327;&#65292;&#20294;&#26159;&#22312;&#20320;&#38656;&#35201;&#26102;&#23427;&#21487;&#20197;&#32473;&#20320;&#19968;&#20010;&#20462;&#25913;&#36719;&#20214;&#30340;&#33258;&#30001;&#24230;&#12290; + &#19981;&#35201;&#23558;&#36825;&#20010;&#24847;&#35265;&#35270;&#20026;&#27491;&#38754;&#30340;&#21453;&#23545;&#65292;&#20294;&#25105;&#35748;&#20026;&#23427;&#26159;&#19968;&#20010;&#24456;&#37325;&#35201;&#30340;&#35774;&#35745;&#20915;&#31574;&#65292;&#19981;&#20165;&#26159;&#22312; + bimap &#20013;&#65292;&#32780;&#19988;&#26159;&#36890;&#29992;&#30340;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>嗯... 这是一个有趣的设计决策,但是我有保 留意见。基本上你是决定暴露 bimap 的实现;如你所说,它有好处,不过也有不小的 坏处:一旦<span class="bold"><strong>你将这个实现记录到文档中 </strong></span>,
-就不能再修改它了。这相当于与 B.MI
-结合而没有机会再分开了。另一种可能性是隐藏具体的实现,复制并记录所提供的功 能,相同的实现特性当然是增加了维护量,但是在你需要时它可以给你一个修改 -软件的自由度。不要将这个意见视为正面的反对,但我认为它是一个很重要的设计决 策,不仅是在 bimap 中,而且是通用的。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -396,18 +427,20 @@
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
-
 <p>
<span class="emphasis"><em> You are quite right here. I think we have to choose the hardest path and hide the B.MI core from the user. I am sending you the first
-            draft of bimap along with some documentation.</em></span></p>
-<p>
- <span class="emphasis"><em>这里你是对的。我想我们必须选择最艰难 的道路,向用户隐藏 B.MI 核心。我正将 bimap 的第一稿以及一些文档发给你。 </em></span> + draft of bimap along with some documentation.<br> &#36825;&#37324;&#20320;&#26159;&#23545;&#30340;&#12290;&#25105;&#24819;&#25105;&#20204;&#24517;&#39035;&#36873;&#25321;&#26368;&#33392;&#38590;&#30340;&#36947;&#36335;&#65292;&#21521;&#29992;&#25143;&#38544;&#34255; + B.MI &#26680;&#24515;&#12290;&#25105;&#27491;&#23558; bimap &#30340;&#31532;&#19968;&#31295;&#20197;&#21450;&#19968;&#20123;&#25991;&#26723;&#21457;&#32473;&#20320;&#12290;
+            </em></span>
           </p>
+<p>
+        </p>
 </blockquote></div>
 <p>
<code class="literal">- This completes the second week, the documentation was basically - the first section of this rationale -</code></p><p><code class="literal">- 第二周结束后,文档基本上就是本原理的第一节 -</code> + the first section of this rationale -<br> - &#31532;&#20108;&#21608;&#32467;&#26463;&#21518;&#65292;&#25991;&#26723;&#22522;&#26412;&#19978;&#23601;&#26159;&#26412;&#21407;&#29702;&#30340;&#31532;&#19968;&#33410;
+        -</code>
       </p>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -418,10 +451,11 @@
 <p>
<span class="emphasis"><em> I must confess that I am beginning to like what I see. I am mathematical by vocation, and when I see symmetry in a formulation I
-            believe that it is in the right track. </em></span>
+ believe that it is in the right track.<br> &#25105;&#24517;&#39035;&#25215;&#35748;&#65292;&#25105;&#24320;&#22987;&#21916;&#27426;&#25152;&#30475;&#21040;&#30340;&#19996;&#35199;&#20102;&#12290;&#25105;&#22825;&#29983;&#23601;&#26159;&#25968;&#23398;&#30340;&#65292;&#24403;&#25105;&#30475;&#21040;&#20844;&#24335;&#20013;&#30340;&#23545;&#31216;&#24615;&#26102;&#65292;&#25105;&#30456;&#20449;&#36825;&#23601;&#26159;&#27491;&#30830;&#30340;&#36947;&#36335;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我必须承认,我开始喜欢所看到的东西了。我 天生就是数学的,当我看到公式中的对称性时,我相信这就是正确的道路。 </em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -430,10 +464,11 @@
 <p>
           </p>
 <p>
- <span class="emphasis"><em> We are two mathematicians by vocation then. </em></span> + <span class="emphasis"><em> We are two mathematicians by vocation then.<br> &#37027;&#20040;&#25105;&#20204;&#20457;&#22825;&#29983;&#37117;&#26159;&#25968;&#23398;&#30340;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>那么我们俩天生都是数学的。 </em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -444,11 +479,13 @@
 <p>
<span class="emphasis"><em> I think that the part of std::set theory is very clear. To me, it turns out to me somewhat strange to consider the rank of a map - (values X) like a std::set, but of course the formulation is consistent. + (values X) like a std::set, but of course the formulation is consistent.<br> + &#25105;&#35748;&#20026; std::set &#29702;&#35770;&#30340;&#37096;&#20998;&#24456;&#28165;&#26970;&#20102;&#12290;&#23545;&#25105;&#26469;&#35828;&#65292;&#23558;&#19968;&#20010;&#26144;&#23556;(&#20540; + X)&#30340;&#35780;&#32423;&#24403;&#25104; std::set &#26469;&#32771;&#34385;&#65292;&#26377;&#28857;&#22855;&#24618;&#65292;&#20294;&#26159;&#24403;&#28982;&#20844;&#24335;&#26159;&#19968;&#33268;&#30340;&#12290;
             </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我认为 std::set 理论的部分很清楚了。对我 来说,将一个映射(值 X)的评级当成</em></span><span class="emphasis"><em> std::set 来考虑</em></span><span class="emphasis"><em>,有点奇怪,但是当然公 式是一致的。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -463,12 +500,15 @@
and sees the bimap instantiation he is not going to have problems understanding it. Perhaps it is easier to understand it if we use your notation: ordered_nonunique, unordered_unique, but this goes against our STL facade. In my opinion - the user that comes from STL must have to learn as less as possible.
-            </em></span>
+ the user that comes from STL must have to learn as less as possible.<br> + &#25105;&#38750;&#24120;&#21916;&#27426;&#23427;&#65292;&#24320;&#22987;&#23427;&#21487;&#33021;&#26377;&#28857;&#21476;&#24618;&#65292;&#20294;&#29616;&#22312;&#25105;&#24050;&#32463;&#20064;&#24815;&#20102;&#65292;&#23427;&#24456;&#23481;&#26131;&#22312;&#20195;&#30721;&#19978;&#34920;&#36798;&#25105;&#23545;&#20110;&#25968;&#25454;&#30340;&#32422;&#26463;&#65292; + &#32780;&#19988;&#25105;&#30456;&#20449;&#65292;&#22914;&#26524;&#21035;&#20154;&#26469;&#35835;&#36825;&#20123;&#20195;&#30721;&#21644;&#30475;&#21040; bimap &#30340;&#23454;&#20363;&#65292;&#20182;&#30340;&#29702;&#35299;&#24212;&#35813;&#19981;&#20250;&#26377;&#38382;&#39064;&#12290; + &#22914;&#26524;&#25105;&#20204;&#20351;&#29992;&#20320;&#30340;&#35760;&#21495;&#65306;ordered_nonunique, unordered_unique, + &#20063;&#35768;&#26356;&#26131;&#20110;&#29702;&#35299;&#65292;&#20294;&#26159;&#23427;&#36829;&#32972;&#20102;&#25105;&#20204;&#30340; STL &#22806;&#35266;&#12290; &#22312;&#25105;&#35748;&#20026;&#65292;&#26469;&#33258;&#20110; + STL &#30340;&#29992;&#25143;&#24517;&#39035;&#23613;&#21487;&#33021;&#23569;&#22320;&#38656;&#35201;&#23398;&#20064;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我非常喜欢它,开始它可能有点古怪,但现在 我已经习惯了,它很容易在代码上表达我对于数据的约束,而且我相信,如果别人来读 这些代码和看到 bimap 的实例,他的理解应该不会有问题。如果我们使用你的记 号:ordered_nonunique, - unordered_unique, 也许更易于理解,但是它违背了我们的 STL 外观。 在我认为,来自于 STL 的用户必须尽可能少地需要学习。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -479,11 +519,14 @@
 <p>
<span class="emphasis"><em> Considering a relation like a <code class="computeroutput"><span class="keyword">struct</span> <span class="special">{</span><span class="identifier">left</span><span class="special">,</span> <span class="identifier">right</span><span class="special">}</span></code> is clean and clear. If I understand - it well, one relation has views of type <code class="computeroutput"><span class="identifier">pair</span><span class="special">{</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">second</span><span class="special">}</span></code>, is this correct? </em></span> + it well, one relation has views of type <code class="computeroutput"><span class="identifier">pair</span><span class="special">{</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">second</span><span class="special">}</span></code>, is this correct? <br> &#24819;&#35937;&#19968;&#19979;&#65292;&#19968;&#20010;&#35937; + <code class="computeroutput"><span class="keyword">struct</span> <span class="special">{</span><span class="identifier">left</span><span class="special">,</span> <span class="identifier">right</span><span class="special">}</span></code> + &#36825;&#26679;&#30340;&#20851;&#31995;&#26159;&#24178;&#20928;&#21644;&#28165;&#26224;&#30340;&#12290; &#22914;&#26524;&#25105;&#30340;&#29702;&#35299;&#26159;&#23427;&#19981;&#38169;&#65292;&#37027;&#20040;&#19968;&#20010;&#20851;&#31995;&#20855;&#26377;&#31867;&#22411; + <code class="computeroutput"><span class="identifier">pair</span><span class="special">{</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">second</span><span class="special">}</span></code> + &#30340;&#35270;&#22270;&#65292;&#26159;&#21542;&#27491;&#30830;&#65311; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>想象一下,一个象 <code class="computeroutput"><span class="keyword">struct</span> - <span class="special">{</span><span class="identifier">left</span><span class="special">,</span> <span class="identifier">right</span><span class="special">}</span></code> 这样的 关系是干净和清晰的。如果我的理解是它不错,那么一个关系具有类型 <code class="computeroutput"><span class="identifier">pair</span><span class="special">{</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">second</span><span class="special">}</span></code> 的视图,是否正确?</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -493,10 +536,12 @@
           </p>
 <p>
<span class="emphasis"><em> Yes, I believe that the left/right notation to express symmetry - is great. I believe that to people is going to love it. </em></span> + is great. I believe that to people is going to love it.<br> &#26159;&#30340;&#65292;&#25105;&#30456;&#20449; + left/right &#35760;&#21495;&#25152;&#34920;&#36798;&#30340;&#23545;&#31216;&#24615;&#26159;&#20255;&#22823;&#30340;&#12290;&#25105;&#30456;&#20449;&#20154;&#20204;&#20250;&#29233;&#19978;&#23427;&#30340;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>是的,我相信 left/right 记号所表达的对称 性是伟大的。我相信人们会爱上它的。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -505,47 +550,51 @@
 <p>
           </p>
 <p>
- <span class="emphasis"><em> OK, perfect. I likes this very much: </em></span> + <span class="emphasis"><em> OK, perfect. I likes this very much:<br> &#22909;&#30340;&#65292;&#28418;&#20142;&#12290;&#25105;&#24456;&#21916;&#27426;&#23427;&#20204;&#65306;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em> 好的,漂亮。我很喜欢它 们:</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
- <span class="emphasis"><em>- bm.left is compatible with std::map&lt;A,B&gt;</em></span> + <span class="emphasis"><em>- bm.left is compatible with std::map&lt;A,B&gt;<br> - bm.left
+            &#20860;&#23481;&#20110; std::map&lt;A,B&gt;</em></span>
           </p>
 <p>
- <span class="emphasis"><em>- bm.left 兼容于 std::map&lt;A,B&gt;</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
- <span class="emphasis"><em>- bm.right is compatible with std::map&lt;B,A&gt;</em></span> + <span class="emphasis"><em>- bm.right is compatible with std::map&lt;B,A&gt;<br> - bm.right
+            &#20860;&#23481;&#20110; std::map&lt;B,A&gt;</em></span>
           </p>
 <p>
- <span class="emphasis"><em>- bm.right 兼容于 std::map&lt;B,A&gt;</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
- <span class="emphasis"><em>- bm is compatible with std::set&lt;relation&lt;A,B&gt;&gt;</em></span> + <span class="emphasis"><em>- bm is compatible with std::set&lt;relation&lt;A,B&gt;&gt;<br> + - bm &#20860;&#23481;&#20110; std::set&lt;relation&lt;A,B&gt;&gt;</em></span>
           </p>
 <p>
- <span class="emphasis"><em>- bm 兼容于 std::set&lt;relation&lt;A,B&gt;&gt;</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
- <span class="emphasis"><em> It is elegant and symmetric. I feel good vibrations here.
-            </em></span>
+ <span class="emphasis"><em> It is elegant and symmetric. I feel good vibrations here.<br> + &#36825;&#26082;&#20248;&#38597;&#21448;&#23545;&#31216;&#12290;&#36825;&#37324;&#25105;&#24863;&#21040;&#20102;&#38663;&#21160;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>这既优雅又对称。这里我感到了振动。 </em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -554,10 +603,10 @@
 <p>
           </p>
 <p>
-            <span class="emphasis"><em> Great! </em></span>
+            <span class="emphasis"><em> Great!<br> &#24378;! </em></span>
           </p>
 <p>
-        <span class="emphasis"><em> 强!</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -570,11 +619,14 @@
easy to grasp, and it fits well in framework. However I do not finish
             to understand very well the "set&lt;relation&gt; constraints"
section. Will you came up with some examples of which is the meaning
-            of the different cases that you enumerate? </em></span>
+ of the different cases that you enumerate?<br> &#32487;&#32493;&#21069;&#36827;&#65292;&#23545; N-1, + N-N, &#21644;&#25955;&#21015;&#32034;&#24341;&#30340;&#25903;&#25345;&#24456;&#23481;&#26131;&#29702;&#35299;&#65292;&#23427;&#20204;&#20063;&#36866;&#21512;&#20110;&#36825;&#20010;&#26694;&#26550;&#12290; + &#19981;&#36807;&#25105;&#36824;&#19981;&#26159;&#24456;&#29702;&#35299; "set&lt;relation&gt; &#30340;&#32422;&#26463;" + &#19968;&#33410;&#12290;&#20320;&#21487;&#20197;&#32473;&#20986;&#19968;&#20123;&#20363;&#23376;&#26469;&#35828;&#26126;&#20320;&#25152;&#21015;&#20030;&#30340;&#19981;&#21516;&#24773;&#24418;&#30340;&#24847;&#20041;&#21527;&#65311;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>继续前进,对 N-1, N-N, 和散列索引的支持 很容易理解,它们也适合于这个框架。不过我还不是很理解 "set&lt;relation&gt; 的 约束" - 一节。你可以给出一些例子来说明你所列举的不同情形的意义 吗?</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias - </strong></span>
@@ -583,28 +635,28 @@
 <p>
           </p>
 <p>
-            <span class="emphasis"><em> Yes, I mean: </em></span>
+ <span class="emphasis"><em> Yes, I mean:<br> &#22909;&#30340;&#65292;&#25105;&#30340;&#24847;&#24605;&#26159;&#65306; </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>好的,我的意思是:</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
-            <span class="emphasis"><em>- based on the left</em></span>
+ <span class="emphasis"><em>- based on the left<br> - &#22522;&#20110;&#24038;&#20391;</em></span>
           </p>
 <p>
-        <span class="emphasis"><em>- 基于左侧</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
-            <span class="emphasis"><em>- based on the right</em></span>
+ <span class="emphasis"><em>- based on the right<br> - &#22522;&#20110;&#21491;&#20391;</em></span>
           </p>
 <p>
-        <span class="emphasis"><em>- 基于右侧</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -614,10 +666,12 @@
If the index of the left is of the type hash, then in fact the main view is going to be an unordered_set&lt; relation&lt;A,B&gt; &gt;. Perhaps this is not what the user prefers and he wants to base its main view
-            on the right index. </em></span>
+ on the right index.<br> bimap &#26680;&#24515;&#24517;&#39035;&#22522;&#20110;&#22810;&#20010;&#32034;&#24341;&#20013;&#30340;&#26576;&#20123;&#32034;&#24341;&#12290;&#22914;&#26524;&#24038;&#20391;&#30340;&#32034;&#24341;&#31867;&#22411;&#26159;&#25955;&#21015;&#30340;&#65292;&#37027;&#20040;&#20107;&#23454;&#19978;&#20027;&#35270;&#22270;&#23601;&#24212;&#35813;&#26159;&#19968;&#20010; + unordered_set&lt; relation&lt;A,B&gt; &gt;&#12290; &#21487;&#33021;&#36825;&#19981;&#26159;&#29992;&#25143;&#24819;&#35201;&#30340;&#65292;&#20182;&#21487;&#33021;&#24819;&#23558;&#20027;&#35270;&#22270;&#22522;&#20110;&#21491;&#20391;&#32034;&#24341;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>bimap 核心必须基于多个索引中的某些索引。 如果左侧的索引类型是散列的,那么事实上主视图就应该是一个 unordered_set&lt; relation&lt;A,B&gt; &gt;。可能这不是用户想要的,他可能想将主视图基于右侧索 引。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -661,10 +715,12 @@
 <p>
<span class="emphasis"><em> However, if both of them are hash indexes, the user may want the main view to be ordered. As we have a B.MI core this is very easy - to support, we just have to add another index to it. </em></span> + to support, we just have to add another index to it.<br> &#19981;&#36807;&#65292;&#22914;&#26524;&#24038;&#21491;&#20004;&#20391;&#37117;&#26159;&#25955;&#21015;&#32034;&#24341;&#65292;&#32780;&#29992;&#25143;&#21487;&#33021;&#24076;&#26395;&#20027;&#35270;&#22270;&#26159;&#26377;&#24207;&#30340;&#12290;&#22240;&#20026;&#25105;&#20204;&#26377;&#19968;&#20010; + B.MI &#26680;&#24515;&#65292;&#25152;&#20197;&#36825;&#24456;&#23481;&#26131;&#25903;&#25345;&#65292;&#25105;&#20204;&#35201;&#20570;&#30340;&#21482;&#26159;&#22686;&#21152;&#19968;&#20010;&#32034;&#24341;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>不过,如果左右两侧都是散列索引,而用户可 能希望主视图是有序的。因为我们有一个 B.MI 核心,所以这很容易支持,我们要做的 只是增加一个索引。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -674,11 +730,12 @@
           </p>
 <p>
<span class="emphasis"><em> I understand it now. OK, I do not know if we have to include - this in the first version, is going to be a functionality avalanche! + this in the first version, is going to be a functionality avalanche!<br> + &#29616;&#22312;&#25105;&#26126;&#30333;&#20102;&#12290;&#22909;&#30340;&#65292;&#25105;&#19981;&#28165;&#26970;&#22914;&#26524;&#25105;&#20204;&#24517;&#39035;&#23558;&#23427;&#21253;&#21547;&#22312;&#31532;&#19968;&#20010;&#29256;&#26412;&#20013;&#65292;&#26159;&#21542;&#21151;&#33021;&#22826;&#22810;&#12290;
             </em></span>
           </p>
 <p>
- <span class="emphasis"><em>现在我明白了。好的,我不清楚如果我们必须 将它包含在第一个版本中,是否功能太多。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -690,10 +747,11 @@
<span class="emphasis"><em> The user is not affected by the addition of this functionality, because by default it will be based on the left index that is a very natural behaviour. I do not think that this is functionality bloat, but - I agree with you that it is a functionality avalanche. </em></span> + I agree with you that it is a functionality avalanche. <br> &#29992;&#25143;&#19981;&#20250;&#24863;&#35273;&#21040;&#22686;&#21152;&#30340;&#21151;&#33021;&#65292;&#22240;&#20026;&#32570;&#30465;&#24773;&#20917;&#26159;&#22522;&#20110;&#24038;&#32034;&#24341;&#30340;&#65292;&#36825;&#26159;&#38750;&#24120;&#33258;&#28982;&#30340;&#34892;&#20026;&#12290;&#25105;&#19981;&#35748;&#20026;&#36825;&#26159;&#21151;&#33021;&#33192;&#32960;&#65292;&#20294;&#26159;&#25105;&#21516;&#24847;&#23427;&#26159;&#19968;&#20010;&#21151;&#33021;&#38634;&#23849;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>用户不会感觉到增加的功能,因为缺省情况是 基于左索引的,这是非常自然的行为。我不认为这是功能膨胀,但是我同意它是一个功 能雪崩。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -708,13 +766,13 @@
To the inverse one, if the main view is of type set_of_relation the left and the right index cannot be of type multi_set. All this subject of the unicity constrictions and the resulting interactions between indexes
-            is one of the subtle subjects of B.MI. </em></span>
+ is one of the subtle subjects of B.MI. <br> &#22312;&#24038;&#12289;&#21491;&#38598;&#21512;&#31867;&#22411;&#21644;&#21487;&#33021;&#30340;&#20027;&#35270;&#22270;&#38598;&#21512;&#31867;&#22411;&#20043;&#38388;&#26159;&#26377;&#32422;&#26463;&#30340;&#12290;&#20363;&#22914;&#65292;&#22914;&#26524;&#26576;&#20010;&#32034;&#24341;&#31867;&#22411;&#26159;&#21807;&#19968;&#30340;&#65292;&#37027;&#20040;&#20027;&#35270;&#22270;&#30340;&#31867;&#22411;&#23601;&#19981;&#33021;&#26159; + multiset_of_relation&#12290; &#30456;&#21453;&#65292;&#22914;&#26524;&#20027;&#35270;&#22270;&#30340;&#31867;&#22411;&#26159; set_of_relation&#65292;&#37027;&#20040;&#24038;&#32034;&#24341;&#21644;&#21491;&#32034;&#24341;&#30340;&#31867;&#22411;&#23601;&#19981;&#33021;&#26159; + multi_set&#12290; &#25152;&#26377;&#36825;&#20123;&#21333;&#19968;&#24615;&#32422;&#26463;&#21644;&#30001;&#27492;&#20135;&#29983;&#30340;&#32034;&#24341;&#38388;&#30340;&#30456;&#20114;&#20316;&#29992;&#65292;&#27491;&#26159; + B.MI &#30340;&#24494;&#22937;&#20043;&#22788;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>在左、右集合类型和可能的主视图集合类型之 间是有约束的。例如,如果 -某个索引类型是唯一的,那么主视图的类型就不能是 multiset_of_relation。相 反,如果主视图的类型是 -set_of_relation,那么左索引和右索引的类型就不能是 multi_set。所有这些单一性 约束和由此产生的索引间的相互作用,正是
-B.MI 的微妙之处。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -724,10 +782,11 @@
           </p>
 <p>
<span class="emphasis"><em> This can be checked at compile time and informed as an error
-            in compile time. </em></span>
+ in compile time. <br> &#36825;&#21487;&#20197;&#22312;&#32534;&#35793;&#26399;&#34987;&#26816;&#39564;&#20986;&#26469;&#65292;&#24182;&#20135;&#29983;&#19968;&#20010;&#32534;&#35793;&#26399;&#38169;&#35823;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>这可以在编译期被检验出来,并产生一个编译 期错误。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -736,13 +795,14 @@
 <p>
           </p>
 <p>
-            <span class="emphasis"><em> It can be interesting. </em></span>
+ <span class="emphasis"><em> It can be interesting.<br> &#36825;&#24456;&#26377;&#36259;&#12290; </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>这很有趣。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
- <code class="literal">- And right when everything seems to be perfect... -</code></p><p><code class="literal"></code><code class="literal">- 接着一切似乎都是完善的... - </code> + <code class="literal">- And right when everything seems to be perfect... - <br> - &#25509;&#30528;&#19968;&#20999;&#20284;&#20046;&#37117;&#26159;&#23436;&#32654;&#30340;...
+        - </code>
       </p>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -761,10 +821,18 @@
subject in it (http://www.kuzbass.ru/docs<span class="emphasis"><em>isocpp</em></span>). As you see, sometimes the standard is cruel. Although mutant seems a lost case, please do not hurry to eliminate it. We will see what can
-            be done for it. </em></span>
+ be done for it.<br> &#20851;&#20110; mutant &#25105;&#26377;&#19968;&#20123;&#22351;&#28040;&#24687;&#65292;&#23427;&#26159;&#19968;&#20010;&#24456;&#22909;&#30340;&#35774;&#35745;&#21644;&#21487;&#31649;&#29702;&#30340;&#31867;&#65292;&#19981;&#24184;&#30340;&#26159;&#65292;C++ + &#24182;&#19981;&#20445;&#35777;&#20219;&#20309;&#24773;&#24418;&#19979;&#30340;&#24067;&#23616;&#20860;&#23481;&#12290; &#20363;&#22914;&#65292;C++ &#26631;&#20934;&#19981;&#20445;&#35777; + <code class="computeroutput"><span class="keyword">struct</span><span class="special">{</span><span class="identifier">T1</span> <span class="identifier">a</span><span class="special">;</span> <span class="identifier">T2</span> <span class="identifier">b</span><span class="special">;}</span></code> + &#21644; <code class="computeroutput"><span class="keyword">struct</span><span class="special">{</span><span class="identifier">T1</span> <span class="identifier">b</span><span class="special">;</span> <span class="identifier">T2</span> <span class="identifier">a</span><span class="special">;}</span></code> + &#26159;&#24067;&#23616;&#20860;&#23481;&#30340;&#65292;&#22240;&#27492; reinterpret_cast &#25216;&#24039;&#26159;&#26410;&#23450;&#20041;&#30340;&#34892;&#20026;&#12290; + &#34429;&#28982;&#25105;&#21516;&#24847;&#20320;&#25152;&#35828;&#30340;&#22312;100%&#30340;&#24773;&#20917;&#19979;&#36825;&#19968;&#26041;&#24335;&#37117;&#26159;&#27491;&#30830;&#30340;&#65292;&#20294;&#26159;&#26631;&#20934;&#23601;&#26159;&#26631;&#20934;&#12290; + &#22914;&#26524;&#20320;&#21487;&#20197;&#30475;&#19968;&#19979;&#36825;&#37324;(http://www.kuzbass.ru/docsisocpp)&#20851;&#20110;&#24067;&#23616;&#20860;&#23481;&#30340;&#25991;&#31456;&#12290;&#20320;&#20250;&#30475;&#21040;&#65292;&#26377;&#26102;&#20505;&#26631;&#20934;&#26159;&#27531;&#37239;&#30340;&#12290; + &#34429;&#28982; mutant &#30475;&#36215;&#26469;&#27809;&#26377;&#26426;&#20250;&#65292;&#20294;&#35831;&#19981;&#35201;&#24613;&#20110;&#28040;&#38500;&#23427;&#12290;&#35753;&#25105;&#20204;&#30475;&#30475;&#26377;&#20160;&#20040;&#21487;&#20197;&#20026;&#23427;&#20570;&#30340;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>关于 mutant 我有一些坏消息,它是一个很好 的设计和可管理的类,不幸的是,C++ 并不保证任何情形下的布局兼容。例如,C++ 标 准不保证 <code class="computeroutput"><span class="keyword">struct</span><span class="special">{</span><span class="identifier">T1</span> <span class="identifier">a</span><span class="special">;</span> <span class="identifier">T2</span> <span class="identifier">b</span><span class="special">;}</span></code> 和 <code class="computeroutput"><span class="keyword">struct</span><span class="special">{</span><span class="identifier">T1</span> <span class="identifier">b</span><span class="special">;</span> <span class="identifier">T2</span> <span class="identifier">a</span><span class="special">;}</span></code> 是布局兼容的,因此 reinterpret_cast 技巧是 未定义的行为。虽然我同意你所说的在100%的情况下这一方式都是正确的,但是标准就 是标准。如果你可以看一下这里(http://www.kuzbass.ru/docs<span class="emphasis"><em>isocpp</em></span>)关于布局兼容的文章。你会看到,有时候 标准是残酷的。虽然 mutant 看起来没有机会,但请不要急于消除它。让我们看看有什 么可以为它做的。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -778,13 +846,15 @@
work perfect in any compiler. Perhaps the standard becomes more strict some day and mutant returns to life... We can then try a wrapper around a relation&lt;A,B&gt; that have two references named first and second
-            that bind to A and B, or B and A. </em></span>
+ that bind to A and B, or B and A.<br> &#25105;&#38405;&#35835;&#20102;&#26631;&#20934;&#65292;&#20320;&#26159;&#23545;&#30340;&#12290;Mutant + &#26159;&#19968;&#20010;&#23454;&#29616;&#32454;&#33410;&#12290;&#22826;&#21487;&#24796;&#20102;&#65292;&#25105;&#30830;&#35748;&#22312;&#20219;&#20309;&#32534;&#35793;&#22120;&#19978;&#23427;&#37117;&#26159;&#21487;&#20197;&#20351;&#29992;&#30340;&#12290; + &#20063;&#35768;&#26576;&#22825;&#26631;&#20934;&#20250;&#21464;&#24471;&#26356;&#20005;&#26684;&#65292;mutant &#20250;&#37325;&#36820;&#25105;&#20204;&#30340;&#29983;&#27963;... + &#25105;&#20204;&#21487;&#20197;&#23581;&#35797;&#22312; relation&lt;A,B&gt; &#30340;&#22806;&#22260;&#21152;&#19968;&#23618;&#21253;&#35013;&#65292; + &#26377;&#20004;&#20010;&#21517;&#20026; first &#21644; second &#30340;&#24341;&#29992;&#65292;&#20998;&#21035;&#32465;&#23450;&#21040; A &#21644; B&#65292;&#25110;
+            B &#21644; A&#12290; </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>我阅读了标准,你是对的。Mutant
-是一个实现细节。太可惜了,我确认在任何编译器上它都是可以使用的。也许某天标 准会变得更严格,mutant 会重返我们的生活... 我们可以尝试在 -relation&lt;A,B&gt; 的外围加一层包装,有两个名为 first 和 second 的引用,分 别绑定到 A 和 B,或 B 和
-A。</em></span></p>
+        </p>
 </blockquote></div>
 <p>

@@ -802,11 +872,13 @@
<span class="emphasis"><em> It is not difficult to code the relation class in this way but two references are initialized with every access and the use of <code class="computeroutput"><span class="identifier">pba</span><span class="special">.</span><span class="identifier">first</span></code> will be slower than <code class="computeroutput"><span class="identifier">r</span><span class="special">.</span><span class="identifier">left</span></code> in most compilers. It is very
-            difficult to optimize this kind of references. </em></span>
+ difficult to optimize this kind of references.<br> &#29992;&#36825;&#31181;&#26041;&#27861;&#19981;&#38590;&#20889;&#20986; + relation &#31867;&#30340;&#20195;&#30721;&#65292;&#20294;&#26159;&#27599;&#27425;&#35775;&#38382;&#37117;&#35201;&#21021;&#22987;&#21270;&#36825;&#20004;&#20010;&#24341;&#29992;&#65292;&#32780;&#19988;&#22312;&#22810;&#25968;&#32534;&#35793;&#22120;&#20013;&#65292; + &#20351;&#29992; <code class="computeroutput"><span class="identifier">pba</span><span class="special">.</span><span class="identifier">first</span></code> &#20250;&#27604; <code class="computeroutput"><span class="identifier">r</span><span class="special">.</span><span class="identifier">left</span></code> + &#24930;&#12290;&#36825;&#31181;&#24341;&#29992;&#24456;&#38590;&#20248;&#21270;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>用这种方法不难写出 relation 类的代码,但 是每次访问都要初始化这两个引用,而且在多数编译器中,使用 - <code class="computeroutput"><span class="identifier">pba</span><span class="special">.</span><span class="identifier">first</span></code> 会比 <code class="computeroutput"><span class="identifier">r</span><span class="special">.</span><span class="identifier">left</span></code> 慢。这种 引用很难优化。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -820,11 +892,13 @@
are of bidirectional type, then standard stated that it have to return an object of type const value_type&amp; when dereferenced. You will have to return a const_reference_pair created in the flight, making it impossible
-            to return a reference. </em></span>
+ to return a reference.<br> &#36825;&#31181;&#21464;&#36890;&#26041;&#27861;&#19981;&#21487;&#34892;&#65292;&#22240;&#20026;&#36845;&#20195;&#22120;&#30340;&#26399;&#26395;&#34892;&#20026;&#20250;&#26377;&#25216;&#26415;&#38382;&#39064;&#12290;&#22914;&#26524; + bm.left &#30340;&#36845;&#20195;&#22120;&#26159;&#21452;&#21521;&#30340;&#65292; &#37027;&#20040;&#26631;&#20934;&#22768;&#26126;&#23427;&#22312;&#25552;&#39046;&#26102;&#24517;&#39035;&#36820;&#22238;&#19968;&#20010;&#31867;&#22411;&#20026; + const value_type&amp; &#30340;&#23545;&#35937;&#12290; &#20320;&#23558;&#19981;&#24471;&#19981;&#36820;&#22238;&#19968;&#20010;&#23601;&#22320;&#21019;&#24314;&#30340; + const_reference_pair&#65292;&#36820;&#22238;&#24341;&#29992;&#26159;&#19981;&#21487;&#33021;&#30340;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>这种变通方法不可行,因为迭代器的期望行为 会有技术问题。如果 bm.left - 的迭代器是双向的,那么标准声明它在提领时必须返回一个类型为 const value_type&amp; 的对象。你将不得不返回一个就地创建的 const_reference_pair,返回引用是不可能的。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -838,11 +912,12 @@
relation that responds as we want, the rest of the code will flow from this point. This clear separation between the relation class and the rest of the library, is going to help to us to separate the problems
-            and to attack them better. </em></span>
+ and to attack them better.<br> &#25105;&#26126;&#30333;... &#25105;&#24050;&#32463;&#24819;&#36807;&#20854;&#23427;&#21464;&#36890;&#26041;&#27861;&#65292;&#20294;&#26159;&#26631;&#20934;&#20877;&#27425;&#19982;&#25105;&#20026;&#38590;&#65281;&#25105;&#20204;&#24517;&#39035;&#35774;&#27861;&#21019;&#24314;&#25105;&#20204;&#24819;&#35201;&#30340; + relation &#31867;&#65292;&#21097;&#20313;&#30340;&#20195;&#30721;&#23558;&#30001;&#27492;&#20135;&#29983;&#12290; relation &#31867;&#19982;&#24211;&#30340;&#20854;&#20313;&#37096;&#20998;&#38388;&#30340;&#26126;&#30830;&#21010;&#20998;&#65292;&#26377;&#21161;&#20110;&#25105;&#20204;&#23558;&#38382;&#39064;&#21306;&#20998;&#24320;&#26469;&#65292;&#26356;&#22909;&#22320;&#35299;&#20915;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>我明白... 我已经想过其它变通方法,但是标 准再次与我为难!我们必须设法创建我们想要的 - relation 类,剩余的代码将由此产生。relation 类与库的其余部分间 的明确划分,有助于我们将问题区分开来,更好地解决。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -853,10 +928,11 @@
 <p>
<span class="emphasis"><em> What workaround? It already pricks my curiosity,I have dedicated a long time to the subject and I do not find any solution except that
-            we allow the relation class to occupy more memory. </em></span>
+ we allow the relation class to occupy more memory.<br> &#26377;&#20160;&#20040;&#26367;&#20195;&#26041;&#27861;&#65311;&#23427;&#24050;&#32463;&#24341;&#36215;&#25105;&#30340;&#22909;&#22855;&#24515;&#20102;&#65292;&#25105;&#20026;&#27492;&#24050;&#32463;&#19987;&#38376;&#33457;&#20102;&#24456;&#38271;&#26102;&#38388;&#65292;&#36824;&#27809;&#25214;&#21040;&#20219;&#20309;&#35299;&#20915;&#26041;&#27861;&#65292;&#38500;&#38750;&#25105;&#20204;&#20801;&#35768; + relation &#31867;&#21344;&#29992;&#26356;&#22810;&#20869;&#23384;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em>有什么替代方法?它已经引起我的好奇心 了,我为此已经专门花了很长时间,还没找到任何解决方法,除非我们允许 relation 类占用更多内存。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -868,20 +944,21 @@
<span class="emphasis"><em> We must achieve that the relation&lt;A,B&gt; size equals the pair&lt;A,B&gt; size if we want this library to be really useful. I was going to write my workaround and I realized that It does not work. Look - at this: http://www.boost.org/libs/iterator/doc/new-iter-concepts.html + at this: http://www.boost.org/libs/iterator/doc<span class="emphasis"><em>new-iter-concepts.html Basically the problem that we are dealing is solved if we based our iterators on this proposal. The present standard forces that the bidirectional iterators also are of the type input and output. Using the new concepts there is no inconvenient in making our iterators "Readable Writable Swappable Bidirectional Traversal". Therefore the const_reference_pair
-            returns to be valid. </em></span>
+ returns to be valid.\n &#22914;&#26524;&#25105;&#20204;&#24819;&#36825;&#20010;&#24211;&#30495;&#30340;&#21487;&#29992;&#65292;&#23601;&#24517;&#39035;&#23454;&#29616; + relation&lt;A,B&gt; &#30340;&#22823;&#23567;&#21644; pair&lt;A,B&gt; &#19968;&#26679;&#12290;&#25105;&#22312;&#20934;&#22791;&#20889;&#19968;&#20010;&#21464;&#36890;&#26041;&#27861;&#26102;&#24847;&#35782;&#21040;&#23427;&#20063;&#26080;&#27861;&#24037;&#20316;&#12290; + &#35831;&#30475;&#36825;&#37324;&#65306; http:</em></span>/www.boost.org/libs/iterator/doc/new-iter-concepts.html + &#22522;&#26412;&#19978;&#25105;&#20204;&#35201;&#22788;&#29702;&#30340;&#36825;&#20010;&#38382;&#39064;&#24050;&#32463;&#35299;&#20915;&#20102;&#65292; &#22914;&#26524;&#25105;&#20204;&#25353;&#36825;&#20010;&#24314;&#35758;&#26469;&#35774;&#35745;&#36845;&#20195;&#22120;&#12290;&#24403;&#21069;&#30340;&#26631;&#20934;&#24378;&#21046;&#35201;&#27714;&#21452;&#21521;&#36845;&#20195;&#22120;&#20063;&#26159;&#36755;&#20837;&#21644;&#36755;&#20986;&#30340;&#12290; + &#20351;&#29992;&#36825;&#20010;&#26032;&#30340;&#27010;&#24565;&#23601;&#21487;&#20197;&#23558;&#25105;&#20204;&#30340;&#36845;&#20195;&#22120;&#26500;&#24314;&#20026;"&#21487;&#35835;&#21487;&#20889;&#21487;&#20132;&#25442;&#21487;&#21452;&#21521;&#36941;&#21382;&#30340;"&#12290;&#22240;&#27492; + const_reference_pair &#30340;&#36820;&#22238;&#26159;&#26377;&#25928;&#30340;&#12290; </em></span>
           </p>
 <p>
-        <span class="emphasis"><em>如果我们想这个库真的可用,就必须实现
-relation&lt;A,B&gt; 的大小和 pair&lt;A,B&gt; 一样。我在准备写一个变通方法时 意识到它也无法工作。请看这里:
-http://www.boost.org/libs/iterator/doc/new-iter-concepts.html
-基本上我们要处理的这个问题已经解决了,如果我们按这个建议来设计迭代器。当前 的标准强制要求双向迭代器也是输入和输出的。使用这个新的概念就可以将我们 -的迭代器构建为"可读可写可交换可双向遍历的"。因此 const_reference_pair 的返 回是有效的。</em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -892,10 +969,12 @@
 <p>
<span class="emphasis"><em> It is correct in the sense that you simply say that your iterators are less powerful than those of the std::map. It is not that it is wrong, - simply that instead of fixing the problem, you confess it. </em></span> + simply that instead of fixing the problem, you confess it. <br> &#24863;&#35273;&#19978;&#26159;&#27491;&#30830;&#30340;&#65292;&#20320;&#21482;&#26159;&#35828;&#20320;&#30340;&#36845;&#20195;&#22120;&#27604; + std::map &#30340;&#31245;&#24369;&#19968;&#28857;&#12290;&#36825;&#24182;&#19981;&#31561;&#20110;&#26159;&#38169;&#30340;&#65292;&#21482;&#26159;&#35299;&#20915;&#38382;&#39064;&#30340;&#26367;&#20195;&#26041;&#27861;&#65292;&#20320;&#25215;&#35748;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>感觉上是正确的,你只是说你的迭代器比 std::map 的稍弱一点。这并不等于是错的,只是解决问题的替代方法,你承认。 </em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Matias</strong></span>
@@ -906,10 +985,11 @@
 <p>
<span class="emphasis"><em> OK, but in our particular case; What are the benefits of offering a LValue iterator against a Read Write iterator? It does not seem to
-            me that it is less powerful in this case. </em></span>
+ me that it is less powerful in this case. <br> OK, &#20294;&#21482;&#26159;&#22312;&#25105;&#20204;&#30340;&#29305;&#23450;&#24773;&#20917;&#19979;&#65307;&#25552;&#20379;&#19968;&#20010;&#24038;&#20540;&#36845;&#20195;&#22120;&#32780;&#19981;&#26159;&#35835;&#20889;&#36845;&#20195;&#22120;&#26377;&#20160;&#20040;&#22909;&#22788;&#65311;&#22312;&#25105;&#30475;&#26469;&#65292;&#36825;&#31181;&#24773;&#24418;&#19979;&#24182;&#27809;&#20160;&#20040;&#29992;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em> OK, 但只是在我们的特定情况下;提供一个 左值迭代器而不是读写迭代器有什么好处?在我看来,这种情形下并没什么用。 </em></span></p>
+        </p>
 </blockquote></div>
 <p>
         <span class="bold"><strong>Joaquin</strong></span>
@@ -925,40 +1005,48 @@
real life? I do not know. How frequently you store the direction of the elements of a map? Perhaps it is not very frequent, since the logical thing is to store the iterators instead of the directions of the elements.
-            Let us review our options: </em></span>
+ Let us review our options:<br> &#35835;&#20889;&#36845;&#20195;&#22120;&#30340;&#20027;&#35201;&#38382;&#39064;&#26159;&#36825;&#26679;&#30340;&#65306;<code class="computeroutput"><span class="identifier">value_type</span> <span class="special">*</span> + <span class="identifier">p</span><span class="special">=&amp;(*</span><span class="identifier">it</span><span class="special">);</span></code> + &#22833;&#36133;&#25110;&#22312; p &#20013;&#20445;&#23384;&#19968;&#20010;&#30701;&#26242;&#30340;&#26041;&#21521;&#12290;&#22312;&#29616;&#23454;&#29983;&#27963;&#20013;&#36825;&#26159;&#21542;&#37325;&#35201;&#65311; + &#25105;&#19981;&#30693;&#36947;&#12290;&#20320;&#20250;&#32463;&#24120;&#20445;&#23384;&#19968;&#20010;&#26144;&#23556;&#30340;&#20803;&#32032;&#26041;&#21521;&#21527;&#65311;&#20063;&#35768;&#19981;&#20250;&#65292;&#22240;&#20026;&#21512;&#20046;&#36923;&#36753;&#30340;&#26159;&#20445;&#23384;&#36845;&#20195;&#22120;&#32780;&#19981;&#26159;&#20803;&#32032;&#30340;&#26041;&#21521;&#12290;&#25105;&#20204;&#26469;&#23457;&#26597;&#19968;&#19979;&#25105;&#20204;&#30340;&#36873;&#25321;&#65306;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em>读写迭代器的主要问题是这样的:<code class="computeroutput"><span class="identifier">value_type</span> <span class="special">*</span> - <span class="identifier">p</span><span class="special">=&amp;(*</span><span class="identifier">it</span><span class="special">);</span></code> - 失败或在 p 中保存一个短暂的方向。在现实生活中这是否重要?我不知 道。你会经常保存一个映射的元素方向吗?也许不会,因为合乎逻辑的是保存迭代器而 不是元素的方向。我们来审查一下我们的选择:</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
-
-
+<p>
+          </p>
 <p>
<span class="emphasis"><em> 1. We used mutant knowing that is not standard, but of course
-            it is supported in the 100% of the cases.</em></span></p>
+ it is supported in the 100% of the cases.<br> 1. &#25105;&#20204;&#20351;&#29992;&#20102; mutant + &#20294;&#30693;&#36947;&#23427;&#19981;&#26631;&#20934;&#65292;&#24403;&#28982;&#22312;100%&#24773;&#20917;&#19979;&#23427;&#26159;&#34987;&#25903;&#25345;&#30340;&#12290;
+            </em></span>
+          </p>
 <p>
- <span class="emphasis"><em> 1. 我们使用了 mutant 但知道它不标 准,当然在100%情况下它是被支持的。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
-
+<p>
+          </p>
 <p>
<span class="emphasis"><em> 2. We used const_reference_pair and we declared the iterators
-            not LValue. </em></span>
+ not LValue.<br> 2. &#25105;&#20204;&#20351;&#29992; const_reference_pair &#19988;&#23558;&#36845;&#20195;&#22120;&#22768;&#26126;&#20026;&#38750;&#24038;&#20540;&#12290;
+            </em></span>
           </p>
 <p>
- <span class="emphasis"><em> 2. 我们使用 const_reference_pair 且将迭 代器声明为非左值。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
           </p>
 <p>
<span class="emphasis"><em> 3. We found some trick that still we do not know. I have thus - been playing with unions and things, without much luck. </em></span> + been playing with unions and things, without much luck.<br> 3. &#25105;&#20204;&#23547;&#25214;&#19968;&#20123;&#36824;&#19981;&#30693;&#36947;&#30340;&#25216;&#24039;&#12290;&#25105;&#24050;&#32463;&#35797;&#36807; + union &#20160;&#20040;&#30340;&#65292;&#20294;&#19981;&#22815;&#36816;&#27668;&#12290; </em></span>
           </p>
 <p>
- <span class="emphasis"><em> 3. 我们寻找一些还不知道的技巧。我已经试 过 union 什么的,但不够运气。</em></span></p>
+        </p>
 </blockquote></div>
 <div class="blockquote"><blockquote class="blockquote">
 <p>
@@ -966,60 +1054,67 @@
 <p>
<span class="emphasis"><em> 4. We leverage the restriction that views have to support the first, second notation. If we made this decision, there are several
***The diff for this file has been truncated for email.***
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/rationale.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/rationale.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html Mon Mar 8 01:27:36 2010
@@ -1,46 +1,48 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>unconstrained_set_of Reference</title><link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>unconstrained_set_of Reference unconstrained_set_of&#21442;&#32771;</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="vector_of_reference.html" title="vector_of Reference"> -<link rel="next" href="../compiler_specifics.html" title="Compiler specifics"></head> -<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../reference.html" title="Reference &#21442;&#32771;">
+<link rel="prev" href="vector_of_reference.html" title="vector_of Reference vector_of&#21442;&#32771;"> +<link rel="next" href="../compiler_specifics.html" title="Compiler specifics &#32534;&#35793;&#22120;&#30456;&#20851;&#35828;&#26126;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libraries.htm">Libraries</a></td> -<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="vector_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../compiler_specifics.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.reference.unconstrained_set_of_reference"></a><a class="link" href="unconstrained_set_of_reference.html" title="unconstrained_set_of Reference">unconstrained_set_of
-      Reference &nbsp;unconstrained_set_of 参考</a>
+<a name="boost_bimap.reference.unconstrained_set_of_reference"></a><a class="link" href="unconstrained_set_of_reference.html" title="unconstrained_set_of Reference unconstrained_set_of&#21442;&#32771;"> + unconstrained_set_of Reference unconstrained_set_of&#21442;&#32771;</a>
 </h3></div></div></div>
 <div class="toc"><dl>
<dt><span class="section"><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis">Header - "boost/bimap/unconstrained_set_of.hpp" synopsis 头文 件"boost/bimap/unconstrained_set_of.hpp"摘要</a></span></dt>
+        "boost/bimap/unconstrained_set_of.hpp" synopsis</a></span></dt>
<dt><span class="section"><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views">unconstrained_set_of
-        Views &nbsp;unconstrained_set_of 视图</a></span></dt>
+        Views</a></span></dt>
 <dd><dl>
-<dt><span class="section"><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature">Complexity
-          signature 复杂度签名</a></span></dt>
-<dt><span class="section"><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization">Serialization 序列化</a></span></dt> +<dt><span class="section"><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature"> + Complexity signature &#22797;&#26434;&#24230;&#31614;&#21517;</a></span></dt> +<dt><span class="section"><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization">
+          Serialization &#24207;&#21015;&#21270;</a></span></dt>
 </dl></dd>
 </dl></div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis" title="Header &quot;boost/bimap/unconstrained_set_of.hpp&quot; synopsis">Header - "boost/bimap/unconstrained_set_of.hpp" synopsis&nbsp;</a></h4><h4 class="title">头文件<a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis" title="Header &quot;boost/bimap/unconstrained_set_of.hpp&quot; synopsis">"boost/bimap/unconstrained_set_of.hpp"摘要</a> +<a name="boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis" title='Header "boost/bimap/unconstrained_set_of.hpp" synopsis'>Header
+        "boost/bimap/unconstrained_set_of.hpp" synopsis</a>
 </h4></div></div></div>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">bimaps</span> <span class="special">{</span>
@@ -52,22 +54,27 @@
<span class="keyword">struct</span> <span class="identifier">unconstrained_set_of_relation</span><span class="special">;</span>


-<span class="special">}</span> <span class="comment">// namespace bimap<br></span><span class="special">}</span> <span class="comment">// namespace boost<br></span></pre>
+<span class="special">}</span> <span class="comment">// namespace bimap
+</span><span class="special">}</span> <span class="comment">// namespace boost
+</span></pre>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views" title="unconstrained_set_of Views">unconstrained_set_of
-        Views &nbsp;unconstrained_set_of 视图</a>
+        Views</a>
 </h4></div></div></div>
 <div class="toc"><dl>
-<dt><span class="section"><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature">Complexity
-          signature 复杂度签名</a></span></dt>
-<dt><span class="section"><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization">Serialization 序列化</a></span></dt> +<dt><span class="section"><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature"> + Complexity signature &#22797;&#26434;&#24230;&#31614;&#21517;</a></span></dt> +<dt><span class="section"><a href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization">
+          Serialization &#24207;&#21015;&#21270;</a></span></dt>
 </dl></div>
 <p>
An unconstrained_set_of set view is a view with no constraints. The use of these kind of view boost the bimap performance but the view can not - be accessed. An unconstrained view is an empty class.</p><p>unconstrained_set_of 视图是一个没有约束的视图。使用这种视图可以 提升 bimap 的性能,但是该视图不能被访问。一个无约束的视图就是一个空类。 + be accessed. An unconstrained view is an empty class.<br> unconstrained_set_of + &#35270;&#22270;&#26159;&#19968;&#20010;&#27809;&#26377;&#32422;&#26463;&#30340;&#35270;&#22270;&#12290;&#20351;&#29992;&#36825;&#31181;&#35270;&#22270;&#21487;&#20197;&#25552;&#21319; bimap + &#30340;&#24615;&#33021;&#65292;&#20294;&#26159;&#35813;&#35270;&#22270;&#19981;&#33021;&#34987;&#35775;&#38382;&#12290; &#19968;&#20010;&#26080;&#32422;&#26463;&#30340;&#35270;&#22270;&#23601;&#26159;&#19968;&#20010;&#31354;&#31867;&#12290;
         </p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">bimaps</span> <span class="special">{</span>
@@ -76,21 +83,24 @@
<span class="keyword">template</span><span class="special">&lt;</span> <span class="emphasis"><em>-implementation defined parameter list-</em></span> <span class="special">&gt;</span> <span class="keyword">class</span> <span class="emphasis"><em>-implementation defined view name-</em></span>
 <span class="special">{</span>
- <span class="comment">// Empty view 空视图<br></span><span class="special">};</span>
-
-<span class="special">}</span> <span class="comment">// namespace views<br></span><span class="special">}</span> <span class="comment">// namespace bimap<br></span><span class="special">}</span> <span class="comment">// namespace boost<br></span></pre>
+    <span class="comment">// Empty view
+</span><span class="special">};</span>
+
+<span class="special">}</span> <span class="comment">// namespace views
+</span><span class="special">}</span> <span class="comment">// namespace bimap +</span><span class="special">}</span> <span class="comment">// namespace boost
+</span></pre>
 <p>
- In the case of a <code class="computeroutput"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">unconstrained_set_of</span><span class="special">&lt;</span><span class="identifier">Left</span><span class="special">&gt;,</span> <span class="special">...</span> <span class="special">&gt;</span></code></p><p><code class="computeroutput"><span class="special"></span></code> - 对于一个 <code class="computeroutput"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">unconstrained_set_of</span><span class="special">&lt;</span><span class="identifier">Left</span><span class="special">&gt;,</span> <span class="special">...</span> <span class="special">&gt;</span></code> + In the case of a <code class="computeroutput"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">unconstrained_set_of</span><span class="special">&lt;</span><span class="identifier">Left</span><span class="special">&gt;,</span> <span class="special">...</span> <span class="special">&gt;</span></code><br> &#23545;&#20110;&#19968;&#20010; <code class="computeroutput"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">unconstrained_set_of</span><span class="special">&lt;</span><span class="identifier">Left</span><span class="special">&gt;,</span> <span class="special">...</span> <span class="special">&gt;</span></code>
         </p>
 <p>
-          In the set view:</p><p>在集合视图中:
+ In the set view:<br> &#22312;&#38598;&#21512;&#35270;&#22270;&#20013;&#65306;
         </p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">signature</span><span class="special">-</span><span class="identifier">compatible</span> <span class="identifier">with</span> <span class="identifier">relation</span><span class="special">&lt;</span> <span class="identifier">Left</span><span class="special">,</span> <span class="special">...</span> <span class="special">&gt;</span> <span class="identifier">key_type</span><span class="special">;</span> <span class="keyword">typedef</span> <span class="identifier">signature</span><span class="special">-</span><span class="identifier">compatible</span> <span class="identifier">with</span> <span class="identifier">relation</span><span class="special">&lt;</span> <span class="identifier">Left</span><span class="special">,</span> <span class="special">...</span> <span class="special">&gt;</span> <span class="identifier">value_type</span><span class="special">;</span>
 </pre>
 <p>
-          In the left map view:</p><p>在左映射视图中:
+ In the left map view:<br> &#22312;&#24038;&#26144;&#23556;&#35270;&#22270;&#20013;&#65306;
         </p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">Left</span> <span class="identifier">key_type</span><span class="special">;</span> <span class="keyword">typedef</span> <span class="special">...</span> <span class="identifier">data_type</span><span class="special">;</span>
@@ -98,7 +108,7 @@
<span class="keyword">typedef</span> <span class="identifier">signature</span><span class="special">-</span><span class="identifier">compatible</span> <span class="identifier">with</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="identifier">Left</span><span class="special">,</span> <span class="special">...</span> <span class="special">&gt;</span> <span class="identifier">value_type</span><span class="special">;</span>
 </pre>
 <p>
-          In the right map view:</p><p>在右映射视图中:
+ In the right map view:<br> &#22312;&#21491;&#26144;&#23556;&#35270;&#22270;&#20013;&#65306;
         </p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="special">...</span> <span class="identifier">key_type</span><span class="special">;</span> <span class="keyword">typedef</span> <span class="identifier">Left</span> <span class="identifier">data_type</span><span class="special">;</span>
@@ -109,40 +119,49 @@
         </p>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature" title="Complexity signature">Complexity
-          signature 复杂度签名</a>
+<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature" title="Complexity signature &#22797;&#26434;&#24230;&#31614;&#21517;">
+          Complexity signature &#22797;&#26434;&#24230;&#31614;&#21517;</a>
 </h5></div></div></div>
 <p>
We adopt the scheme outlined in the <a class="link" href="bimap_reference.html#complexity_signature_explanation">complexity signature section</a>. An unconstrained view can not be accessed by the user, but the formulas to find the order of an operation for a bimap - hold with the following definitions. The complexity signature of a <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code> view is:</p><p>我们采 用在 <a class="link" href="bimap_reference.html#complexity_signature_explanation">" 复杂度签名"一 节</a> -中给出的方式来描述。一个无约束视图不可以被用户访问,不过以下公式可以看出带 有此定义的 bimap 的各操作的开销。<code class="computeroutput"><span class="identifier">vector</span></code><code class="computeroutput"><span class="identifier">_of</span></code> 视图的复杂度签名为: + hold with the following definitions. The complexity signature of a <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code> view is:<br> + &#25105;&#20204;&#37319;&#29992;&#22312; <a class="link" href="bimap_reference.html#complexity_signature_explanation">&#22797;&#26434;&#24230;&#31614;&#21517;</a> + &#19968;&#33410; &#20013;&#32473;&#20986;&#30340;&#26041;&#24335;&#26469;&#25551;&#36848;&#12290; &#19968;&#20010;&#26080;&#32422;&#26463;&#35270;&#22270;&#19981;&#21487;&#20197;&#34987;&#29992;&#25143;&#35775;&#38382;&#65292;&#19981;&#36807;&#20197;&#19979;&#20844;&#24335;&#21487;&#20197;&#30475;&#20986;&#24102;&#26377;&#27492;&#23450;&#20041;&#30340; + bimap &#30340;&#21508;&#25805;&#20316;&#30340;&#24320;&#38144;&#12290; <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code> + &#35270;&#22270;&#30340;&#22797;&#26434;&#24230;&#31614;&#21517;&#20026;&#65306;
           </p>
 <div class="itemizedlist"><ul type="disc">
 <li>
- copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><br>复 制:<code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span>&nbsp;<span class="identifier"></span></code><code class="computeroutput"><span class="number">0</span></code> + copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><br> + &#22797;&#21046;&#65306;<code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
 </li>
 <li>
- insertion: <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><code class="computeroutput"><span class="number"></span></code><br>插入:<code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span>&nbsp;<span class="identifier"></span></code><code class="computeroutput"><span class="number">0</span></code> + insertion: <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><br> + &#25554;&#20837;&#65306;<code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
 </li>
 <li>
- hinted insertion: <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><code class="computeroutput"><span class="number"></span></code><br>提示插 入:<code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span>&nbsp;<span class="identifier"></span></code><code class="computeroutput"><span class="number">0</span></code> + hinted insertion: <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><br> &#25552;&#31034;&#25554;&#20837;&#65306;<code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
 </li>
 <li>
- deletion: <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><code class="computeroutput"><span class="number"></span></code><br>删除:<code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span>&nbsp;<span class="identifier"></span></code><code class="computeroutput"><span class="number">0</span></code> + deletion: <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><br> + &#21024;&#38500;&#65306;<code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
 </li>
 <li>
- replacement: <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><code class="computeroutput"><span class="number"></span></code><br>替换:<code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span>&nbsp;<span class="identifier"></span></code><code class="computeroutput"><span class="number">0</span></code> + replacement: <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><br> + &#26367;&#25442;&#65306;<code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
 </li>
 <li>
- modifying: <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><code class="computeroutput"><span class="number"></span></code><br>修改:<code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span>&nbsp;<span class="identifier"></span></code><code class="computeroutput"><span class="number">0</span></code> + modifying: <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code><br> + &#20462;&#25913;&#65306;<code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
 </li>
 </ul></div>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h5 class="title">
-<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization" title="Serialization">Serialization 序列化</a> +<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization" title="Serialization &#24207;&#21015;&#21270;">
+          Serialization &#24207;&#21015;&#21270;</a>
 </h5></div></div></div>
 <p>
Views cannot be serialized on their own, but only as part of the <code class="computeroutput"><span class="identifier">bimap</span></code> into which they are embedded.
@@ -150,42 +169,51 @@
to <code class="computeroutput"><span class="identifier">list_of</span></code> views with respect to serialization of their embedding containers, we use the concepts defined in the <code class="computeroutput"><span class="identifier">bimap</span></code> - serialization section.</p><p>视图不能被它们自己序列化,只能作为 它们所嵌的 <code class="computeroutput"><span class="identifier">bimap</span></code> 的一部分。在描述与所嵌容器的 &nbsp;<code class="computeroutput"><span class="identifier">list</span></code><code class="computeroutput"><span class="identifier">_</span></code><code class="computeroutput"><span class="special"></span><span class="identifier">of</span></code> 视图相关的 其它前提条件和保证时,我们使用在 <code class="computeroutput"><span class="identifier">bimap</span></code>
-序列化一节中所定义的概念。</p>
+ serialization section.<br> &#35270;&#22270;&#19981;&#33021;&#34987;&#23427;&#20204;&#33258;&#24049;&#24207;&#21015;&#21270;&#65292;&#21482;&#33021;&#20316;&#20026;&#23427;&#20204;&#25152;&#23884;&#30340; + <code class="computeroutput"><span class="identifier">bimap</span></code> &#30340;&#19968;&#37096;&#20998;&#12290;&#22312;&#25551;&#36848;&#19982;&#25152;&#23884;&#23481;&#22120;&#30340; + <code class="computeroutput"><span class="identifier">list_of</span></code> &#35270;&#22270;&#30456;&#20851;&#30340;&#20854;&#23427;&#21069;&#25552;&#26465;&#20214;&#21644;&#20445;&#35777;&#26102;&#65292; + &#25105;&#20204;&#20351;&#29992;&#22312; <code class="computeroutput"><span class="identifier">bimap</span></code> + &#24207;&#21015;&#21270;&#19968;&#33410;&#20013;&#25152;&#23450;&#20041;&#30340;&#27010;&#24565;&#12290;
+          </p>
 <div class="sidebar">
-
+<p class="title"><b></b></p>
 <p>
<span class="bold"><strong>Operation:</strong></span> saving of a <code class="computeroutput"><span class="identifier">bimap</span></code> b to an output archive (XML archive) - ar.</p><p><span class="bold"><strong>操作:</strong></span>保存 一个 <code class="computeroutput"><span class="identifier">bimap</span></code>&nbsp;b 到一个输出存档(XML
-存档) ar 中。</p>
+ ar.<br> <span class="bold"><strong>&#25805;&#20316;&#65306;</strong></span>&#20445;&#23384;&#19968;&#20010; <code class="computeroutput"><span class="identifier">bimap</span></code> b &#21040;&#19968;&#20010;&#36755;&#20986;&#23384;&#26723;(XML &#23384;&#26723;)
+            ar &#20013;&#12290;
+          </p>
 </div>
 <div class="itemizedlist"><ul type="disc"><li>
<span class="bold"><strong>Requires:</strong></span> No additional requirements - to those imposed by the container.<br><span class="bold"><strong>要求:</strong></span><code class="computeroutput"><span class="identifier"></span></code>除了对容器的要 求以外,没有其它要求。 + to those imposed by the container.<br><span class="bold"><strong>&#35201;&#27714;&#65306;</strong></span>&#38500;&#20102;&#23545;&#23481;&#22120;&#30340;&#35201;&#27714;&#20197;&#22806;&#65292;&#27809;&#26377;&#20854;&#23427;&#35201;&#27714;&#12290;
             </li></ul></div>
 <div class="sidebar">
-
+<p class="title"><b></b></p>
 <p>
<span class="bold"><strong>Operation:</strong></span> loading of a <code class="computeroutput"><span class="identifier">bimap</span></code> b' from an input archive (XML - archive) ar.</p><p><span class="bold"><strong>操 作:</strong></span>从一个输入存档(XML 存档) ar 中导入一个 <code class="computeroutput"><span class="identifier">bimap</span></code>&nbsp;b' 。</p> + archive) ar.<br> <span class="bold"><strong>&#25805;&#20316;&#65306;</strong></span>&#20174;&#19968;&#20010;&#36755;&#20837;&#23384;&#26723;(XML + &#23384;&#26723;) ar &#20013;&#23548;&#20837;&#19968;&#20010; <code class="computeroutput"><span class="identifier">bimap</span></code>
+            b'&#12290;
+          </p>
 </div>
 <div class="itemizedlist"><ul type="disc"><li>
<span class="bold"><strong>Requires:</strong></span> No additional requirements - to those imposed by the container.<br><span class="bold"><strong>要求:</strong></span><code class="computeroutput"><span class="identifier"></span></code>除了对容器的要 求以外,没有其它要求。 + to those imposed by the container.<br><span class="bold"><strong>&#35201;&#27714;&#65306;</strong></span>&#38500;&#20102;&#23545;&#23481;&#22120;&#30340;&#35201;&#27714;&#20197;&#22806;&#65292;&#27809;&#26377;&#20854;&#23427;&#35201;&#27714;&#12290;
             </li></ul></div>
 </div>
 </div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="vector_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../compiler_specifics.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/reference.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/reference.html Mon Mar 8 01:27:36 2010
@@ -1,219 +1,190 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"><title>Reference</title>
-
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Reference &#21442;&#32771;</title>
 <link rel="stylesheet" href="../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="up" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="prev" href="bimap_and_boost/dependencies.html" title="Dependencies"> -<link rel="next" href="reference/bimap_reference.html" title="Bimap Reference">
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="bimap_and_boost/dependencies.html" title="Dependencies &#20381;&#36182;&#24615;"> +<link rel="next" href="reference/bimap_reference.html" title="Bimap Reference Bimap&#21442;&#32771;">
 </head>
-<body style="color: black; background-color: white;" alink="#0000ff" link="#0000ff" vlink="#840084">
-<table cellpadding="2" width="100%">
-<tbody>
-<tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../boost.png" height="86" width="277"></td> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../index.html">Home</a></td>
 <td align="center"><a href="../../../../libraries.htm">Libraries</a></td>
-<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../more/index.htm">More</a></td>
-</tr>
-</tbody>
-</table>
+</tr></table>
 <hr>
-<div class="spirit-nav"><a accesskey="p" href="bimap_and_boost/dependencies.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/bimap_reference.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<div class="spirit-nav">
+<a accesskey="p" href="bimap_and_boost/dependencies.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/bimap_reference.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage">
-<div>
-<div>
-<h2 class="title" style="clear: both;"><a name="boost_bimap.reference"></a><a class="link" href="reference.html" title="Reference">Reference 参考</a>
-</h2>
-</div>
-</div>
-</div>
-<div class="toc">
-<dl>
-<dt><span class="section"><a href="reference.html#boost_bimap.reference.headers">Headers
-头文件</a></span></dt>
-<dt><span class="section"><a href="reference/bimap_reference.html">Bimap Reference
-&nbsp;Bimap 参考</a></span></dt>
-<dd>
-<dl>
-<dt><span class="section"><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.view_concepts">View
-concepts 视图概念</a></span></dt>
-<dt><span class="section"><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature">Complexity
-signature 复杂度签名</a></span></dt>
-<dt><span class="section"><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.set_type_specification">Set
-type specification 集合类型规格</a></span></dt>
-<dt><span class="section"><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.tags">Tags
-标签</a></span></dt>
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_bimap.reference"></a><a class="link" href="reference.html" title="Reference &#21442;&#32771;"> Reference &#21442;&#32771;</a>
+</h2></div></div></div>
+<div class="toc"><dl>
+<dt><span class="section"><a href="reference.html#boost_bimap.reference.headers"> Headers &#22836;&#25991;&#20214;</a></span></dt> +<dt><span class="section"><a href="reference/bimap_reference.html"> Bimap Reference
+      Bimap&#21442;&#32771;</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.view_concepts">
+        View concepts &#35270;&#22270;&#27010;&#24565;</a></span></dt>
+<dt><span class="section"><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature"> + Complexity signature &#22797;&#26434;&#24230;&#31614;&#21517;</a></span></dt> +<dt><span class="section"><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.set_type_specification"> + Set type specification &#38598;&#21512;&#31867;&#22411;&#35268;&#26684;</a></span></dt> +<dt><span class="section"><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.tags"> Tags &#26631;&#31614;</a></span></dt> <dt><span class="section"><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.header__boost_bimap_bimap_hpp__synopsis">Header -"boost/bimap/bimap.hpp" synopsis 头文件&nbsp;</a></span><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.header__boost_bimap_bimap_hpp__synopsis"><span class="section"></span></a><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.header__boost_bimap_bimap_hpp__synopsis">"boost/bimap/bimap.hpp" -</a><span class="section"><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.header__boost_bimap_bimap_hpp__synopsis">
-摘要</a></span></dt>
+        "boost/bimap/bimap.hpp" synopsis</a></span></dt>
<dt><span class="section"><a href="reference/bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap">Class
-template bimap 类模板 bimap</a></span></dt>
-</dl>
-</dd>
-<dt><span class="section"><a href="reference/set_of_reference.html">set_of Reference
-&nbsp;set_of 参考</a></span></dt>
-<dd>
-<dl>
+        template bimap</a></span></dt>
+</dl></dd>
+<dt><span class="section"><a href="reference/set_of_reference.html"> set_of Reference
+      set_of&#21442;&#32771;</a></span></dt>
+<dd><dl>
<dt><span class="section"><a href="reference/set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_set_of_hpp__synopsis">Header -"boost/bimap/set_of.hpp" synopsis <span style="text-decoration: underline;">头文件</span></a></span><a href="reference/set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_set_of_hpp__synopsis">
-"boost/bimap/set_of.hpp" 摘要</a></dt>
+        "boost/bimap/set_of.hpp" synopsis</a></span></dt>
<dt><span class="section"><a href="reference/set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_multiset_of_hpp__synopsis">Header -"boost/bimap/multiset_of.hpp" synopsis&nbsp;</a></span><a href="reference/set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_multiset_of_hpp__synopsis"><span class="section"></span></a><a href="reference/set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_multiset_of_hpp__synopsis">头
-文件 "boost/bimap/multiset_of.hpp" 摘要</a></dt>
-<dt><span class="section"><a href="reference/set_of_reference.html#boost_bimap.reference.set_of_reference.collection_type_specifiers_set_of_and_multiset_of">Collection -type specifiers set_of and multiset_of 组合类型规格 set_of 和 multiset_of</a></span></dt> -<dt><span class="section"><a href="reference/set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views">[multi]set_of
-Views &nbsp;[multi]set_of 视图</a></span></dt>
-</dl>
-</dd>
-<dt><span class="section"><a href="reference/unordered_set_of_reference.html">unordered_set_of
-Reference &nbsp;unordered_set_of 参考</a></span></dt>
-<dd>
-<dl>
+        "boost/bimap/multiset_of.hpp" synopsis</a></span></dt>
+<dt><span class="section"><a href="reference/set_of_reference.html#boost_bimap.reference.set_of_reference.collection_type_specifiers_set_of_and_multiset_of"> + Collection type specifiers set_of and multiset_of &#32452;&#21512;&#31867;&#22411;&#25351;&#31034;&#31526; set_of
+        &#21644; multiset_of</a></span></dt>
+<dt><span class="section"><a href="reference/set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views">
+        [multi]set_of Views [multi]set_of&#35270;&#22270;</a></span></dt>
+</dl></dd>
+<dt><span class="section"><a href="reference/unordered_set_of_reference.html"> unordered_set_of
+      Reference unordered_set_of&#21442;&#32771;</a></span></dt>
+<dd><dl>
<dt><span class="section"><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_set_of_hpp__synopsis">Header -"boost/bimap/unordered_set_of.hpp" synopsis&nbsp;</a></span><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_set_of_hpp__synopsis"><span class="section"></span></a><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_set_of_hpp__synopsis">头
-文件 "boost/bimap/unordered_set_of.hpp" 摘要</a></dt>
-<dt><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_multiset_of_hpp__synopsis"><span class="section"></span></a><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_multiset_of_hpp__synopsis">Header -"boost/bimap/unordered_multiset_of.hpp" synopsis 头文件</a><span class="section"><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_multiset_of_hpp__synopsis">
-"boost/bimap/unordered_multiset_of.hpp" 摘要</a></span></dt>
-<dt><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.collection_type_specifiers_unordered_set_of_and_unordered_multiset_of"><span class="section"></span></a><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.collection_type_specifiers_unordered_set_of_and_unordered_multiset_of">Collection -type specifiers unordered_set_of and unordered_multiset_of 组合类型规格 </a><span class="section"><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.collection_type_specifiers_unordered_set_of_and_unordered_multiset_of">
-unordered_set_of 和 unordered_multiset_of</a></span></dt>
+        "boost/bimap/unordered_set_of.hpp" synopsis</a></span></dt>
+<dt><span class="section"><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_multiset_of_hpp__synopsis">Header
+        "boost/bimap/unordered_multiset_of.hpp" synopsis</a></span></dt>
+<dt><span class="section"><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.collection_type_specifiers_unordered_set_of_and_unordered_multiset_of"> + Collection type specifiers unordered_set_of and unordered_multiset_of &#32452;&#21512;&#31867;&#22411;&#25351;&#31034;&#31526;unordered_set_of&#21644;unordered_multiset_of</a></span></dt> <dt><span class="section"><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views">unordered_[multi]set_of -Views &nbsp;</a></span><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views"><span class="section"></span></a><a href="reference/unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views">unordered_[multi]set_of
-视图</a></dt>
-</dl>
-</dd>
-<dt><span class="section"><a href="reference/list_of_reference.html">list_of Reference -&nbsp;</a></span><a href="reference/list_of_reference.html"><span class="section"></span></a><a href="reference/list_of_reference.html">list_of 参考</a></dt>
-<dd>
-<dl>
-<dt><a href="reference/list_of_reference.html#boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis"><span class="section"></span></a><a href="reference/list_of_reference.html#boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis">Header -"boost/bimap/list_of.hpp" synopsis 头文件</a><span class="section"><a href="reference/list_of_reference.html#boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis">
-"boost/bimap/list_of.hpp" 摘要</a></span></dt>
-<dt><a href="reference/list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views"><span class="section"></span></a><a href="reference/list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views">list_of -Views &nbsp;</a><span class="section"><a href="reference/list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views">list_of
-视图</a></span></dt>
-</dl>
-</dd>
-<dt><a href="reference/vector_of_reference.html"><span class="section"></span></a><a href="reference/vector_of_reference.html">vector_of -Reference &nbsp;</a><span class="section"><a href="reference/vector_of_reference.html">vector_of 参考</a></span></dt>
-<dd>
-<dl>
-<dt><a href="reference/vector_of_reference.html#boost_bimap.reference.vector_of_reference.header__boost_bimap_vector_of_hpp__synopsis"><span class="section"></span></a><a href="reference/vector_of_reference.html#boost_bimap.reference.vector_of_reference.header__boost_bimap_vector_of_hpp__synopsis">Header -"boost/bimap/vector_of.hpp" synopsis 头文件</a><span class="section"><a href="reference/vector_of_reference.html#boost_bimap.reference.vector_of_reference.header__boost_bimap_vector_of_hpp__synopsis">
-"boost/bimap/vector_of.hpp" 摘要</a></span></dt>
-<dt><a href="reference/vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views"><span class="section"></span></a><a href="reference/vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views">vector_of -views &nbsp;</a><span class="section"><a href="reference/vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views">vector_of
-视图</a></span></dt>
-</dl>
-</dd>
-<dt><a href="reference/unconstrained_set_of_reference.html"><span class="section"></span></a><a href="reference/unconstrained_set_of_reference.html">unconstrained_set_of -Reference &nbsp;</a><span class="section"><a href="reference/unconstrained_set_of_reference.html">unconstrained_set_of
-参考</a></span></dt>
-<dd>
-<dl>
-<dt><a href="reference/unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis"><span class="section"></span></a><a href="reference/unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis">Header -"boost/bimap/unconstrained_set_of.hpp" synopsis 头文件</a><span class="section"><a href="reference/unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis">
-"boost/bimap/unconstrained_set_of.hpp" 摘要</a></span></dt>
-<dt><a href="reference/unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views"><span class="section"></span></a><a href="reference/unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views">unconstrained_set_of -Views &nbsp;</a><span class="section"><a href="reference/unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views">unconstrained_set_of
-视图</a></span></dt>
-</dl>
-</dd>
-</dl>
-</div>
+        Views</a></span></dt>
+</dl></dd>
+<dt><span class="section"><a href="reference/list_of_reference.html"> list_of Reference
+      list_of&#21442;&#32771;</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="reference/list_of_reference.html#boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis">Header
+        "boost/bimap/list_of.hpp" synopsis</a></span></dt>
+<dt><span class="section"><a href="reference/list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views">
+        list_of Views list_of&#35270;&#22270;</a></span></dt>
+</dl></dd>
+<dt><span class="section"><a href="reference/vector_of_reference.html"> vector_of
+      Reference vector_of&#21442;&#32771;</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="reference/vector_of_reference.html#boost_bimap.reference.vector_of_reference.header__boost_bimap_vector_of_hpp__synopsis">Header
+        "boost/bimap/vector_of.hpp" synopsis</a></span></dt>
+<dt><span class="section"><a href="reference/vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views">
+        vector_of views vector_of&#35270;&#22270;</a></span></dt>
+</dl></dd>
+<dt><span class="section"><a href="reference/unconstrained_set_of_reference.html"> + unconstrained_set_of Reference unconstrained_set_of&#21442;&#32771;</a></span></dt>
+<dd><dl>
+<dt><span class="section"><a href="reference/unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis">Header
+        "boost/bimap/unconstrained_set_of.hpp" synopsis</a></span></dt>
+<dt><span class="section"><a href="reference/unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views">unconstrained_set_of
+        Views</a></span></dt>
+</dl></dd>
+</dl></div>
 <div class="section" lang="en">
-<div class="titlepage">
-<div>
-<div>
-<h3 class="title"><a name="boost_bimap.reference.headers"></a><a class="link" href="reference.html#boost_bimap.reference.headers" title="Headers">Headers 头文件</a>
-</h3>
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_bimap.reference.headers"></a><a class="link" href="reference.html#boost_bimap.reference.headers" title="Headers &#22836;&#25991;&#20214;"> Headers &#22836;&#25991;&#20214;</a>
+</h3></div></div></div>
+<p>
+ The following are the interface headers of Boost.Bimap:<br> &#20197;&#19979;&#26159; Boost.Bimap
+        &#30340;&#25509;&#21475;&#22836;&#25991;&#20214;&#65306;
+      </p>
+<p>
+ <span class="bold"><strong>Convenience &#26041;&#20415;&#20351;&#29992;</strong></span>
+      </p>
+<div class="itemizedlist"><ul type="disc"><li>
+ "boost/bimap.hpp" <span class="emphasis"><em>(includes "boost/bimap/bimap.hpp"
+          and imports the bimap class to boost namespace)</em></span>
+</li></ul></div>
+<p>
+ <span class="bold"><strong>Container &#23481;&#22120;</strong></span>
+      </p>
+<div class="itemizedlist"><ul type="disc"><li>
+ "boost/bimap/bimap.hpp" <span class="emphasis"><em>(includes "boost/bimap/set_of.hpp"
+          and "boost/bimap/unconstrained_set_of.hpp")</em></span>
+</li></ul></div>
+<p>
+ <span class="bold"><strong>Set Types &#38598;&#21512;&#31867;&#22411;</strong></span>
+      </p>
+<div class="itemizedlist"><ul type="disc">
+<li>
+          "boost/bimap/set_of.hpp"
+        </li>
+<li>
+          "boost/bimap/multiset_of.hpp"
+        </li>
+<li>
+          "boost/bimap/unordered_set_of.hpp"
+        </li>
+<li>
+          "boost/bimap/unordered_multiset_of.hpp"
+        </li>
+<li>
+          "boost/bimap/list_of.hpp"
+        </li>
+<li>
+          "boost/bimap/vector_of.hpp"
+        </li>
+<li>
+          "boost/bimap/unconstrained_set_of.hpp"
+        </li>
+</ul></div>
+<p>
+ <span class="bold"><strong>Boost Integration Boost&#38598;&#25104;</strong></span>
+      </p>
+<div class="itemizedlist"><ul type="disc">
+<li>
+          "boost/bimap/support/lambda.hpp"
+        </li>
+<li>
+          "boost/bimap/property_map/set_support.hpp"
+        </li>
+<li>
+          "boost/bimap/property_map/unordered_set_support.hpp"
+        </li>
+</ul></div>
+<p>
+ A program using Boost.Bimap must therefore include "boost/bimap/bimap.hpp" + and the headers defining the collection types to be used.<br> &#19968;&#20010;&#20351;&#29992; + Boost.Bimap &#30340;&#31243;&#24207;&#24517;&#39035;&#21253;&#21547; "boost/bimap/bimap.hpp" &#20197;&#21450;&#23450;&#20041;&#20102;&#25152;&#29992;&#32452;&#21512;&#31867;&#22411;&#30340;&#22836;&#25991;&#20214;&#12290;
+      </p>
+<p>
+ Additional headers allow the integration of Boost.Bimap with other boost + libraries, like Boost.Lambda and Boost.Property_map.<br> &#20854;&#23427;&#22836;&#25991;&#20214;&#21487;&#20197;&#23558; + Boost.Bimap &#19982;&#20854;&#23427; boost &#24211;&#36827;&#34892;&#38598;&#25104;&#65292;&#22914; Boost.Lambda &#21644; Boost.Property_map&#12290;
+      </p>
+<p>
+ In order to use the serialization capabilities of Boost.Bimap, the appropriate + Boost.Serialization library module must be linked. Other than that, Boost.Bimap + is a header-only library, requiring no additional object modules.<br> &#20026;&#20102;&#20351;&#29992; + Boost.Bimap &#30340;&#24207;&#21015;&#21270;&#21151;&#33021;&#65292;&#24517;&#39035;&#38142;&#25509;&#36866;&#24403;&#30340; Boost.Serialization + &#24211;&#27169;&#22359;&#12290;&#27492;&#22806;&#65292;Boost.Bimap &#26159;&#19968;&#20010;&#21482;&#26377;&#22836;&#25991;&#20214;&#30340;&#24211;&#65292;&#19981;&#38656;&#35201;&#20854;&#23427;&#30446;&#26631;&#27169;&#22359;&#12290;
+      </p>
 </div>
 </div>
-</div>
-<p> The following are the interface headers of Boost.Bimap:</p>
-<p>以下是 Boost.Bimap 的接口头文件: </p>
-<p> <span class="bold"><strong>Convenience
-方便使用</strong></span> </p>
-<div class="itemizedlist">
-<ul type="disc">
-<li> "boost/bimap.hpp" <span class="emphasis"><em>(includes
-"boost/bimap/bimap.hpp" and imports the bimap class to boost
-namespace)&nbsp;</em></span> <br>"boost/bimap.hpp" <span class="emphasis"><em>(包含 "boost/bimap/bimap.hpp" 并将
-bimap 类导入 boost 名字空间)</em></span>
-</li>
-</ul>
-</div>
-<p> <span class="bold"><strong>Container 容器</strong></span>
-</p>
-<div class="itemizedlist">
-<ul type="disc">
-<li> "boost/bimap/bimap.hpp" <span class="emphasis"><em>(includes
-"boost/bimap/set_of.hpp" and "boost/bimap/unconstrained_set_of.hpp")</em></span><br>"boost/bimap/bimap.hpp" <span class="emphasis"><em>(包含 -"boost/bimap/set_of.hpp" 和 "boost/bimap/unconstrained_set_of.hpp")</em></span>
-</li>
-</ul>
-</div>
-<p> <span class="bold"><strong>Set Types 集合类型</strong></span>
-</p>
-<div class="itemizedlist">
-<ul type="disc">
-<li> "boost/bimap/set_of.hpp" </li>
-<li> "boost/bimap/multiset_of.hpp" </li>
-<li> "boost/bimap/unordered_set_of.hpp" </li>
-<li> "boost/bimap/unordered_multiset_of.hpp" </li>
-<li> "boost/bimap/list_of.hpp" </li>
-<li> "boost/bimap/vector_of.hpp" </li>
-<li> "boost/bimap/unconstrained_set_of.hpp" </li>
-</ul>
-</div>
-<p> <span class="bold"><strong>Boost
-Integration &nbsp;Boost集成</strong></span> </p>
-<div class="itemizedlist">
-<ul type="disc">
-<li> "boost/bimap/support/lambda.hpp" </li>
-<li> "boost/bimap/property_map/set_support.hpp" </li>
-<li> "boost/bimap/property_map/unordered_set_support.hpp" </li>
-</ul>
-</div>
-<p> A program using Boost.Bimap must therefore include
-"boost/bimap/bimap.hpp" and the headers defining the collection types
-to be used.</p><p>一个使用 Boost.Bimap 的程序必须包含
-"boost/bimap/bimap.hpp" 以及定义了所用组合类型的头文件。 </p>
-<p> Additional headers allow the integration of Boost.Bimap with
-other boost libraries, like Boost.Lambda and Boost.Property_map.</p><p>其它 头文件可以将 Boost.Bimap 与其它 boost 库进行集成,如 Boost.Lambda 和 Boost.Property_map。 </p>
-<p> In order to use the serialization capabilities of
-Boost.Bimap, the appropriate Boost.Serialization library module must be
-linked. Other than that, Boost.Bimap is a header-only library,
-requiring no additional object modules.</p><p>为了使用
-Boost.Bimap 的序列化功能,必须链接适当的 Boost.Serialization 库模块。此 外,Boost.Bimap 是一个只有头文件的库,不需要其它目标模块。 </p>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%">
-<tbody>
-<tr>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
-<td align="right">
-<div class="copyright-footer">Copyright © 2006 -2007
-Matias Capeletto
-<p> Distributed under the Boost Software License, Version
-1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
-</p>
-</div>
-</td>
-</tr>
-</tbody>
-</table>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
 <hr>
-<div class="spirit-nav"><a accesskey="p" href="bimap_and_boost/dependencies.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/bimap_reference.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<div class="spirit-nav">
+<a accesskey="p" href="bimap_and_boost/dependencies.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/bimap_reference.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/release_notes.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/release_notes.html Mon Mar 8 01:27:36 2010
@@ -1,44 +1,46 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Release notes</title><link rel="stylesheet" href="../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Release notes &#21457;&#24067;&#35828;&#26126;</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="up" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="prev" href="future_work.html" title="Future work">
-<link rel="next" href="rationale.html" title="Rationale"></head>
-<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="future_work.html" title="Future work &#26410;&#26469;&#30340;&#24037;&#20316;">
+<link rel="next" href="rationale.html" title="Rationale &#21407;&#29702;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../index.html">Home</a></td>
 <td align="center"><a href="../../../../libraries.htm">Libraries</a></td>
-<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="future_work.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both;">
-<a name="boost_bimap.release_notes"></a><a class="link" href="release_notes.html" title="Release notes">Release notes 发布说明</a>
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_bimap.release_notes"></a><a class="link" href="release_notes.html" title="Release notes &#21457;&#24067;&#35828;&#26126;"> Release notes &#21457;&#24067;&#35828;&#26126;</a>
 </h2></div></div></div>
 <p>
-      Not yet released.</p><p>尚未发布。
+      Not yet released.<br> &#23578;&#26410;&#21457;&#24067;&#12290;
     </p>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="future_work.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/test_suite.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/test_suite.html Mon Mar 8 01:27:36 2010
@@ -1,47 +1,54 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Test suite</title><link rel="stylesheet" href="../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Test suite &#27979;&#35797;&#22871;&#20214;</title>
+<link rel="stylesheet" href="../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="up" href="../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap"> -<link rel="prev" href="examples/multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex to Bimap Path - Hashed indices">
-<link rel="next" href="future_work.html" title="Future work"></head>
-<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="examples/multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex to Bimap Path - Hashed indices &#20174;MultiIndex&#21040;Bimap&#20043;&#36335; - &#25955;&#21015;&#32034;&#24341;"> +<link rel="next" href="future_work.html" title="Future work &#26410;&#26469;&#30340;&#24037;&#20316;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../index.html">Home</a></td>
 <td align="center"><a href="../../../../libraries.htm">Libraries</a></td>
-<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="examples/multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="future_work.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage"><div><div><h2 class="title" style="clear: both;">
-<a name="boost_bimap.test_suite"></a><a class="link" href="test_suite.html" title="Test suite">Test suite 测试套件</a>
+<div class="titlepage"><div><div><h2 class="title" style="clear: both">
+<a name="boost_bimap.test_suite"></a><a class="link" href="test_suite.html" title="Test suite &#27979;&#35797;&#22871;&#20214;"> Test suite &#27979;&#35797;&#22871;&#20214;</a>
 </h2></div></div></div>
 <p>
The Boost.Bimap test suite exercises the whole spectrum of functionalities provided by the library. Although the tests are not meant to serve as a learning guide, the interested reader may find it useful to inspect the source code - to gain familiarity with some of the least common features offered by Boost.Bimap.</p><p>Boost.Bimap 测试套件对本库所提供的所有功能进行检测。虽 然这些测试并不是要用作学习的教材,不过感兴趣的读者会发现它们很有用,可以通过 查看源代码来熟悉由 Boost.Bimap 所提供的某些不太常用的特性。 + to gain familiarity with some of the least common features offered by Boost.Bimap.<br> + Boost.Bimap &#27979;&#35797;&#22871;&#20214;&#23545;&#26412;&#24211;&#25152;&#25552;&#20379;&#30340;&#25152;&#26377;&#21151;&#33021;&#36827;&#34892;&#26816;&#27979;&#12290;&#34429;&#28982;&#36825;&#20123;&#27979;&#35797;&#24182;&#19981;&#26159;&#35201;&#29992;&#20316;&#23398;&#20064;&#30340;&#25945;&#26448;&#65292; + &#19981;&#36807;&#24863;&#20852;&#36259;&#30340;&#35835;&#32773;&#20250;&#21457;&#29616;&#23427;&#20204;&#24456;&#26377;&#29992;&#65292;&#21487;&#20197;&#36890;&#36807;&#26597;&#30475;&#28304;&#20195;&#30721;&#26469;&#29087;&#24713;&#30001; + Boost.Bimap &#25152;&#25552;&#20379;&#30340;&#26576;&#20123;&#19981;&#22826;&#24120;&#29992;&#30340;&#29305;&#24615;&#12290;
     </p>
 <div class="informaltable"><table class="table">
-<colgroup><col><col></colgroup>
+<colgroup>
+<col>
+<col>
+</colgroup>
 <thead><tr>
 <th>
             <p>
-              Program 程序
+              Program &#31243;&#24207;
             </p>
             </th>
 <th>
             <p>
-              Description 说明
+              Description &#35828;&#26126;
             </p>
             </th>
 </tr></thead>
@@ -54,7 +61,7 @@
             </td>
 <td>
             <p>
-              Tagged idiom checks</p><p>标签惯用法检查
+ Tagged idiom checks <br> &#26631;&#31614;&#24815;&#29992;&#27861;&#26816;&#26597;
             </p>
             </td>
 </tr>
@@ -66,7 +73,7 @@
             </td>
 <td>
             <p>
-              Test the mutant idiom</p><p>测试突变惯用法
+ Test the mutant idiom <br> &#27979;&#35797;&#31361;&#21464;&#24815;&#29992;&#27861;
             </p>
             </td>
 </tr>
@@ -79,7 +86,7 @@
             </td>
 <td>
             <p>
-              Test structured pair class</p><p>测试结构化的 pair 类
+ Test structured pair class <br> &#27979;&#35797;&#32467;&#26500;&#21270;&#30340; pair &#31867;
             </p>
             </td>
 </tr>
@@ -92,7 +99,7 @@
             </td>
 <td>
             <p>
-              Test the relation class</p><p>测试 relation 类
+ Test the relation class <br> &#27979;&#35797; relation &#31867;
             </p>
             </td>
 </tr>
@@ -105,7 +112,7 @@
             </td>
 <td>
             <p>
-              Library interface check</p><p>库接口检查
+ Library interface check <br> &#24211;&#25509;&#21475;&#26816;&#26597;
             </p>
             </td>
 </tr>
@@ -118,7 +125,8 @@
             </td>
 <td>
             <p>
-              Library interface check<br>库接口检查</p>
+ Library interface check <br> &#24211;&#25509;&#21475;&#26816;&#26597;
+            </p>
             </td>
 </tr>
 <tr>
@@ -130,7 +138,7 @@
             </td>
 <td>
             <p>
-              Library interface check</p><p>库接口检查
+ Library interface check <br> &#24211;&#25509;&#21475;&#26816;&#26597;
             </p>
             </td>
 </tr>
@@ -143,7 +151,7 @@
             </td>
 <td>
             <p>
-              Library interface check</p><p>库接口检查
+ Library interface check <br> &#24211;&#25509;&#21475;&#26816;&#26597;
             </p>
             </td>
 </tr>
@@ -156,7 +164,7 @@
             </td>
 <td>
             <p>
-              Library interface check</p><p>库接口检查
+ Library interface check <br> &#24211;&#25509;&#21475;&#26816;&#26597;
             </p>
             </td>
 </tr>
@@ -169,7 +177,7 @@
             </td>
 <td>
             <p>
-              Library interface check</p><p>库接口检查
+ Library interface check <br> &#24211;&#25509;&#21475;&#26816;&#26597;
             </p>
             </td>
 </tr>
@@ -182,7 +190,7 @@
             </td>
 <td>
             <p>
-              Library interface check</p><p>库接口检查
+ Library interface check <br> &#24211;&#25509;&#21475;&#26816;&#26597;
             </p>
             </td>
 </tr>
@@ -195,7 +203,8 @@
             </td>
 <td>
             <p>
- Test set and multiset based bimaps</p><p>测试基于 set 和 multiset 的 bimap + Test set and multiset based bimaps <br> &#27979;&#35797;&#22522;&#20110; set &#21644; multiset
+              &#30340; bimap
             </p>
             </td>
 </tr>
@@ -208,7 +217,8 @@
             </td>
 <td>
             <p>
- Test unordered_set and unordered_multiset based bimaps</p><p>测试基于 unordered_set 和 unordered_multiset 的 bimap + Test unordered_set and unordered_multiset based bimaps <br> &#27979;&#35797;&#22522;&#20110;
+              unordered_set &#21644; unordered_multiset &#30340; bimap
             </p>
             </td>
 </tr>
@@ -221,7 +231,8 @@
             </td>
 <td>
             <p>
- Test list and vector based bimaps</p><p>测试基于 list 和 vector 的 bimap + Test list and vector based bimaps <br> &#27979;&#35797;&#22522;&#20110; list &#21644; vector
+              &#30340; bimap
             </p>
             </td>
 </tr>
@@ -234,7 +245,8 @@
             </td>
 <td>
             <p>
- Test bimaps with unconstrained views</p><p>测试带无约束视图 的 bimap + Test bimaps with unconstrained views <br> &#27979;&#35797;&#24102;&#26080;&#32422;&#26463;&#35270;&#22270;&#30340;
+              bimap
             </p>
             </td>
 </tr>
@@ -247,7 +259,7 @@
             </td>
 <td>
             <p>
-              Serialization support checks</p><p>序列化支持检查
+ Serialization support checks <br> &#24207;&#21015;&#21270;&#25903;&#25345;&#26816;&#26597;
             </p>
             </td>
 </tr>
@@ -260,7 +272,8 @@
             </td>
 <td>
             <p>
- Property map concepts for the set and unordered set views</p><p>set 和无序 set 视图的属性映射概念 + Property map concepts for the set and unordered set views <br> set + &#21644;&#26080;&#24207; set &#35270;&#22270;&#30340;&#23646;&#24615;&#26144;&#23556;&#27010;&#24565;
             </p>
             </td>
 </tr>
@@ -273,7 +286,8 @@
             </td>
 <td>
             <p>
- <code class="computeroutput"><span class="identifier">replace</span></code>, <code class="computeroutput"><span class="identifier">modify</span></code> and <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span><br><span class="identifier">replace</span></code>, <code class="computeroutput"><span class="identifier">modify</span></code> 和 <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code></p> + <code class="computeroutput"><span class="identifier">replace</span></code>, <code class="computeroutput"><span class="identifier">modify</span></code> and <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code>
+            </p>
             </td>
 </tr>
 <tr>
@@ -285,7 +299,7 @@
             </td>
 <td>
             <p>
- Test lambda modified idom support</p><p>测试 lambda 修改惯用 法的支持 + Test lambda modified idom support <br> &#27979;&#35797; lambda &#20462;&#25913;&#24815;&#29992;&#27861;&#30340;&#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -298,7 +312,7 @@
             </td>
 <td>
             <p>
-              Test Boost.Assign support</p><p>测试 Boost.Assign 的支持
+ Test Boost.Assign support <br> &#27979;&#35797; Boost.Assign &#30340;&#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -311,7 +325,7 @@
             </td>
 <td>
             <p>
-              Projection of iterators support</p><p>迭代器投射的支持
+ Projection of iterators support <br> &#36845;&#20195;&#22120;&#25237;&#23556;&#30340;&#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -326,7 +340,7 @@
             <p>
<code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> and <code class="computeroutput"><span class="identifier">at</span><span class="special">()</span></code> - functions</p><p><code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> 和 <code class="computeroutput"><span class="identifier">at</span><span class="special">()</span></code> 函数
+              functions
             </p>
             </td>
 </tr>
@@ -338,7 +352,7 @@
             </td>
 <td>
             <p>
-              Information hooking support</p><p>信息挂载的支持
+ Information hooking support <br> &#20449;&#24687;&#25346;&#36733;&#30340;&#25903;&#25345;
             </p>
             </td>
 </tr>
@@ -351,7 +365,7 @@
             </td>
 <td>
             <p>
-              Additional checks</p><p>其它检查
+              Additional checks <br> &#20854;&#23427;&#26816;&#26597;
             </p>
             </td>
 </tr>
@@ -364,7 +378,7 @@
             </td>
 <td>
             <p>
- Information hooking compilation fail test</p><p>信息挂载编译 失败测试 + Information hooking compilation fail test <br> &#20449;&#24687;&#25346;&#36733;&#32534;&#35793;&#22833;&#36133;&#27979;&#35797;
             </p>
             </td>
 </tr>
@@ -377,7 +391,7 @@
             </td>
 <td>
             <p>
- Information hooking compilation fail test</p><p>信息挂载编译 失败测试 + Information hooking compilation fail test <br> &#20449;&#24687;&#25346;&#36733;&#32534;&#35793;&#22833;&#36133;&#27979;&#35797;
             </p>
             </td>
 </tr>
@@ -390,7 +404,7 @@
             </td>
 <td>
             <p>
- Information hooking compilation fail test</p><p>信息挂载编译 失败测试 + Information hooking compilation fail test <br> &#20449;&#24687;&#25346;&#36733;&#32534;&#35793;&#22833;&#36133;&#27979;&#35797;
             </p>
             </td>
 </tr>
@@ -403,7 +417,7 @@
             </td>
 <td>
             <p>
- Mutable members compilation fail test</p><p>可修改成员编译失 败测试 + Mutable members compilation fail test <br> &#21487;&#20462;&#25913;&#25104;&#21592;&#32534;&#35793;&#22833;&#36133;&#27979;&#35797;
             </p>
             </td>
 </tr>
@@ -416,7 +430,7 @@
             </td>
 <td>
             <p>
- Mutable members compilation fail test</p><p>可修改成员编译失 败测试 + Mutable members compilation fail test <br> &#21487;&#20462;&#25913;&#25104;&#21592;&#32534;&#35793;&#22833;&#36133;&#27979;&#35797;
             </p>
             </td>
 </tr>
@@ -429,23 +443,24 @@
             </td>
 <td>
             <p>
- Mutable members compilation fail test</p><p>可修改成员编译失 败测试 + Mutable members compilation fail test <br> &#21487;&#20462;&#25913;&#25104;&#21592;&#32534;&#35793;&#22833;&#36133;&#27979;&#35797;
             </p>
             </td>
 </tr>
 </tbody>
 </table></div>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="examples/multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="future_work.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html Mon Mar 8 01:27:36 2010
@@ -1,139 +1,258 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"><title>Additional information</title>
-
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Additional information &#26356;&#22810;&#30340;&#20449;&#24687;</title>
 <link rel="stylesheet" href="../../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="up" href="../the_tutorial.html" title="The tutorial">
-<link rel="prev" href="unconstrained_sets.html" title="Unconstrained Sets">
-<link rel="next" href="complete_instantiation_scheme.html" title="Complete instantiation scheme"></head> -<body style="color: black; background-color: white;" alink="#0000ff" link="#0000ff" vlink="#840084">
-<table cellpadding="2" width="100%">
-<tbody>
-<tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../the_tutorial.html" title="The tutorial &#25351;&#21335;"> +<link rel="prev" href="unconstrained_sets.html" title="Unconstrained Sets &#19981;&#21463;&#38480;&#30340;set"> +<link rel="next" href="complete_instantiation_scheme.html" title="Complete instantiation scheme &#23436;&#25972;&#30340;&#23454;&#20363;&#21270;&#26041;&#26696;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libraries.htm">Libraries</a></td> -<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../../more/index.htm">More</a></td>
-</tr>
-</tbody>
-</table>
+</tr></table>
 <hr>
-<div class="spirit-nav"><a accesskey="p" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="complete_instantiation_scheme.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<div class="spirit-nav">
+<a accesskey="p" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="complete_instantiation_scheme.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage">
-<div>
-<div>
-<h3 class="title"><a name="boost_bimap.the_tutorial.additional_information"></a><a class="link" href="additional_information.html" title="Additional information">Additional information 更多的信息</a>
-</h3>
-</div>
-</div>
-</div>
-<p> Bidirectional maps may have associated information about each
-relation. Suppose we want to represent a books and author bidirectional
-map. </p>
-<p> 双向映射可以具有关于每个关系的关联信息。假设我们想表示一个书籍与作者的 双向映射。</p>
-<p> </p>
-<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special">&lt;</span><br><span class="identifier">multiset_of</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">&gt;,</span> <span class="comment">// author 作者<br></span> <span class="identifier">set_of</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">&gt;</span> <span class="comment">// title 题目<br></span><br><span class="special">&gt;</span> <span class="identifier">bm_type</span><span class="special">;</span><br><span class="keyword">typedef</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span> <span class="identifier">book</span><span class="special">;</span><br><span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span><br><span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">book</span><span class="special">(</span> <span class="string">"Bjarne Stroustrup"</span> <span class="special">,</span> <span class="string">"The C++ Programming Language"</span> <span class="special">)</span> <span class="special">);</span><br><span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">book</span><span class="special">(</span> <span class="string">"Scott Meyers"</span> <span class="special">,</span> <span class="string">"Effective C++"</span> <span class="special">)</span> <span class="special">);</span><br><span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">book</span><span class="special">(</span> <span class="string">"Andrei Alexandrescu"</span> <span class="special">,</span> <span class="string">"Modern C++ Design"</span> <span class="special">)</span> <span class="special">);</span><br><span class="comment">// Print the author of Modern C++ 打印 Modern C++ 的作者 <br></span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span> <span class="string">"Modern C++ Design"</span> <span class="special">);</span>
-</pre>
-<p> <br>
-Suppose now that we want to store abstract of each book. We have two
-options:</p>
-<p>假设现在我们想保存每本书的摘要。我们有两个选择: </p>
-<div class="orderedlist">
-<ol type="1">
-<li> Books name are unique identifiers, so we can create a
-separate <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special">&lt;</span> -<span class="identifier">string</span><span class="special">,</span> <span class="identifier">string</span>
-<span class="special">&gt;</span></code>
-that relates books names with abstracts. <br>因为书名为唯一标识,所以我们可 以创建一个单独的 <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special">&lt;</span> <span class="identifier">string</span><span class="special">,</span> <span class="identifier">string</span>
-<span class="special">&gt;</span></code>
-将书名和摘要关系起来。 </li>
-<li> We can use <a href="http://www.boost.org/libs/multi_index/doc/index.html"; target="_top"><span class="bold"><strong>Boost.MultiIndex</strong></span></a> -for the new beast. <br>我们可以为此使用 <a href="http://www.boost.org/libs/multi_index/doc/index.html"; target="_top"><span class="bold"><strong>Boost.MultiIndex</strong></span></a>. </li>
-</ol>
-</div>
-<p> Option 1 is the wrong approach, if we go this path we lost
-what bimap has won us. We now have to maintain the logic of two
-interdependent containers, there is an extra string stored for each
-book name, and the performance will be worse. This is far away from
-being a good solution.&nbsp;</p><p>选择1是错误的方法,如果我们照此去做,将 失去 bimap 带给我们的好处。我们现在必须维护两个独立容器的逻辑,每个书名都保 存有一个额外的字符串,而且性能也会变差。这不是一个好的解决方案。</p>
-<p> Option 2 is correct. We start thinking books as entries in a
-table. So it makes sense to start using Boost.MultiIndex. We can then
-add the year of publication, the price, etc... and we can index this
-new items too. So Boost.MultiIndex is a sound solution for our problem.</p><p>选择2是正确的。我们将书视为一张表中的项。所以显然应该使用 Boost.MultiIndex。我们可以增加出版年份、价格等等...我们还可以对新增项进行索 引。所以对于我们的问题,Boost.MultiIndex 是正确的解决方案。
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_bimap.the_tutorial.additional_information"></a><a class="link" href="additional_information.html" title="Additional information &#26356;&#22810;&#30340;&#20449;&#24687;"> Additional
+      information &#26356;&#22810;&#30340;&#20449;&#24687;</a>
+</h3></div></div></div>
+<p>
+ Bidirectional maps may have associated information about each relation. Suppose + we want to represent a books and author bidirectional map.<br> &#21452;&#21521;&#26144;&#23556;&#21487;&#20197;&#20855;&#26377;&#20851;&#20110;&#27599;&#20010;&#20851;&#31995;&#30340;&#20851;&#32852;&#20449;&#24687;&#12290;&#20551;&#35774;&#25105;&#20204;&#24819;&#34920;&#31034;&#19968;&#20010;&#20070;&#31821;&#19982;&#20316;&#32773;&#30340;&#21452;&#21521;&#26144;&#23556;&#12290;
+      </p>
+<p>
+        </p>
+<p>
+
 </p>
-<p> The thing is that there are cases where we want to maintain
-bimap semantics (use <code class="computeroutput"><span class="identifier">at</span><span class="special">()</span></code>
-to find an author given a book name and the other way around) and add
-information about the relations that we are sure we will not want to
-index later (like the abstracts). Option 1 is not possible, option 2
-neither.</p><p>问题是,在有些情况下,我们希望保持 bimap 的语义时(使用 <code class="computeroutput"><span class="identifier">at</span><span class="special">()</span></code> 查找给定书名的作者或其它方式)并且增加与关系 相关的信息,我们确保这些信息是不需要索引的(如摘要)。选择1 是不可能的,选择 2也不行。 </p>
-<p> Boost.Bimap provides support for this kind of situations by
-means of an embedded information member. You can pass an extra
-parameter to a bimap: <code class="computeroutput"><span class="identifier">with_info</span><span class="special">&lt;</span> <span class="identifier">InfoType</span> <span class="special">&gt;</span></code> and an <code class="computeroutput"><span class="identifier">info</span></code> -member of type <code class="computeroutput"><span class="identifier">InfoType</span></code> will -appear in the relation and bimap pairs.</p><p> Boost.Bimap 通过一个嵌入的信 息成员为这种情形提供了支持。你可以传递给 bimap 一个额外的参数:<code class="computeroutput"><span class="identifier">with_info</span><span class="special">&lt;</span> <span class="identifier">InfoType</span> <span class="special">&gt;</span></code>,一个类型为 <code class="computeroutput"><span class="identifier">InfoType</span></code> 的 <code class="computeroutput"><span class="identifier">info</span></code>
-成员会出现在关系和 bimap 对中。 </p>
-<p> <span class="inlinemediaobject"><img src="../../images/bimap/relation.and.pair.with.info.png" alt="relation.and.pair.with.info"></span> </p>
-<p> Relations and bimap pairs constructors will take an extra
-argument. If only two arguments are used, the information will be
-initialized with their default constructor. </p>
-<p> 关系和 bimap 对的构造函数将接受一个额外的参数。如果只使用两个参数,则该 信息将被它们的缺省构造函数所初始化。</p>
-<p> </p>
-<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special">&lt;</span><br><span class="identifier">multiset_of</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">&gt;,</span> <span class="comment">// author 作者<br></span> <span class="identifier">set_of</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">&gt;,</span> <span class="comment">// title 题目<br></span><br><span class="identifier">with_info</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">&gt;</span> <span class="comment">// abstract 摘要<br></span><br><span class="special">&gt;</span> <span class="identifier">bm_type</span><span class="special">;</span><br><span class="keyword">typedef</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span> <span class="identifier">book</span><span class="special">;</span><br><span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span><br><span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><br><span class="identifier">book</span><span class="special">(</span> <span class="string">"Bjarne Stroustrup"</span> <span class="special">,</span> <span class="string">"The C++ Programming Language"</span><span class="special">,</span><br><span class="string">"For C++ old-timers, the first edition of this book is"</span><br><span class="string">"the one that started it all—the font of our knowledge."</span> <span class="special">)</span><br><span class="special">);</span><br><span class="comment">// Print the author of the bible 打印C++圣经的作者<br></span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="string">"The C++ Programming Language"</span><span class="special">);</span><br><span class="comment">// Print the abstract of this book 打印这本书的摘要<br></span><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="string">"Bjarne Stroustrup"</span><span class="special">);</span><br><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">i</span><span class="special">-&gt;</span><span class="identifier">info</span><span class="special">;</span> +<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special">&lt;</span>
+
+ <span class="identifier">multiset_of</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">&gt;,</span> <span class="comment">// author +</span> <span class="identifier">set_of</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">&gt;</span> <span class="comment">// title
+</span>
+<span class="special">&gt;</span> <span class="identifier">bm_type</span><span class="special">;</span> +<span class="keyword">typedef</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span> <span class="identifier">book</span><span class="special">;</span>
+
+<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
+
+<span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">book</span><span class="special">(</span> <span class="string">"Bjarne Stroustrup"</span> <span class="special">,</span> <span class="string">"The C++ Programming Language"</span> <span class="special">)</span> <span class="special">);</span> +<span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">book</span><span class="special">(</span> <span class="string">"Scott Meyers"</span> <span class="special">,</span> <span class="string">"Effective C++"</span> <span class="special">)</span> <span class="special">);</span> +<span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">book</span><span class="special">(</span> <span class="string">"Andrei Alexandrescu"</span> <span class="special">,</span> <span class="string">"Modern C++ Design"</span> <span class="special">)</span> <span class="special">);</span>
+
+<span class="comment">// Print the author of Modern C++
+</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span> <span class="string">"Modern C++ Design"</span> <span class="special">);</span>
 </pre>
-
-
-<p> <br>Contrary to the two key types, the information will be
-mutable using iterators. </p>
-<p> 与两个键类型不同,该信息可以通过迭代器进行修改。</p>
-<p> </p>
+<p>
+        </p>
+<p>
+      </p>
+<p>
+ Suppose now that we want to store abstract of each book. We have two options:<br> + &#20551;&#35774;&#29616;&#22312;&#25105;&#20204;&#24819;&#20445;&#23384;&#27599;&#26412;&#20070;&#30340;&#25688;&#35201;&#12290;&#25105;&#20204;&#26377;&#20004;&#20010;&#36873;&#25321;&#65306;
+      </p>
+<div class="orderedlist"><ol type="1">
+<li>
+ Books name are unique identifiers, so we can create a separate <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special">&lt;</span> <span class="identifier">string</span><span class="special">,</span> <span class="identifier">string</span> <span class="special">&gt;</span></code> + that relates books names with abstracts.<br> &#22240;&#20026;&#20070;&#21517;&#20026;&#21807;&#19968;&#26631;&#35782;&#65292;&#25152;&#20197;&#25105;&#20204;&#21487;&#20197;&#21019;&#24314;&#19968;&#20010;&#21333;&#29420;&#30340; + <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special">&lt;</span> <span class="identifier">string</span><span class="special">,</span> <span class="identifier">string</span> <span class="special">&gt;</span></code> + &#23558;&#20070;&#21517;&#21644;&#25688;&#35201;&#20851;&#31995;&#36215;&#26469;&#12290;
+        </li>
+<li>
+ We can use <a href="http://www.boost.org/libs/multi_index/doc/index.html"; target="_top"><span class="bold"><strong>Boost.MultiIndex</strong></span></a> for the new beast.<br> + &#25105;&#20204;&#21487;&#20197;&#20026;&#27492;&#20351;&#29992; <a href="http://www.boost.org/libs/multi_index/doc/index.html"; target="_top"><span class="bold"><strong>Boost.MultiIndex</strong></span></a>.
+        </li>
+</ol></div>
+<p>
+ Option 1 is the wrong approach, if we go this path we lost what bimap has + won us. We now have to maintain the logic of two interdependent containers, + there is an extra string stored for each book name, and the performance will + be worse. This is far away from being a good solution.<br> &#36873;&#25321;1&#26159;&#38169;&#35823;&#30340;&#26041;&#27861;&#65292;&#22914;&#26524;&#25105;&#20204;&#29031;&#27492;&#21435;&#20570;&#65292;&#23558;&#22833;&#21435; + bimap &#24102;&#32473;&#25105;&#20204;&#30340;&#22909;&#22788;&#12290;&#25105;&#20204;&#29616;&#22312;&#24517;&#39035;&#32500;&#25252;&#20004;&#20010;&#29420;&#31435;&#23481;&#22120;&#30340;&#36923;&#36753;&#65292; + &#27599;&#20010;&#20070;&#21517;&#37117;&#20445;&#23384;&#26377;&#19968;&#20010;&#39069;&#22806;&#30340;&#23383;&#31526;&#20018;&#65292;&#32780;&#19988;&#24615;&#33021;&#20063;&#20250;&#21464;&#24046;&#12290;&#36825;&#19981;&#26159;&#19968;&#20010;&#22909;&#30340;&#35299;&#20915;&#26041;&#26696;&#12290;
+      </p>
+<p>
+ Option 2 is correct. We start thinking books as entries in a table. So it + makes sense to start using Boost.MultiIndex. We can then add the year of + publication, the price, etc... and we can index this new items too. So Boost.MultiIndex + is a sound solution for our problem.<br> &#36873;&#25321;2&#26159;&#27491;&#30830;&#30340;&#12290;&#25105;&#20204;&#23558;&#20070;&#35270;&#20026;&#19968;&#24352;&#34920;&#20013;&#30340;&#39033;&#12290;&#25152;&#20197;&#26174;&#28982;&#24212;&#35813;&#20351;&#29992; + Boost.MultiIndex&#12290; &#25105;&#20204;&#21487;&#20197;&#22686;&#21152;&#20986;&#29256;&#24180;&#20221;&#12289;&#20215;&#26684;&#31561;&#31561;...&#25105;&#20204;&#36824;&#21487;&#20197;&#23545;&#26032;&#22686;&#39033;&#36827;&#34892;&#32034;&#24341;&#12290;&#25152;&#20197;&#23545;&#20110;&#25105;&#20204;&#30340;&#38382;&#39064;&#65292; + Boost.MultiIndex &#26159;&#27491;&#30830;&#30340;&#35299;&#20915;&#26041;&#26696;&#12290;
+      </p>
+<p>
+ The thing is that there are cases where we want to maintain bimap semantics + (use <code class="computeroutput"><span class="identifier">at</span><span class="special">()</span></code> + to find an author given a book name and the other way around) and add information + about the relations that we are sure we will not want to index later (like + the abstracts). Option 1 is not possible, option 2 neither.<br> &#38382;&#39064;&#26159;&#65292;&#22312;&#26377;&#20123;&#24773;&#20917;&#19979;&#65292;&#25105;&#20204;&#24076;&#26395;&#20445;&#25345; + bimap &#30340;&#35821;&#20041;&#26102;(&#20351;&#29992; <code class="computeroutput"><span class="identifier">at</span><span class="special">()</span></code> &#26597;&#25214;&#32473;&#23450;&#20070;&#21517;&#30340;&#20316;&#32773;&#25110;&#20854;&#23427;&#26041;&#24335;) + &#24182;&#19988;&#22686;&#21152;&#19982;&#20851;&#31995;&#30456;&#20851;&#30340;&#20449;&#24687;&#65292;&#25105;&#20204;&#30830;&#20445;&#36825;&#20123;&#20449;&#24687;&#26159;&#19981;&#38656;&#35201;&#32034;&#24341;&#30340;(&#22914;&#25688;&#35201;)&#12290;&#36873;&#25321;1 + &#26159;&#19981;&#21487;&#33021;&#30340;&#65292;&#36873;&#25321;2&#20063;&#19981;&#34892;&#12290;
+      </p>
+<p>
+ Boost.Bimap provides support for this kind of situations by means of an embedded + information member. You can pass an extra parameter to a bimap: <code class="computeroutput"><span class="identifier">with_info</span><span class="special">&lt;</span> + <span class="identifier">InfoType</span> <span class="special">&gt;</span></code> + and an <code class="computeroutput"><span class="identifier">info</span></code> member of type + <code class="computeroutput"><span class="identifier">InfoType</span></code> will appear in the + relation and bimap pairs.<br> Boost.Bimap &#36890;&#36807;&#19968;&#20010;&#23884;&#20837;&#30340;&#20449;&#24687;&#25104;&#21592;&#20026;&#36825;&#31181;&#24773;&#24418;&#25552;&#20379;&#20102;&#25903;&#25345;&#12290;&#20320;&#21487;&#20197;&#20256;&#36882;&#32473; + bimap &#19968;&#20010;&#39069;&#22806;&#30340;&#21442;&#25968;&#65306; <code class="computeroutput"><span class="identifier">with_info</span><span class="special">&lt;</span> <span class="identifier">InfoType</span> + <span class="special">&gt;</span></code>&#65292;&#19968;&#20010;&#31867;&#22411;&#20026; <code class="computeroutput"><span class="identifier">InfoType</span></code> &#30340; <code class="computeroutput"><span class="identifier">info</span></code> + &#25104;&#21592;&#20250;&#20986;&#29616;&#22312;&#20851;&#31995;&#21644; bimap &#23545;&#20013;&#12290;
+      </p>
+<p>
+ <span class="inlinemediaobject"><img src="../../images/bimap/relation.and.pair.with.info.png" alt="relation.and.pair.with.info"></span>
+      </p>
+<p>
+ Relations and bimap pairs constructors will take an extra argument. If only + two arguments are used, the information will be initialized with their default + constructor.<br> &#20851;&#31995;&#21644; bimap &#23545;&#30340;&#26500;&#36896;&#20989;&#25968;&#23558;&#25509;&#21463;&#19968;&#20010;&#39069;&#22806;&#30340;&#21442;&#25968;&#12290;&#22914;&#26524;&#21482;&#20351;&#29992;&#20004;&#20010;&#21442;&#25968;&#65292;&#21017;&#35813;&#20449;&#24687;&#23558;&#34987;&#23427;&#20204;&#30340;&#32570;&#30465;&#26500;&#36896;&#20989;&#25968;&#25152;&#21021;&#22987;&#21270;&#12290;
+      </p>
+<p>
+        </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special">&lt;</span>
+
+ <span class="identifier">multiset_of</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">&gt;,</span> <span class="comment">// author +</span> <span class="identifier">set_of</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">&gt;,</span> <span class="comment">// title
+</span>
+ <span class="identifier">with_info</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">&gt;</span> <span class="comment">// abstract
+</span>
+<span class="special">&gt;</span> <span class="identifier">bm_type</span><span class="special">;</span> +<span class="keyword">typedef</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span> <span class="identifier">book</span><span class="special">;</span>
+
+<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
+
+<span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span>
+
+ <span class="identifier">book</span><span class="special">(</span> <span class="string">"Bjarne Stroustrup"</span> <span class="special">,</span> <span class="string">"The C++ Programming Language"</span><span class="special">,</span>
+
+ <span class="string">"For C++ old-timers, the first edition of this book is"</span> + <span class="string">"the one that started it all&#8212;the font of our knowledge."</span> <span class="special">)</span>
+<span class="special">);</span>
+
+
+<span class="comment">// Print the author of the bible
+</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="string">"The C++ Programming Language"</span><span class="special">);</span>
+
+<span class="comment">// Print the abstract of this book
+</span><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="string">"Bjarne Stroustrup"</span><span class="special">);</span> +<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">i</span><span class="special">-&gt;</span><span class="identifier">info</span><span class="special">;</span>
+</pre>
+<p>
+        </p>
+<p>
+      </p>
+<p>
+ Contrary to the two key types, the information will be mutable using iterators.<br> + &#19982;&#20004;&#20010;&#38190;&#31867;&#22411;&#19981;&#21516;&#65292;&#35813;&#20449;&#24687;&#21487;&#20197;&#36890;&#36807;&#36845;&#20195;&#22120;&#36827;&#34892;&#20462;&#25913;&#12290;
+      </p>
+<p>
+        </p>
+<p>
+
+</p>
<pre class="programlisting"><span class="identifier">i</span><span class="special">-&gt;</span><span class="identifier">info</span> <span class="special">+=</span> <span class="string">"More details about this book"</span><span class="special">;</span>
 </pre>
-
-
-<p> <br>A new function is included in <span class="emphasis"><em>unique</em></span> -map views: <code class="computeroutput"><span class="identifier">info_at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>, that mimics the -standard <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>
-function but returned the associated information instead of the data. </p>
-<p> 在唯一映射视图中将新增一个函数:<code class="computeroutput"><span class="identifier">info_at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>,它模仿标 准的 <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code> 函数,但返回的是相关联的信息而不是数据。</p>
-<p> </p>
-<pre class="programlisting"><span class="comment">// Print the new abstract 打印新的摘要<br></span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">info_at</span><span class="special">(</span><span class="string">"The C++ Programming Language"</span><span class="special">);</span>
-</pre>
-
-
-<p> <br>The info member can be tagged just as the left or the right
-member. The following is a rewrite of the above example using user
-defined names: </p>
-<p> 成员 info 可以象 left 和 right 成员那样加标签。以下使用用户自定义名字重 写上述例子:</p>
-<p> </p>
-<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special">&lt;</span><br><span class="identifier">multiset_of</span><span class="special">&lt;</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="identifier">author</span> <span class="special">&gt;</span> <span class="special">&gt;,</span><br><span class="identifier">set_of</span><span class="special">&lt;</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="identifier">title</span> <span class="special">&gt;</span> <span class="special">&gt;,</span><br><span class="identifier">with_info</span><span class="special">&lt;</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="identifier">abstract</span> <span class="special">&gt;</span> <span class="special">&gt;</span><br><span class="special">&gt;</span> <span class="identifier">bm_type</span><span class="special">;</span><br><span class="keyword">typedef</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span> <span class="identifier">book</span><span class="special">;</span><br><span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span><br><span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><br><span class="identifier">book</span><span class="special">(</span> <span class="string">"Bjarne Stroustrup"</span> <span class="special">,</span> <span class="string">"The C++ Programming Language"</span><span class="special">,</span><br><span class="string">"For C++ old-timers, the first edition of this book is"</span><br><span class="string">"the one that started it all—the font of our knowledge."</span> <span class="special">)</span><br><span class="special">);</span><br><span class="comment">// Print the author of the bible 打印C++圣经的作者<br></span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special">&lt;</span><span class="identifier">title</span><span class="special">&gt;().</span><span class="identifier">at</span><span class="special">(</span><span class="string">"The C++ Programming Language"</span><span class="special">);</span><br><span class="comment">// Print the abstract of this book 打印这本书的摘要<br></span><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">map_by</span><span class="special">&lt;</span><span class="identifier">author</span><span class="special">&gt;::</span><span class="identifier">iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special">&lt;</span><span class="identifier">author</span><span class="special">&gt;().</span><span class="identifier">find</span><span class="special">(</span><span class="string">"Bjarne Stroustrup"</span><span class="special">);</span><br><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">i</span><span class="special">-&gt;</span><span class="identifier">get</span><span class="special">&lt;</span><span class="identifier">abstract</span><span class="special">&gt;();</span><br><span class="comment">// Contrary to the two key types, the information will be mutable<br></span><span class="comment">// using iterators. 与两个键类型不同,信息可以通过迭代器修改 <br></span><br><span class="identifier">i</span><span class="special">-&gt;</span><span class="identifier">get</span><span class="special">&lt;</span><span class="identifier">abstract</span><span class="special">&gt;()</span> <span class="special">+=</span> <span class="string">"More details about this book"</span><span class="special">;</span><br><span class="comment">// Print the new abstract 打印新的摘要<br></span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special">&lt;</span><span class="identifier">title</span><span class="special">&gt;().</span><span class="identifier">info_at</span><span class="special">(</span><span class="string">"The C++ Programming Language"</span><span class="special">);</span>
-</pre>
-
-
-<p> <a href="../../../../example/tutorial_info_hook.cpp" target="_top">Go to source code 察看源代码</a> </p>
+<p>
+        </p>
+<p>
+      </p>
+<p>
+ A new function is included in <span class="emphasis"><em>unique</em></span> map views: <code class="computeroutput"><span class="identifier">info_at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>, that + mimics the standard <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code> function + but returned the associated information instead of the data.<br> &#22312;<span class="emphasis"><em>&#21807;&#19968;</em></span>&#26144;&#23556;&#35270;&#22270;&#20013;&#23558;&#26032;&#22686;&#19968;&#20010;&#20989;&#25968;&#65306;<code class="computeroutput"><span class="identifier">info_at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>&#65292;&#23427;&#27169;&#20223;&#26631;&#20934;&#30340; + <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code> &#20989;&#25968;&#65292; + &#20294;&#36820;&#22238;&#30340;&#26159;&#30456;&#20851;&#32852;&#30340;&#20449;&#24687;&#32780;&#19981;&#26159;&#25968;&#25454;&#12290;
+      </p>
+<p>
+        </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="comment">// Print the new abstract
+</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">info_at</span><span class="special">(</span><span class="string">"The C++ Programming Language"</span><span class="special">);</span>
+</pre>
+<p>
+        </p>
+<p>
+      </p>
+<p>
+ The info member can be tagged just as the left or the right member. The following + is a rewrite of the above example using user defined names:<br> &#25104;&#21592; + info &#21487;&#20197;&#35937; left &#21644; right &#25104;&#21592;&#37027;&#26679;&#21152;&#26631;&#31614;&#12290;&#20197;&#19979;&#20351;&#29992;&#29992;&#25143;&#33258;&#23450;&#20041;&#21517;&#23383;&#37325;&#20889;&#19978;&#36848;&#20363;&#23376;&#65306;
+      </p>
+<p>
+        </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special">&lt;</span>
+
+ <span class="identifier">multiset_of</span><span class="special">&lt;</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="identifier">author</span> <span class="special">&gt;</span> <span class="special">&gt;,</span> + <span class="identifier">set_of</span><span class="special">&lt;</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="identifier">title</span> <span class="special">&gt;</span> <span class="special">&gt;,</span>
+
+ <span class="identifier">with_info</span><span class="special">&lt;</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="identifier">abstract</span> <span class="special">&gt;</span> <span class="special">&gt;</span>
+
+<span class="special">&gt;</span> <span class="identifier">bm_type</span><span class="special">;</span> +<span class="keyword">typedef</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span> <span class="identifier">book</span><span class="special">;</span>
+
+<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
+
+<span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span>
+
+ <span class="identifier">book</span><span class="special">(</span> <span class="string">"Bjarne Stroustrup"</span> <span class="special">,</span> <span class="string">"The C++ Programming Language"</span><span class="special">,</span>
+
+ <span class="string">"For C++ old-timers, the first edition of this book is"</span> + <span class="string">"the one that started it all&#8212;the font of our knowledge."</span> <span class="special">)</span>
+<span class="special">);</span>
+
+<span class="comment">// Print the author of the bible
+</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special">&lt;</span><span class="identifier">title</span><span class="special">&gt;().</span><span class="identifier">at</span><span class="special">(</span><span class="string">"The C++ Programming Language"</span><span class="special">);</span>
+
+<span class="comment">// Print the abstract of this book
+</span><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">map_by</span><span class="special">&lt;</span><span class="identifier">author</span><span class="special">&gt;::</span><span class="identifier">iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special">&lt;</span><span class="identifier">author</span><span class="special">&gt;().</span><span class="identifier">find</span><span class="special">(</span><span class="string">"Bjarne Stroustrup"</span><span class="special">);</span> +<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">i</span><span class="special">-&gt;</span><span class="identifier">get</span><span class="special">&lt;</span><span class="identifier">abstract</span><span class="special">&gt;();</span>
+
+<span class="comment">// Contrary to the two key types, the information will be mutable
+</span><span class="comment">// using iterators.
+</span>
+<span class="identifier">i</span><span class="special">-&gt;</span><span class="identifier">get</span><span class="special">&lt;</span><span class="identifier">abstract</span><span class="special">&gt;()</span> <span class="special">+=</span> <span class="string">"More details about this book"</span><span class="special">;</span>
+
+<span class="comment">// Print the new abstract
+</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special">&lt;</span><span class="identifier">title</span><span class="special">&gt;().</span><span class="identifier">info_at</span><span class="special">(</span><span class="string">"The C++ Programming Language"</span><span class="special">);</span>
+</pre>
+<p>
+        </p>
+<p>
+      </p>
+<p>
+ <a href="../../../../example/tutorial_info_hook.cpp" target="_top">Go to source code &#23519;&#30475;&#28304;&#20195;&#30721;</a>
+      </p>
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%">
-<tbody>
-<tr>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
-<td align="right">
-<div class="copyright-footer">Copyright © 2006 -2007
-Matias Capeletto
-<p> Distributed under the Boost Software License, Version
-1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
-</p>
-</div>
-</td>
-</tr>
-</tbody>
-</table>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
 <hr>
-<div class="spirit-nav"><a accesskey="p" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="complete_instantiation_scheme.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<div class="spirit-nav">
+<a accesskey="p" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="complete_instantiation_scheme.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html Mon Mar 8 01:27:36 2010
@@ -1,39 +1,44 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Bimaps with user defined names</title><link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Bimaps with user defined names &#29992;&#25143;&#33258;&#23450;&#20041;&#21517;&#23383;&#30340;Bimap</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="up" href="../the_tutorial.html" title="The tutorial">
-<link rel="prev" href="useful_functions.html" title="Useful functions">
-<link rel="next" href="unconstrained_sets.html" title="Unconstrained Sets"></head> -<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../the_tutorial.html" title="The tutorial &#25351;&#21335;"> +<link rel="prev" href="useful_functions.html" title="Useful functions &#26377;&#29992;&#30340;&#20989;&#25968;"> +<link rel="next" href="unconstrained_sets.html" title="Unconstrained Sets &#19981;&#21463;&#38480;&#30340;set">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libraries.htm">Libraries</a></td> -<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="useful_functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.bimaps_with_user_defined_names"></a><a class="link" href="bimaps_with_user_defined_names.html" title="Bimaps with user defined names">Bimaps
-      with user defined names 用户自定义名字的 Bimap</a>
+<a name="boost_bimap.the_tutorial.bimaps_with_user_defined_names"></a><a class="link" href="bimaps_with_user_defined_names.html" title="Bimaps with user defined names &#29992;&#25143;&#33258;&#23450;&#20041;&#21517;&#23383;&#30340;Bimap"> + Bimaps with user defined names &#29992;&#25143;&#33258;&#23450;&#20041;&#21517;&#23383;&#30340;Bimap</a>
 </h3></div></div></div>
 <p>
In the following example, the library user inserted comments to guide future - programmers:</p><p>在以下例子中,库用户插入了一些注释,以指导以后的 程序员: + programmers:<br> &#22312;&#20197;&#19979;&#20363;&#23376;&#20013;&#65292;&#24211;&#29992;&#25143;&#25554;&#20837;&#20102;&#19968;&#20123;&#27880;&#37322;&#65292;&#20197;&#25351;&#23548;&#20197;&#21518;&#30340;&#31243;&#24207;&#21592;&#65306;
       </p>
-
-
 <p>
- <a href="../../../../example/user_defined_names.cpp" target="_top">Go to source code 察看源代码</a></p> + <a href="../../../../example/user_defined_names.cpp" target="_top">Go to source code &#23519;&#30475;&#28304;&#20195;&#30721;</a>
+      </p>
+<p>
+        </p>
+<p>
+
+</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span>
 <span class="special">&lt;</span>
<span class="identifier">multiset_of</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;,</span>
@@ -43,15 +48,19 @@

<span class="identifier">People</span> <span class="identifier">people</span><span class="special">;</span>

-<span class="comment">// ...<br></span>
+<span class="comment">// ...
+</span>
<span class="keyword">int</span> <span class="identifier">user_id</span><span class="special">;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">cin</span> <span class="special">&gt;&gt;</span> <span class="identifier">user_id</span><span class="special">;</span>

-<span class="comment">// people.right : map&lt;id,name&gt;<br></span>
+<span class="comment">// people.right : map&lt;id,name&gt;
+</span>
<span class="identifier">People</span><span class="special">::</span><span class="identifier">right_const_iterator</span> <span class="identifier">id_iter</span> <span class="special">=</span> <span class="identifier">people</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="identifier">user_id</span><span class="special">);</span> <span class="keyword">if</span><span class="special">(</span> <span class="identifier">id_iter</span> <span class="special">!=</span> <span class="identifier">people</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span> <span class="special">)</span>
 <span class="special">{</span>
- <span class="comment">// first : id<br></span> <span class="comment">// second : name<br></span>
+    <span class="comment">// first  : id
+</span>    <span class="comment">// second : name
+</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"name: "</span> <span class="special">&lt;&lt;</span> <span class="identifier">id_iter</span><span class="special">-&gt;</span><span class="identifier">second</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span> <span class="special">&lt;&lt;</span> <span class="string">"id: "</span> <span class="special">&lt;&lt;</span> <span class="identifier">id_iter</span><span class="special">-&gt;</span><span class="identifier">first</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
 <span class="special">}</span>
@@ -59,14 +68,17 @@
 <span class="special">{</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"Unknown id, users are:"</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>

-    <span class="comment">// people.left : map&lt;name,id&gt;<br></span>
+    <span class="comment">// people.left : map&lt;name,id&gt;
+</span>
<span class="keyword">for</span><span class="special">(</span> <span class="identifier">People</span><span class="special">::</span><span class="identifier">left_const_iterator</span> <span class="identifier">name_iter</span> <span class="special">=</span> <span class="identifier">people</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">iend</span> <span class="special">=</span> <span class="identifier">people</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span>

<span class="identifier">name_iter</span> <span class="special">!=</span> <span class="identifier">iend</span><span class="special">;</span> <span class="special">++</span><span class="identifier">name_iter</span> <span class="special">)</span>
     <span class="special">{</span>
- <span class="comment">// first : name<br></span> <span class="comment">// second : id<br></span>
+        <span class="comment">// first  : name
+</span>        <span class="comment">// second : id
+</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special">&lt;&lt;</span> <span class="string">"name: "</span> <span class="special">&lt;&lt;</span> <span class="identifier">name_iter</span><span class="special">-&gt;</span><span class="identifier">first</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span> <span class="special">&lt;&lt;</span> <span class="string">"id: "</span> <span class="special">&lt;&lt;</span> <span class="identifier">name_iter</span><span class="special">-&gt;</span><span class="identifier">second</span> <span class="special">&lt;&lt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
     <span class="special">}</span>
@@ -80,7 +92,8 @@
In Boost.Bimap there is a better way to document the code and in the meantime helping you to write more mantainable and readable code. You can tag the two collections of the bimap so they can be accessed by more descriptive - names.</p><p>在 Boost.Bimap 中,有更好的方法来注释代码,并帮助你写 出更可维护和可读的代码。你可以对 bimap 的两组数据贴上标签,然后可以通过更清 晰的名字来访问它们。 + names.<br> &#22312; Boost.Bimap &#20013;&#65292;&#26377;&#26356;&#22909;&#30340;&#26041;&#27861;&#26469;&#27880;&#37322;&#20195;&#30721;&#65292;&#24182;&#24110;&#21161;&#20320;&#20889;&#20986;&#26356;&#21487;&#32500;&#25252;&#21644;&#21487;&#35835;&#30340;&#20195;&#30721;&#12290; + &#20320;&#21487;&#20197;&#23545; bimap &#30340;&#20004;&#32452;&#25968;&#25454;&#36148;&#19978;&#26631;&#31614;&#65292;&#28982;&#21518;&#21487;&#20197;&#36890;&#36807;&#26356;&#28165;&#26224;&#30340;&#21517;&#23383;&#26469;&#35775;&#38382;&#23427;&#20204;&#12290;
       </p>
 <p>
<span class="inlinemediaobject"><img src="../../images/bimap/tagged.png" alt="tagged"></span>
@@ -91,18 +104,29 @@
your own tag, the container uses <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code> and <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">right</span></code> to tag the left and right sides respectively. In order to specify a custom tag, the type of each side has to be tagged. - Tagging a type is very simple:</p><p>一个被标签类型就是一个已经被 tag 所标记的类型。tag 可以是任意一个有效的C++类型。在一个 bimap 中,类型总是 被标签的。如果你没有指定你自己的 tag,则容器使用 <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code> 和 <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">right</span></code> 来分别 标签左组和右组。要指定一个定制的 tag,则每一边的类型都要标签。标签一个类型非 常简单: + Tagging a type is very simple:<br> &#19968;&#20010;&#34987;&#26631;&#31614;&#31867;&#22411;&#23601;&#26159;&#19968;&#20010;&#24050;&#32463;&#34987; + tag &#25152;&#26631;&#35760;&#30340;&#31867;&#22411;&#12290;tag &#21487;&#20197;&#26159;&#20219;&#24847;&#19968;&#20010;&#26377;&#25928;&#30340;C++&#31867;&#22411;&#12290; &#22312;&#19968;&#20010; + bimap &#20013;&#65292;&#31867;&#22411;&#24635;&#26159;&#34987;&#26631;&#31614;&#30340;&#12290;&#22914;&#26524;&#20320;&#27809;&#26377;&#25351;&#23450;&#20320;&#33258;&#24049;&#30340; + tag&#65292;&#21017;&#23481;&#22120;&#20351;&#29992; <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code> + &#21644; <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">right</span></code> &#26469;&#20998;&#21035;&#26631;&#31614;&#24038;&#32452;&#21644;&#21491;&#32452;&#12290;&#35201;&#25351;&#23450;&#19968;&#20010;&#23450;&#21046;&#30340; + tag&#65292;&#21017;&#27599;&#19968;&#36793;&#30340;&#31867;&#22411;&#37117;&#35201;&#26631;&#31614;&#12290; &#26631;&#31614;&#19968;&#20010;&#31867;&#22411;&#38750;&#24120;&#31616;&#21333;&#65306;
       </p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="keyword">int</span><span class="special">,</span> <span class="identifier">a_tag</span> <span class="special">&gt;</span> <span class="identifier">tagged_int</span><span class="special">;</span>
 </pre>
 <p>
-        Now we can rewrite the example:</p><p>现在我们可以重写以上例子:
+ Now we can rewrite the example:<br> &#29616;&#22312;&#25105;&#20204;&#21487;&#20197;&#37325;&#20889;&#20197;&#19978;&#20363;&#23376;&#65306;
       </p>
-
-
 <p>
- <a href="../../../../example/user_defined_names.cpp" target="_top">Go to source code 察看源代码</a></p> -<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">id</span> <span class="special">{};</span> <span class="comment">// Tag for the identification number 识别号码的标签 <br></span><span class="keyword">struct</span> <span class="identifier">name</span> <span class="special">{};</span> <span class="comment">// Tag for the name of the person 人员姓名的标签<br></span> + <a href="../../../../example/user_defined_names.cpp" target="_top">Go to source code &#23519;&#30475;&#28304;&#20195;&#30721;</a>
+      </p>
+<p>
+        </p>
+<p>
+
+</p>
+<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">id</span> <span class="special">{};</span> <span class="comment">// Tag for the identification number +</span><span class="keyword">struct</span> <span class="identifier">name</span> <span class="special">{};</span> <span class="comment">// Tag for the name of the person
+</span>
 <span class="keyword">typedef</span> <span class="identifier">bimap</span>
 <span class="special">&lt;</span>
<span class="identifier">tagged</span><span class="special">&lt;</span> <span class="keyword">int</span> <span class="special">,</span> <span class="identifier">id</span> <span class="special">&gt;</span> <span class="special">,</span>
@@ -112,7 +136,8 @@

<span class="identifier">People</span> <span class="identifier">people</span><span class="special">;</span>

-<span class="comment">// ...<br></span>
+<span class="comment">// ...
+</span>
<span class="keyword">int</span> <span class="identifier">user_id</span><span class="special">;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">cin</span> <span class="special">&gt;&gt;</span> <span class="identifier">user_id</span><span class="special">;</span>

@@ -137,39 +162,49 @@
     <span class="special">}</span>
 <span class="special">}</span>
 </pre>
-
-
 <p>
- <br>Here is a list of common structures in both tagged and untagged versions.
+        </p>
+<p>
+      </p>
+<p>
+ Here is a list of common structures in both tagged and untagged versions. Remember that when the bimap has user defined tags you can still use the - untagged version structures.</p><p>以下是带标签和不带标签两种版本的 常用结构。记住,当 bimap 带有用户自定义标签时,你仍然可以使用不带标签的结 构。 + untagged version structures.<br> &#20197;&#19979;&#26159;&#24102;&#26631;&#31614;&#21644;&#19981;&#24102;&#26631;&#31614;&#20004;&#31181;&#29256;&#26412;&#30340;&#24120;&#29992;&#32467;&#26500;&#12290;&#35760;&#20303;&#65292;&#24403; + bimap &#24102;&#26377;&#29992;&#25143;&#33258;&#23450;&#20041;&#26631;&#31614;&#26102;&#65292;&#20320;&#20173;&#28982;&#21487;&#20197;&#20351;&#29992;&#19981;&#24102;&#26631;&#31614;&#30340;&#32467;&#26500;&#12290;
       </p>
<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">Left</span> <span class="special">{};</span> <span class="keyword">struct</span> <span class="identifier">Right</span> <span class="special">{};</span> -<span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special">&lt;</span> <br> <span class="identifier">multiset_of</span><span class="special">&lt;</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="keyword">int</span><span class="special">,</span> <span class="identifier">Left</span> <span class="special">&gt;</span> <span class="special">&gt;,</span> +<span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special">&lt;</span> + <span class="identifier">multiset_of</span><span class="special">&lt;</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="keyword">int</span><span class="special">,</span> <span class="identifier">Left</span> <span class="special">&gt;</span> <span class="special">&gt;,</span> <span class="identifier">unordered_set_of</span><span class="special">&lt;</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="keyword">int</span><span class="special">,</span> <span class="identifier">Right</span> <span class="special">&gt;</span> <span class="special">&gt;</span> <span class="special">&gt;</span> <span class="identifier">bm_type</span><span class="special">;</span>

<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>

-<span class="comment">//...<br></span>
+<span class="comment">//...
+</span>
<span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">iterator</span> <span class="identifier">iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">begin</span><span class="special">();</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_iterator</span> <span class="identifier">left_iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">begin</span><span class="special">();</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_iterator</span> <span class="identifier">right_iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">begin</span><span class="special">();</span>
 </pre>
 <div class="table">
-<a name="id2658530"></a><p class="title"><b>Table&nbsp;1.3.&nbsp;Equivalence of expresions using user defined names</b></p><p class="title"><b>表&nbsp;1.3. 使用用户自定义名字的等 价表达式</b></p> -<div class="table-contents"><table class="table" summary="Equivalence of expresions using user defined names">
-<colgroup><col><col></colgroup>
+<a name="id4883943"></a><p class="title"><b>Table 1.3. Equivalence of expresions using user defined names + &#20351;&#29992;&#29992;&#25143;&#33258;&#23450;&#20041;&#21517;&#23383;&#30340;&#31561;&#20215;&#34920;&#36798;&#24335;</b></p> +<div class="table-contents"><table class="table" summary="Equivalence of expresions using user defined names + &#20351;&#29992;&#29992;&#25143;&#33258;&#23450;&#20041;&#21517;&#23383;&#30340;&#31561;&#20215;&#34920;&#36798;&#24335;">
+<colgroup>
+<col>
+<col>
+</colgroup>
 <thead><tr>
 <th>
             <p>
-              Untagged version 不带标签的版本
+ Untagged version &#19981;&#24102;&#26631;&#31614;&#30340;&#29256;&#26412;
             </p>
             </th>
 <th>
             <p>
-              Tagged version 带标签的版本
+ Tagged version &#24102;&#26631;&#31614;&#30340;&#29256;&#26412;
             </p>
             </th>
 </tr></thead>
@@ -347,16 +382,17 @@
 </div>
 <br class="table-break">
 </div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
 <td align="left"></td>
<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
 </div></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="useful_functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html Mon Mar 8 01:27:36 2010
@@ -1,195 +1,262 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"><title>Complete instantiation scheme</title>
-
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Complete instantiation scheme &#23436;&#25972;&#30340;&#23454;&#20363;&#21270;&#26041;&#26696;</title>
 <link rel="stylesheet" href="../../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="up" href="../the_tutorial.html" title="The tutorial">
-<link rel="prev" href="additional_information.html" title="Additional information">
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../the_tutorial.html" title="The tutorial &#25351;&#21335;"> +<link rel="prev" href="additional_information.html" title="Additional information &#26356;&#22810;&#30340;&#20449;&#24687;">
 <link rel="next" href="../bimap_and_boost.html" title="Bimap and Boost">
 </head>
-<body style="color: black; background-color: white;" alink="#0000ff" link="#0000ff" vlink="#840084">
-<table cellpadding="2" width="100%">
-<tbody>
-<tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../../boost.png" height="86" width="277"></td> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libraries.htm">Libraries</a></td> -<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../../more/index.htm">More</a></td>
-</tr>
-</tbody>
-</table>
+</tr></table>
 <hr>
-<div class="spirit-nav"><a accesskey="p" href="additional_information.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<div class="spirit-nav">
+<a accesskey="p" href="additional_information.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
-<div class="titlepage">
-<div>
-<div>
-<h3 class="title"><a name="boost_bimap.the_tutorial.complete_instantiation_scheme"></a><a class="link" href="complete_instantiation_scheme.html" title="Complete instantiation scheme">Complete instantiation
-scheme 完整的实例化方案</a>
-</h3>
-</div>
-</div>
-</div>
-<p> To summarize, this is the complete instantiation scheme.</p>
-<p>作为总结,以下是完整的实例化方案。 </p>
-<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><br><span class="special">&lt;</span><br><span class="identifier">LeftCollectionType</span><span class="special">,</span> <span class="identifier">RightCollectionType</span><br><span class="special">[</span> <span class="special">,</span> <span class="identifier">SetTypeOfRelation</span> <span class="special">]</span> <span class="comment">// Default to left_based 缺省为 left_based<br></span> <span class="special">[</span> <span class="special">,</span> <span class="identifier">with_info</span><span class="special">&lt;</span> <span class="identifier">Info</span> <span class="special">&gt;</span> <span class="special">]</span> <span class="comment">// Default to no info 缺省为 无信息<br></span> <span class="special">[</span> <span class="special">,</span> <span class="identifier">Allocator</span> <span class="special">]</span> <span class="comment">// Default to std::allocator&lt;&gt; 缺省为 std::allocator&lt;&gt;<br></span><br><span class="special">&gt;</span> <span class="identifier">bm</span><span class="special">;</span>
+<div class="titlepage"><div><div><h3 class="title">
+<a name="boost_bimap.the_tutorial.complete_instantiation_scheme"></a><a class="link" href="complete_instantiation_scheme.html" title="Complete instantiation scheme &#23436;&#25972;&#30340;&#23454;&#20363;&#21270;&#26041;&#26696;"> + Complete instantiation scheme &#23436;&#25972;&#30340;&#23454;&#20363;&#21270;&#26041;&#26696;</a>
+</h3></div></div></div>
+<p>
+ To summarize, this is the complete instantiation scheme.<br> &#20316;&#20026;&#24635;&#32467;&#65292;&#20197;&#19979;&#26159;&#23436;&#25972;&#30340;&#23454;&#20363;&#21270;&#26041;&#26696;&#12290;
+      </p>
+<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span>
+<span class="special">&lt;</span>
+ <span class="identifier">LeftCollectionType</span><span class="special">,</span> <span class="identifier">RightCollectionType</span>
+
+ <span class="special">[</span> <span class="special">,</span> <span class="identifier">SetTypeOfRelation</span> <span class="special">]</span> <span class="comment">// Default to left_based +</span> <span class="special">[</span> <span class="special">,</span> <span class="identifier">with_info</span><span class="special">&lt;</span> <span class="identifier">Info</span> <span class="special">&gt;</span> <span class="special">]</span> <span class="comment">// Default to no info +</span> <span class="special">[</span> <span class="special">,</span> <span class="identifier">Allocator</span> <span class="special">]</span> <span class="comment">// Default to std::allocator&lt;&gt;
+</span>
+<span class="special">&gt;</span> <span class="identifier">bm</span><span class="special">;</span>
 </pre>
-<p> <code class="computeroutput"><span class="special">{</span><span class="identifier">Side</span><span class="special">}</span><span class="identifier">CollectionType</span></code> -can directly be a type. This defaults to <code class="computeroutput"><span class="identifier">set_of</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">&gt;</span></code>, -or can be a <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">&gt;</span></code>
-specification. Additionally, the type of this two parameters can be
-tagged to specify user defined names instead of the usual <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::-</span><span class="identifier">Side</span><span class="special">-</span></code> tags.</p> -<p><code class="computeroutput"><span class="special">{</span><span class="identifier">Side</span><span class="special">}</span><span class="identifier">CollectionType</span></code> -可以直接为一类型。缺省为 <code class="computeroutput"><span class="identifier">set_of</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">&gt;</span></code>, -或者可以是 <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">&gt;</span></code> -声明。另外,这两个参数的类型可以被标签,以用户自定义名字替换普通的 <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::-</span><span class="identifier">Side</span><span class="special">-</span></code> tags. </p>
-<p> The possibles way to use the first parameter are:</p>
-<p>使用第一个参数的可能方法有: </p>
+<p>
+ <code class="computeroutput"><span class="special">{</span><span class="identifier">Side</span><span class="special">}</span><span class="identifier">CollectionType</span></code> + can directly be a type. This defaults to <code class="computeroutput"><span class="identifier">set_of</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">&gt;</span></code>, or can be a <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">&gt;</span></code> + specification. Additionally, the type of this two parameters can be tagged + to specify user defined names instead of the usual <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::-</span><span class="identifier">Side</span><span class="special">-</span></code> tags. <br> <code class="computeroutput"><span class="special">{</span><span class="identifier">Side</span><span class="special">}</span><span class="identifier">CollectionType</span></code> + &#21487;&#20197;&#30452;&#25509;&#20026;&#19968;&#31867;&#22411;&#12290;&#32570;&#30465;&#20026; <code class="computeroutput"><span class="identifier">set_of</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">&gt;</span></code>&#65292;&#25110;&#32773;&#21487;&#20197;&#26159; <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span><span class="identifier">Type</span><span class="special">&gt;</span></code> + &#22768;&#26126;&#12290; &#21478;&#22806;&#65292;&#36825;&#20004;&#20010;&#21442;&#25968;&#30340;&#31867;&#22411;&#21487;&#20197;&#34987;&#26631;&#31614;&#65292;&#20197;&#29992;&#25143;&#33258;&#23450;&#20041;&#21517;&#23383;&#26367;&#25442;&#26222;&#36890;&#30340; + <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::-</span><span class="identifier">Side</span><span class="special">-</span> <span class="identifier">tags</span></code>.
+      </p>
+<p>
+ The possibles way to use the first parameter are:<br> &#20351;&#29992;&#31532;&#19968;&#20010;&#21442;&#25968;&#30340;&#21487;&#33021;&#26041;&#27861;&#26377;&#65306;
+      </p>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">Type</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> Left type: <code class="computeroutput"><span class="identifier">Type</span></code> <br>左类型:<code class="computeroutput"><span class="identifier">Type</span></code>
+<div class="itemizedlist"><ul type="disc">
+<li>
+ Left type: <code class="computeroutput"><span class="identifier">Type</span></code><br> &#24038;&#31867;&#22411;&#65306; + <code class="computeroutput"><span class="identifier">Type</span></code>
 </li>
-<li> Left collection type: <code class="computeroutput"><span class="identifier">set_of</span><span class="special">&lt;</span> <span class="identifier">Type</span> <span class="special">&gt;</span></code> <br>左组合类型:<code class="computeroutput"><span class="identifier">set_of</span><span class="special">&lt;</span> <span class="identifier">Type</span> <span class="special">&gt;</span></code>
+<li>
+ Left collection type: <code class="computeroutput"><span class="identifier">set_of</span><span class="special">&lt;</span> <span class="identifier">Type</span> <span class="special">&gt;</span></code><br> &#24038;&#32452;&#21512;&#31867;&#22411;&#65306;<code class="computeroutput"><span class="identifier">set_of</span><span class="special">&lt;</span> + <span class="identifier">Type</span> <span class="special">&gt;</span></code>
 </li>
-<li> Left tag: <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code> -<br>左标签:<code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code>
+<li>
+ Left tag: <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code><br> &#24038;&#26631;&#31614;&#65306;<code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code>
 </li>
-</ul>
-</div>
+</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span> <span class="identifier">Type</span> <span class="special">&gt;,</span> <span class="identifier">R</span> <span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> Left type: <code class="computeroutput"><span class="identifier">Type</span></code><br>左类型:<code class="computeroutput"><span class="identifier">Type</span></code>
+<div class="itemizedlist"><ul type="disc">
+<li>
+ Left type: <code class="computeroutput"><span class="identifier">Type</span></code><br> &#24038;&#31867;&#22411;&#65306; + <code class="computeroutput"><span class="identifier">Type</span></code>
 </li>
-<li> Left collection type: <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span> <span class="identifier">LeftType</span> <span class="special">&gt;</span></code><br>左组合类型:<code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_</span></code><code class="computeroutput"><span class="identifier">of</span><span class="special">&lt;</span>&nbsp;</code><code class="computeroutput"><span class="identifier">LeftType</span> <span class="special">&gt;</span></code></li> -<li> Left tag: <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code><br>左标签:<code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code>
+<li>
+ Left collection type: <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span> <span class="identifier">LeftType</span> + <span class="special">&gt;</span></code><br> &#24038;&#32452;&#21512;&#31867;&#22411;&#65306;<code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span> <span class="identifier">LeftType</span>
+          <span class="special">&gt;</span></code>
 </li>
-</ul>
-</div>
+<li>
+ Left tag: <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code><br> &#24038;&#26631;&#31614;&#65306;<code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code>
+</li>
+</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="identifier">Type</span><span class="special">,</span> <span class="identifier">Tag</span> <span class="special">&gt;,</span> <span class="identifier">R</span> <span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> Left type: <code class="computeroutput"><span class="identifier">Type</span></code><code class="computeroutput"><span class="identifier"></span></code><br>左类型:<code class="computeroutput"><span class="identifier">Type</span></code>
+<div class="itemizedlist"><ul type="disc">
+<li>
+ Left type: <code class="computeroutput"><span class="identifier">Type</span></code><br> &#24038;&#31867;&#22411;&#65306; + <code class="computeroutput"><span class="identifier">Type</span></code>
 </li>
-<li> Left collection type: <code class="computeroutput"><span class="identifier">set_of</span><span class="special">&lt;</span> <span class="identifier">LeftType</span> <span class="special">&gt;</span></code><code class="computeroutput"><span class="special"></span></code><br>左组合类型:<code class="computeroutput"><span class="identifier">set_</span></code><code class="computeroutput"><span class="identifier">of</span><span class="special">&lt;</span>&nbsp;</code><code class="computeroutput"><span class="identifier">LeftType</span> <span class="special">&gt;</span></code>
+<li>
+ Left collection type: <code class="computeroutput"><span class="identifier">set_of</span><span class="special">&lt;</span> <span class="identifier">LeftType</span> + <span class="special">&gt;</span></code><br> &#24038;&#32452;&#21512;&#31867;&#22411;&#65306;<code class="computeroutput"><span class="identifier">set_of</span><span class="special">&lt;</span> + <span class="identifier">LeftType</span> <span class="special">&gt;</span></code>
 </li>
-<li> Left tag: <code class="computeroutput"><span class="identifier">Tag</span></code><code class="computeroutput"><span class="identifier"></span></code><br>左标签:<code class="computeroutput"><span class="identifier">Tag</span></code>
+<li>
+ Left tag: <code class="computeroutput"><span class="identifier">Tag</span></code><br> &#24038;&#26631;&#31614;&#65306;<code class="computeroutput"><span class="identifier">Tag</span></code>
 </li>
-</ul>
-</div>
+</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span> <span class="identifier">tagged</span><span class="special">&lt;</span> <span class="identifier">Type</span><span class="special">,</span> <span class="identifier">Tag</span> <span class="special">&gt;</span> <span class="special">&gt;,</span> <span class="identifier">R</span> <span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> Left type: <code class="computeroutput"><span class="identifier">Type</span></code><code class="computeroutput"><span class="identifier"></span></code><code class="computeroutput"><span class="identifier"></span></code><br>左类型:<code class="computeroutput"><span class="identifier">Type</span></code>
+<div class="itemizedlist"><ul type="disc">
+<li>
+ Left type: <code class="computeroutput"><span class="identifier">Type</span></code><br> &#24038;&#31867;&#22411;&#65306; + <code class="computeroutput"><span class="identifier">Type</span></code>
 </li>
-<li> Left collection type: <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span> <span class="identifier">LeftType</span> <span class="special">&gt;</span></code><code class="computeroutput"><span class="special"></span></code><br>左组合类型:<code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_</span></code><code class="computeroutput"><span class="identifier">of</span><span class="special">&lt;</span>&nbsp;</code><code class="computeroutput"><span class="identifier">LeftType</span> <span class="special">&gt;</span></code>
+<li>
+ Left collection type: <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span> <span class="identifier">LeftType</span> + <span class="special">&gt;</span></code><br> &#24038;&#32452;&#21512;&#31867;&#22411;&#65306;<code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special">&lt;</span> <span class="identifier">LeftType</span>
+          <span class="special">&gt;</span></code>
 </li>
-<li> Left tag: <code class="computeroutput"><span class="identifier">Tag</span></code><code class="computeroutput"><span class="identifier"></span></code><code class="computeroutput"><span class="identifier"></span></code><br>左标签:<code class="computeroutput"><span class="identifier">Tag</span></code>
+<li>
+ Left tag: <code class="computeroutput"><span class="identifier">Tag</span></code><br> &#24038;&#26631;&#31614;&#65306;<code class="computeroutput"><span class="identifier">Tag</span></code>
 </li>
-</ul>
-</div>
-<p> The same options are available for the second parameter.</p><p>对于第二 个参数,有相同选项可用。 </p>
-<p> The last three parameters are used to specify the collection
-type of the relation, the information member and the allocator type.</p><p>后三个参数用于指定关系组合类型、信息成员和分配器类型。 </p>
-<p> If you want to specify a custom allocator type while relying
-on the default value of CollectionTypeOfRelation, you can do so by
-simply writing <code class="computeroutput"><span class="identifier">bimap</span><span class="special">&lt;</span><span class="identifier">LeftKeyType</span><span class="special">,</span> <span class="identifier">RightKeyType</span><span class="special">,</span> <span class="identifier">Allocator</span><span class="special">&gt;</span></code>.
-Boost.Bimap's internal machinery detects that the third parameter in
-this case does not refer to the relation type but rather to an
-allocator.</p><p>如果你想指定一个依赖于&nbsp;CollectionTypeOfRelation 缺省 值的定制分配器类型,你只需要写 <code class="computeroutput"><span class="identifier">bimap</span><span class="special">&lt;</span><span class="identifier">LeftKeyType</span><span class="special">,</span> <span class="identifier">RightKeyType</span><span class="special">,</span> <span class="identifier">Allocator</span><span class="special">&gt;</span></code>。 -在这种情况下,Boost.Bimap 的内部机制会检测出第三个参数不是指向关系类型而是 一个分配器。 </p>
-<p> The following are the possible ways of instantiating the last
-three parameters of a bimap. You can ignore some of the parameter but
-the order must be respected.</p><p>以下是实例化一个 bimap 的后三个参数的可 能方法。你可以忽略一些参数,但顺序必须遵守。 </p>
+</ul></div>
+<p>
+ The same options are available for the second parameter.<br> &#23545;&#20110;&#31532;&#20108;&#20010;&#21442;&#25968;&#65292;&#26377;&#30456;&#21516;&#36873;&#39033;&#21487;&#29992;&#12290;
+      </p>
+<p>
+ The last three parameters are used to specify the collection type of the + relation, the information member and the allocator type.<br> &#21518;&#19977;&#20010;&#21442;&#25968;&#29992;&#20110;&#25351;&#23450;&#20851;&#31995;&#32452;&#21512;&#31867;&#22411;&#12289;&#20449;&#24687;&#25104;&#21592;&#21644;&#20998;&#37197;&#22120;&#31867;&#22411;&#12290;
+      </p>
+<p>
+ If you want to specify a custom allocator type while relying on the default + value of CollectionTypeOfRelation, you can do so by simply writing <code class="computeroutput"><span class="identifier">bimap</span><span class="special">&lt;</span><span class="identifier">LeftKeyType</span><span class="special">,</span> + <span class="identifier">RightKeyType</span><span class="special">,</span> + <span class="identifier">Allocator</span><span class="special">&gt;</span></code>. + Boost.Bimap's internal machinery detects that the third parameter in this + case does not refer to the relation type but rather to an allocator.<br> + &#22914;&#26524;&#20320;&#24819;&#25351;&#23450;&#19968;&#20010;&#20381;&#36182;&#20110; CollectionTypeOfRelation &#32570;&#30465;&#20540;&#30340;&#23450;&#21046;&#20998;&#37197;&#22120;&#31867;&#22411;&#65292; + &#20320;&#21482;&#38656;&#35201;&#20889; <code class="computeroutput"><span class="identifier">bimap</span><span class="special">&lt;</span><span class="identifier">LeftKeyType</span><span class="special">,</span> + <span class="identifier">RightKeyType</span><span class="special">,</span> + <span class="identifier">Allocator</span><span class="special">&gt;</span></code>&#12290;&#22312;&#36825;&#31181;&#24773;&#20917;&#19979;&#65292; + Boost.Bimap &#30340;&#20869;&#37096;&#26426;&#21046;&#20250;&#26816;&#27979;&#20986;&#31532;&#19977;&#20010;&#21442;&#25968;&#19981;&#26159;&#25351;&#21521;&#20851;&#31995;&#31867;&#22411;&#32780;&#26159;&#19968;&#20010;&#20998;&#37197;&#22120;&#12290;
+      </p>
+<p>
+ The following are the possible ways of instantiating the last three parameters + of a bimap. You can ignore some of the parameter but the order must be respected.<br> + &#20197;&#19979;&#26159;&#23454;&#20363;&#21270;&#19968;&#20010; bimap &#30340;&#21518;&#19977;&#20010;&#21442;&#25968;&#30340;&#21487;&#33021;&#26041;&#27861;&#12290;&#20320;&#21487;&#20197;&#24573;&#30053;&#19968;&#20123;&#21442;&#25968;&#65292;&#20294;&#39034;&#24207;&#24517;&#39035;&#36981;&#23432;&#12290;
+      </p>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> set_of_relation_type: based on the left key type<code class="computeroutput"><span class="identifier"></span></code><code class="computeroutput"><span class="identifier"></span></code><code class="computeroutput"><span class="identifier"></span></code><br> set_of_relation_type: 基于左键类型<code class="computeroutput"><span class="identifier"></span></code> </li> -<li> info: no info<code class="computeroutput"><span class="identifier"></span></code><br> info: 无信息 </li>
-<li> allocator: std::allocator </li>
-</ul>
-</div>
+<div class="itemizedlist"><ul type="disc">
+<li>
+ set_of_relation_type: based on the left key type<br> set_of_relation_type:
+          &#22522;&#20110;&#24038;&#38190;&#31867;&#22411;
+        </li>
+<li>
+          info: no info<br> info: &#26080;&#20449;&#24687;
+        </li>
+<li>
+          allocator: std::allocator
+        </li>
+</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span><span class="identifier">SetOfRelationType</span><span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> set_of_relation_type: SetOfRelationType<code class="computeroutput"><span class="identifier"></span></code><code class="computeroutput"><span class="identifier"></span></code></li> -<li> info: no info<code class="computeroutput"><span class="identifier"></span></code><br> info: 无信息 </li>
-<li> allocator: std::allocator </li>
-</ul>
-</div>
+<div class="itemizedlist"><ul type="disc">
+<li>
+          set_of_relation_type: SetOfRelationType
+        </li>
+<li>
+          info: no info<br> info: &#26080;&#20449;&#24687;
+        </li>
+<li>
+          allocator: std::allocator
+        </li>
+</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">SetOfRelationType</span><span class="special">,</span> <span class="identifier">with_info</span><span class="special">&lt;</span><span class="identifier">Info</span><span class="special">&gt;</span> <span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> set_of_relation_type: SetOfRelationType </li>
-<li> info: Info </li>
-<li> allocator: std::allocator </li>
-</ul>
-</div>
+<div class="itemizedlist"><ul type="disc">
+<li>
+          set_of_relation_type: SetOfRelationType
+        </li>
+<li>
+          info: Info
+        </li>
+<li>
+          allocator: std::allocator
+        </li>
+</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">SetOfRelationType</span><span class="special">,</span> <span class="identifier">with_info</span><span class="special">&lt;</span><span class="identifier">Info</span><span class="special">&gt;,</span> <span class="identifier">Allocator</span><span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> set_of_relation_type: SetOfRelationType </li>
-<li> info: Info </li>
-<li> allocator: Allocator </li>
-</ul>
-</div>
+<div class="itemizedlist"><ul type="disc">
+<li>
+          set_of_relation_type: SetOfRelationType
+        </li>
+<li>
+          info: Info
+        </li>
+<li>
+          allocator: Allocator
+        </li>
+</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">SetOfRelationType</span><span class="special">,</span> <span class="identifier">Allocator</span><span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> set_of_relation_type: SetOfRelationType </li>
-<li> info: no info<code class="computeroutput"><span class="identifier"></span></code><br> info: 无信息 </li>
-<li> allocator: Allocator </li>
-</ul>
-</div>
+<div class="itemizedlist"><ul type="disc">
+<li>
+          set_of_relation_type: SetOfRelationType
+        </li>
+<li>
+          info: no info<br> info: &#26080;&#20449;&#24687;
+        </li>
+<li>
+          allocator: Allocator
+        </li>
+</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">with_info</span><span class="special">&lt;</span><span class="identifier">Info</span><span class="special">&gt;</span> <span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> set_of_relation_type: based on the left key type<code class="computeroutput"><span class="identifier"></span></code><code class="computeroutput"><span class="identifier"></span></code><code class="computeroutput"><span class="identifier"></span></code><br> set_of_relation_type: 基于左键类型 </li>
-<li> info: Info </li>
-<li> allocator: std::allocator </li>
-</ul>
-</div>
+<div class="itemizedlist"><ul type="disc">
+<li>
+ set_of_relation_type: based on the left key type<br> set_of_relation_type:
+          &#22522;&#20110;&#24038;&#38190;&#31867;&#22411;
+        </li>
+<li>
+          info: Info
+        </li>
+<li>
+          allocator: std::allocator
+        </li>
+</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">with_info</span><span class="special">&lt;</span><span class="identifier">Info</span><span class="special">&gt;,</span> <span class="identifier">Allocator</span><span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> set_of_relation_type: based on the left key type<code class="computeroutput"><span class="identifier"></span></code><code class="computeroutput"><span class="identifier"></span></code><code class="computeroutput"><span class="identifier"></span></code><br> set_of_relation_type: 基于左键类型 </li>
-<li> allocator: Allocator </li>
-</ul>
-</div>
+<div class="itemizedlist"><ul type="disc">
+<li>
+ set_of_relation_type: based on the left key type<br> set_of_relation_type:
+          &#22522;&#20110;&#24038;&#38190;&#31867;&#22411;
+        </li>
+<li>
+          allocator: Allocator
+        </li>
+</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">Allocator</span><span class="special">&gt;</span>
 </pre>
-<div class="itemizedlist">
-<ul type="disc">
-<li> set_of_relation_type: based on the left key type<code class="computeroutput"><span class="identifier"></span></code><code class="computeroutput"><span class="identifier"></span></code><code class="computeroutput"><span class="identifier"></span></code><br> set_of_relation_type: 基于左键类型 </li> -<li> info: no info<code class="computeroutput"><span class="identifier"></span></code><br> info: 无信息 </li> -<li> allocator: Allocator</li></ul></div></div><table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tbody><tr><td align="left"></td><td align="right"><div class="copyright-footer">Copyright © 2006 -2007
-Matias Capeletto
-<p> Distributed under the Boost Software License, Version
-1.0. (See accompanying file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
-</p>
+<div class="itemizedlist"><ul type="disc">
+<li>
+ set_of_relation_type: based on the left key type<br> set_of_relation_type:
+          &#22522;&#20110;&#24038;&#38190;&#31867;&#22411;
+        </li>
+<li>
+          info: no info<br> info: &#26080;&#20449;&#24687;
+        </li>
+<li>
+          allocator: Allocator
+        </li>
+</ul></div>
 </div>
-</td>
-</tr>
-</tbody>
-</table>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision"; width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt"; target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
+      </p>
+</div></td>
+</tr></table>
 <hr>
-<div class="spirit-nav"><a accesskey="p" href="additional_information.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<div class="spirit-nav">
+<a accesskey="p" href="additional_information.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
-</body></html>
+</body>
+</html>
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html Mon Mar 8 01:27:36 2010
Binary file, no diff available.
=======================================
--- /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html Thu Sep 4 08:02:36 2008 +++ /trunk/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html Mon Mar 8 01:27:36 2010
@@ -1,72 +1,84 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-
-<title>Differences with standard maps</title><link rel="stylesheet" href="../../boostbook.css" type="text/css">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>Differences with standard maps &#19982;&#26631;&#20934;map&#30340;&#24046;&#24322;</title>
+<link rel="stylesheet" href="../../boostbook.css" type="text/css">
 <meta name="generator" content="DocBook XSL Stylesheets V1.73.2">
-<link rel="start" href="../../index.html" title="Chapter&nbsp;1.&nbsp;Boost.Bimap">
-<link rel="up" href="../the_tutorial.html" title="The tutorial">
-<link rel="prev" href="the_collection_of_relations_type.html" title="The collection of relations type"> -<link rel="next" href="useful_functions.html" title="Useful functions"></head> -<body alink="#0000ff" bgcolor="white" link="#0000ff" text="black" vlink="#840084">
-<table cellpadding="2" width="100%"><tbody><tr>
-<td valign="top"><img alt="Boost C++ Libraries" src="../../../../../../boost.png" height="86" width="277"></td>
+<link rel="start" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../the_tutorial.html" title="The tutorial &#25351;&#21335;"> +<link rel="prev" href="the_collection_of_relations_type.html" title="The collection of relations type &#20851;&#31995;&#32452;&#21512;&#30340;&#31867;&#22411;"> +<link rel="next" href="useful_functions.html" title="Useful functions &#26377;&#29992;&#30340;&#20989;&#25968;">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
 <td align="center"><a href="../../../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../../libraries.htm">Libraries</a></td> -<td align="center"><a href="http://www.boost.org/people/people.htm";>People</a></td>
-<td align="center"><a href="http://www.boost.org/more/faq.htm";>FAQ</a></td>
+<td align="center"><a href="http://www.boost.org/users/people.html";>People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html";>FAQ</a></td>
 <td align="center"><a href="../../../../../../more/index.htm">More</a></td>
-</tr></tbody></table>
+</tr></table>
 <hr>
 <div class="spirit-nav">
<a accesskey="p" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="useful_functions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="boost_bimap.the_tutorial.differences_with_standard_maps"></a><a class="link" href="differences_with_standard_maps.html" title="Differences with standard maps">Differences
-      with standard maps 与标准 map 的差异</a>
+<a name="boost_bimap.the_tutorial.differences_with_standard_maps"></a><a class="link" href="differences_with_standard_maps.html" title="Differences with standard maps &#19982;&#26631;&#20934;map&#30340;&#24046;&#24322;"> + Differences with standard maps &#19982;&#26631;&#20934;map&#30340;&#24046;&#24322;</a>
 </h3></div></div></div>
 <div class="toc"><dl>
-<dt><span class="section"><a href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.insertion">Insertion 插入操作</a></span></dt> -<dt><span class="section"><a href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type">iterator::value_type 迭代器的值类型</a></span></dt> +<dt><span class="section"><a href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.insertion">
+        Insertion &#25554;&#20837;&#25805;&#20316;</a></span></dt>
+<dt><span class="section"><a href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type"> + iterator::value_type &#36845;&#20195;&#22120;&#30340;&#20540;&#31867;&#22411;</a></span></dt> <dt><span class="section"><a href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.operator_____and_at__">operator[]
-        and at() &nbsp;operator[] 与 at()</a></span></dt>
-<dt><span class="section"><a href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.complexity_of_operations">Complexity
-        of operations 各种操作的复杂度</a></span></dt>
+        and at()</a></span></dt>
+<dt><span class="section"><a href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.complexity_of_operations"> + Complexity of operations &#21508;&#25805;&#20316;&#30340;&#22797;&#26434;&#24230;</a></span></dt>
 </dl></div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.differences_with_standard_maps.insertion"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.insertion" title="Insertion">Insertion 插入操作</a> +<a name="boost_bimap.the_tutorial.differences_with_standard_maps.insertion"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.insertion" title="Insertion &#25554;&#20837;&#25805;&#20316;">
+        Insertion &#25554;&#20837;&#25805;&#20316;</a>
 </h4></div></div></div>
 <p>
Remember that a map can be interpreted as a relation between two collections. In bimaps we have the freedom to change both collection types, imposing constrains in each of them. Some insertions that we give for granted to - success in standard maps fails with bimaps. For example:</p><p>记 得 map 可以被解释为两组数据之间的关系。在 bimap 中,我们可以自由修改两组数据 的类型,对各组数据加以约束。这样,有些在标准 map 中可以成功的插入操作在 bimap 中就会失败。例如: + success in standard maps fails with bimaps. For example:<br> &#35760;&#24471; map + &#21487;&#20197;&#34987;&#35299;&#37322;&#20026;&#20004;&#32452;&#25968;&#25454;&#20043;&#38388;&#30340;&#20851;&#31995;&#12290;&#22312; bimap &#20013;&#65292;&#25105;&#20204;&#21487;&#20197;&#33258;&#30001;&#20462;&#25913;&#20004;&#32452;&#25968;&#25454;&#30340;&#31867;&#22411;&#65292; + &#23545;&#21508;&#32452;&#25968;&#25454;&#21152;&#20197;&#32422;&#26463;&#12290;&#36825;&#26679;&#65292;&#26377;&#20123;&#22312;&#26631;&#20934; map &#20013;&#21487;&#20197;&#25104;&#21151;&#30340;&#25554;&#20837;&#25805;&#20316;&#22312; + bimap &#20013;&#23601;&#20250;&#22833;&#36133;&#12290;&#20363;&#22914;&#65306;
         </p>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">,</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;</span> <span class="identifier">bm</span><span class="special">;</span>

<span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="number">1</span><span class="special">,</span><span class="string">"orange"</span><span class="special">);</span> -<span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="number">2</span><span class="special">,</span><span class="string">"orange"</span><span class="special">);</span> <span class="comment">// No effect! returns make_pair(iter,false) 无效!返回 </span><span class="comment"> make_pair(iter,false)</span><span class="comment"> </span></pre> +<span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="number">2</span><span class="special">,</span><span class="string">"orange"</span><span class="special">);</span> <span class="comment">// No effect! returns make_pair(iter,false) &#26080;&#25928;&#65281;&#36820;&#22238; make_pair(iter,false)
+</span></pre>
 <p>
The insertion will only succeed if it is allowed by all views of the <code class="computeroutput"><span class="identifier">bimap</span></code>. In the next snippet we define the right collection as a multiset, when we try to insert the same two elements the second insertion is allowed by the left map view because both values are different and it is allowed by the right map view because it - is a non-unique collection type.</p><p>插入操作只有在 <code class="computeroutput"><span class="identifier">bimap</span></code> 的所有视 图都允许时才能成功。在后面一段代码中,我们将右组定义为 multiset,这样我们在 尝试插入与上相同的两个元素时,左映射视图因为插入的值不同而允许插入,同时还由 于右映射视图为非唯一值组合类型而允许插入。 + is a non-unique collection type.<br> &#25554;&#20837;&#25805;&#20316;&#21482;&#26377;&#22312; <code class="computeroutput"><span class="identifier">bimap</span></code> &#30340;&#25152;&#26377;&#35270;&#22270;&#37117;&#20801;&#35768;&#26102;&#25165;&#33021;&#25104;&#21151;&#12290;&#22312;&#21518;&#38754;&#19968;&#27573;&#20195;&#30721;&#20013;&#65292;&#25105;&#20204;&#23558;&#21491;&#32452;&#23450;&#20041;&#20026; + multiset&#65292; &#36825;&#26679;&#25105;&#20204;&#22312;&#23581;&#35797;&#25554;&#20837;&#19982;&#19978;&#30456;&#21516;&#30340;&#20004;&#20010;&#20803;&#32032;&#26102;&#65292;&#24038;&#26144;&#23556;&#35270;&#22270;&#22240;&#20026;&#25554;&#20837;&#30340;&#20540;&#19981;&#21516;&#32780;&#20801;&#35768;&#25554;&#20837;&#65292; + &#21516;&#26102;&#36824;&#30001;&#20110;&#21491;&#26144;&#23556;&#35270;&#22270;&#20026;&#38750;&#21807;&#19968;&#20540;&#32452;&#21512;&#31867;&#22411;&#32780;&#20801;&#35768;&#25554;&#20837;&#12290;
         </p>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&lt;</span><span class="keyword">int</span><span class="special">,</span> <span class="identifier">multiset_of</span><span class="special">&lt;</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&gt;</span> <span class="special">&gt;</span> <span class="identifier">bm</span><span class="special">;</span>

<span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="number">1</span><span class="special">,</span><span class="string">"orange"</span><span class="special">);</span> -<span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="number">2</span><span class="special">,</span><span class="string">"orange"</span><span class="special">);</span> <span class="comment">// Insertion succeed! 插入成功!<br></span></pre> +<span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="number">2</span><span class="special">,</span><span class="string">"orange"</span><span class="special">);</span> <span class="comment">// Insertion succeed! &#25554;&#20837;&#25104;&#21151;&#65281;
+</span></pre>
 <p>
If we use a custom collection of relation type, the insertion has to be - allowed by it too.</p><p>如果我们使用一个定制的关系类型组合,则插 入操作也必须被它所允许。 + allowed by it too.<br> &#22914;&#26524;&#25105;&#20204;&#20351;&#29992;&#19968;&#20010;&#23450;&#21046;&#30340;&#20851;&#31995;&#31867;&#22411;&#32452;&#21512;&#65292;&#21017;&#25554;&#20837;&#25805;&#20316;&#20063;&#24517;&#39035;&#34987;&#23427;&#25152;&#20801;&#35768;&#12290;
         </p>
 </div>
 <div class="section" lang="en">
 <div class="titlepage"><div><div><h4 class="title">
-<a name="boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type" title="iterator::value_type">iterator::value_type 迭代器的值类型</a> +<a name="boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type" title="iterator::value_type &#36845;&#20195;&#22120;&#30340;&#20540;&#31867;&#22411;"> + iterator::value_type &#36845;&#20195;&#22120;&#30340;&#20540;&#31867;&#22411;</a>
 </h4></div></div></div>
 <p>
The relations stored in the Bimap will not be in most cases modifiable
@@ -76,32 +88,42 @@
However there are some collection types that are not <span class="emphasis"><em>key_based</em></span>, for example list_of. If a Bimap uses one of these collection types there is no problem with modifying the data of that side. The following code - is valid:</p><p>保存在 bimap 中的关系通常不能通过迭代器来直接修 改,因为关系的两边都会被用作<span style="font-style: italic;">基于键 </span>的 set 类型的键。当提领一个&nbsp;<code class="computeroutput"><span class="identifier">bimap</span><span class="special">&lt;</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">&gt;</span></code> 的左映射 视图时,返回的类型<span style="font-style: italic;">签名兼容</span>于 <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span> <span class="keyword">const</span> <span class="identifier">A</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">B</span> <span class="special">&gt;</span></code>。不过有些组合类型并不是<span style="font-style: italic;">基于键</span>的,例如 list_of。如果一个 bimap 使 用的是这些类型,那么修改该侧数据是没有问题的。如以下代码就是有效的: + is valid:<br> &#20445;&#23384;&#22312; bimap &#20013;&#30340;&#20851;&#31995;&#36890;&#24120;&#19981;&#33021;&#36890;&#36807;&#36845;&#20195;&#22120;&#26469;&#30452;&#25509;&#20462;&#25913;&#65292;&#22240;&#20026;&#20851;&#31995;&#30340;&#20004;&#36793;&#37117;&#20250;&#34987;&#29992;&#20316;<span class="emphasis"><em>&#22522;&#20110;&#38190;</em></span>&#30340; + set &#3186