1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
// Copyright (C) 2003 Davis E. King (davis@dlib.net)
// License: Boost Software License See LICENSE.txt for the full license.
#undef DLIB_SEQUENCE_SORt_ABSTRACT_
#ifdef DLIB_SEQUENCE_SORt_ABSTRACT_
#include "sequence_kernel_abstract.h"
namespace dlib
{
template <
typename seq_base
>
class sequence_sort : public seq_base
{
/*!
REQUIREMENTS ON T
T must implement operator< for its type
REQUIREMENTS ON seq_base
must be an implementation of sequence/sequence_kernel_abstract.h
POINTERS AND REFERENCES TO INTERNAL DATA
sort() may invalidate pointers and references to data members.
WHAT THIS EXTENSION DOES FOR sequence
this gives a sequence the ability to sort its contents by calling sort()
!*/
public:
void sort (
);
/*!
ensures
- for all elements in #*this the ith element is <= the i+1 element
- #at_start() == true
throws
- std::bad_alloc or any exception thrown by T's constructor
data may be lost if sort() throws
!*/
};
template <
typename seq_base
>
inline void swap (
sequence_sort<seq_base>& a,
sequence_sort<seq_base>& b
) { a.swap(b); }
/*!
provides a global swap function
!*/
}
#endif // DLIB_SEQUENCE_SORt_ABSTRACT_
|
