2 * Copyright (c) 2003 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39 Range
<unsigned> r2("0x1000:+0x100");
44 #define RANGETEST(X, C, Y) \
45 cout << X << " "#C" " << Y << " => " << ((X C Y) ? "true" : "false") << "\n"
49 RANGETEST(i1
, < , r1
);
50 RANGETEST(i1
, <=, r1
);
51 RANGETEST(i1
, > , r1
);
52 RANGETEST(i1
, >=, r1
);
53 RANGETEST(i1
, ==, r1
);
54 RANGETEST(i1
, !=, r1
);
55 RANGETEST(r1
, < , i1
);
56 RANGETEST(r1
, <=, i1
);
57 RANGETEST(r1
, > , i1
);
58 RANGETEST(r1
, >=, i1
);
59 RANGETEST(r1
, ==, i1
);
60 RANGETEST(r1
, !=, i1
);
62 RANGETEST(i2
, < , r1
);
63 RANGETEST(i2
, <=, r1
);
64 RANGETEST(i2
, > , r1
);
65 RANGETEST(i2
, >=, r1
);
66 RANGETEST(i2
, ==, r1
);
67 RANGETEST(i2
, !=, r1
);
68 RANGETEST(r1
, < , i2
);
69 RANGETEST(r1
, <=, i2
);
70 RANGETEST(r1
, > , i2
);
71 RANGETEST(r1
, >=, i2
);
72 RANGETEST(r1
, ==, i2
);
73 RANGETEST(r1
, !=, i2
);
77 RANGETEST(u1
, < , r2
);
78 RANGETEST(u1
, <=, r2
);
79 RANGETEST(u1
, > , r2
);
80 RANGETEST(u1
, >=, r2
);
81 RANGETEST(u1
, ==, r2
);
82 RANGETEST(u1
, !=, r2
);
83 RANGETEST(r2
, < , u1
);
84 RANGETEST(r2
, <=, u1
);
85 RANGETEST(r2
, > , u1
);
86 RANGETEST(r2
, >=, u1
);
87 RANGETEST(r2
, ==, u1
);
88 RANGETEST(r2
, !=, u1
);
90 RANGETEST(u2
, < , r2
);
91 RANGETEST(u2
, <=, r2
);
92 RANGETEST(u2
, > , r2
);
93 RANGETEST(u2
, >=, r2
);
94 RANGETEST(u2
, ==, r2
);
95 RANGETEST(u2
, !=, r2
);
96 RANGETEST(r2
, < , u2
);
97 RANGETEST(r2
, <=, u2
);
98 RANGETEST(r2
, > , u2
);
99 RANGETEST(r2
, >=, u2
);
100 RANGETEST(r2
, ==, u2
);
101 RANGETEST(r2
, !=, u2
);