mirror of
https://github.com/boostorg/functional.git
synced 2025-08-02 14:04:27 +02:00
Merge some documentation improvements from the development branch.
[SVN r38878]
This commit is contained in:
@@ -370,6 +370,8 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|||||||
</method>
|
</method>
|
||||||
</struct-specialization>
|
</struct-specialization>
|
||||||
|
|
||||||
|
<free-function-group name="Support functions (Boost extension).">
|
||||||
|
|
||||||
<!--
|
<!--
|
||||||
boost::hash_combine
|
boost::hash_combine
|
||||||
-->
|
-->
|
||||||
@@ -464,6 +466,10 @@ for(; first != last; ++first)
|
|||||||
</para></throws>
|
</para></throws>
|
||||||
</overloaded-function>
|
</overloaded-function>
|
||||||
|
|
||||||
|
</free-function-group>
|
||||||
|
|
||||||
|
<free-function-group name="Overloadable hash implementation (Boost extension).">
|
||||||
|
|
||||||
<!--
|
<!--
|
||||||
boost::hash_value - integers
|
boost::hash_value - integers
|
||||||
-->
|
-->
|
||||||
@@ -694,6 +700,7 @@ return seed;</programlisting></entry>
|
|||||||
</informaltable>
|
</informaltable>
|
||||||
</returns>
|
</returns>
|
||||||
</overloaded-function>
|
</overloaded-function>
|
||||||
|
</free-function-group>
|
||||||
</namespace>
|
</namespace>
|
||||||
</header>
|
</header>
|
||||||
</library-reference>
|
</library-reference>
|
||||||
|
@@ -5,16 +5,15 @@
|
|||||||
|
|
||||||
[section:acknowledgements Acknowledgements]
|
[section:acknowledgements Acknowledgements]
|
||||||
|
|
||||||
This library is based on the design by Peter Dimov's original design.
|
This library is based on the design by Peter Dimov. During the initial
|
||||||
|
development
|
||||||
During the initial development Joaquín M López Muñoz made many useful
|
Joaquín M López Muñoz made many useful suggestions and contributed fixes.
|
||||||
suggestions, contributed fixes.
|
|
||||||
|
|
||||||
The formal review was managed by Thorsten Ottosen, and the library reviewed by:
|
The formal review was managed by Thorsten Ottosen, and the library reviewed by:
|
||||||
David Abrahams, Alberto Barbati, Topher Cooper, Caleb Epstein, Dave Harris,
|
David Abrahams, Alberto Barbati, Topher Cooper, Caleb Epstein, Dave Harris,
|
||||||
Chris Jefferson, Bronek Kozicki, John Maddock, Tobias Swinger, Jaap Suter, Rob
|
Chris Jefferson, Bronek Kozicki, John Maddock, Tobias Swinger, Jaap Suter,
|
||||||
Stewart and Pavel Vozenilek. Since then, there have been further contributions
|
Rob Stewart and Pavel Vozenilek. Since then, further constructive criticism has
|
||||||
from Daniel Krügler, Alexander Nasonov, 沈慧峰 and John Maddock.
|
been made by Daniel Krügler, Alexander Nasonov and 沈慧峰.
|
||||||
|
|
||||||
The implementation of the hash function for pointers is based on suggestions
|
The implementation of the hash function for pointers is based on suggestions
|
||||||
made by Alberto Barbati and Dave Harris. Dave Harris also suggested an
|
made by Alberto Barbati and Dave Harris. Dave Harris also suggested an
|
||||||
|
@@ -119,7 +119,7 @@ When writing a hash function, first look at how the equality function works.
|
|||||||
Objects that are equal must generate the same hash value.
|
Objects that are equal must generate the same hash value.
|
||||||
When objects are not equal they should generate different hash values.
|
When objects are not equal they should generate different hash values.
|
||||||
In this object equality was based just on the id so the hash function
|
In this object equality was based just on the id so the hash function
|
||||||
only hash the id. If it was based on the objects name and author
|
only hashes the id. If it was based on the object's name and author
|
||||||
then the hash function should take them into account
|
then the hash function should take them into account
|
||||||
(how to do this is discussed in the next section).
|
(how to do this is discussed in the next section).
|
||||||
]
|
]
|
||||||
|
Reference in New Issue
Block a user