NextCloud/dlib
1
0
Fork 0
mirror of https://github.com/davisking/dlib.git synced 2024-11-01 10:14:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

clarified spec

Browse Source
This commit is contained in:
Davis King 2012-11-07 22:22:10 -05:00
parent dd97e3b4cc
commit f827c493a1
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
dlib/graph_utils/sample_pair_abstract.h
View File

@ -95,8 +95,9 @@ namespace dlib
- T is a type with an interface compatible with sample_pair.
ensures
- provides a total ordering of sample_pair objects that will cause pairs that are
equal to be adjacent when sorted. This function can be used with std::sort() to
first sort sequences of sample_pair objects and then find duplicate edges.
equal to be adjacent when sorted. So for example, this function can be used
with std::sort() to first sort a sequence of sample_pair objects and then
find duplicate edges.
!*/
template <typename T>
@ -110,7 +111,7 @@ namespace dlib
ensures
- provides a total ordering of sample_pair objects that causes pairs with
smallest distance to be the first in a sorted list. This function can be
used with std::sort()
used with std::sort().
!*/
template <typename T>
@ -125,7 +126,7 @@ namespace dlib
- provides a total ordering of sample_pair objects that causes pairs with
smallest distance to be the first in a sorted list but also orders samples
with equal distances according to order_by_index(). This function can be
used with std::sort()
used with std::sort().
!*/
// ----------------------------------------------------------------------------------------