File: SortClass.h

package info (click to toggle)
stlport4.6 4.6.2-7
  • links: PTS, VCS
  • area: main
  • in suites: squeeze, wheezy
  • size: 7,056 kB
  • ctags: 16,390
  • sloc: ansic: 46,190; cpp: 18,805; sh: 266; asm: 93; perl: 58; makefile: 10
file content (76 lines) | stat: -rw-r--r-- 2,249 bytes parent folder | download | duplicates (5)
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
66
67
68
69
70
71
72
73
74
75
76
/***********************************************************************************
	SortClass.h
	
 * Copyright (c) 1997
 * Mark of the Unicorn, Inc.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Mark of the Unicorn makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
		
		SUMMARY: A class designed to test operations that compares objects. All
			comparisons on SortClass may fail. Also records its own address for
			the sake of testing the stability of sorting algorithms.
		
***********************************************************************************/
#if ! defined (INCLUDED_MOTU_SortClass)
#define INCLUDED_MOTU_SortClass 1

# include "Prefix.h"
# include "TestClass.h"

class SortClass : public TestClass
{
public:
	enum { kRange = 100 };

	SortClass( int v ) : TestClass( v ), addr(this) {}
	SortClass() : TestClass( (int)get_random(kRange) ), addr(this) {}
	
	bool operator<( const TestClass& rhs ) const
	{
		simulate_possible_failure();
		return (const TestClass&)*this < ( rhs );
	}
	
	bool operator==( const TestClass& rhs ) const
	{
		simulate_possible_failure();
		return (const TestClass&)*this == ( rhs );
	}
	
	SortClass* GetAddress() const { return addr; }
	void ResetAddress() { addr = this; }
	
private:
	SortClass* addr;
};

inline bool operator>( const SortClass& lhs, const SortClass& rhs ) {
    return rhs < lhs;
}

inline bool operator<=( const SortClass& lhs, const SortClass& rhs ) {
    return !(rhs < lhs);
}

inline bool operator>=( const SortClass& lhs, const SortClass& rhs ) {
    return !(lhs < rhs);
}

inline bool operator != ( const SortClass& lhs, const SortClass& rhs ) {
    return !(lhs == rhs);
}

#if defined( __MWERKS__ ) && __MWERKS__ <= 0x3000 && !__SGI_STL
# if defined( __MSL__ ) && __MSL__ < 0x2406
__MSL_FIX_ITERATORS__(SortClass);
__MSL_FIX_ITERATORS__(const SortClass);
# endif
#endif

#endif // INCLUDED_MOTU_SortClass