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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
(***********************************************************************)
(* *)
(* Applied Type System *)
(* *)
(***********************************************************************)
(*
** ATS/Postiats - Unleashing the Potential of Types!
** Copyright (C) 2010-2013 Hongwei Xi, ATS Trustful Software, Inc.
** All rights reserved
**
** ATS is free software; you can redistribute it and/or modify it under
** the terms of the GNU GENERAL PUBLIC LICENSE (GPL) as published by the
** Free Software Foundation; either version 3, or (at your option) any
** later version.
**
** ATS is distributed in the hope that it will be useful, but WITHOUT ANY
** WARRANTY; without even the implied warranty of MERCHANTABILITY or
** FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
** for more details.
**
** You should have received a copy of the GNU General Public License
** along with ATS; see the file COPYING. If not, please write to the
** Free Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
** 02110-1301, USA.
*)
(* ****** ****** *)
(*
** Source:
** $PATSHOME/prelude/DATS/CODEGEN/gorder.atxt
** Time of generation: Fri Sep 26 22:20:58 2014
*)
(* ****** ****** *)
(* Author: Hongwei Xi *)
(* Authoremail: hwxi AT cs DOT bu DOT edu *)
(* Start time: March, 2013 *)
(* ****** ****** *)
implement{a}
glt_val (x, y) = gcompare_val<a> (x, y) < 0
implement{a}
glte_val (x, y) = gcompare_val<a> (x, y) <= 0
implement{a}
ggt_val (x, y) = gcompare_val<a> (x, y) > 0
implement{a}
ggte_val (x, y) = gcompare_val<a> (x, y) >= 0
implement{a}
geq_val (x, y) = gcompare_val<a> (x, y) = 0
implement{a}
gneq_val (x, y) = gcompare_val<a> (x, y) != 0
(* ****** ****** *)
implement{a}
glt_ref (x, y) = gcompare_ref<a> (x, y) < 0
implement{a}
glte_ref (x, y) = gcompare_ref<a> (x, y) <= 0
implement{a}
ggt_ref (x, y) = gcompare_ref<a> (x, y) > 0
implement{a}
ggte_ref (x, y) = gcompare_ref<a> (x, y) >= 0
implement{a}
geq_ref (x, y) = gcompare_ref<a> (x, y) = 0
implement{a}
gneq_ref (x, y) = gcompare_ref<a> (x, y) != 0
(* ****** ****** *)
implement(a:t0p)
gcompare_ref<a> (x, y) = gcompare_val<a> (x, y)
(* ****** ****** *)
implement{a}
gisltz_val (x) = glt_val (x, gnumber_int<a> (0))
implement{a}
gisltez_val (x) = glte_val (x, gnumber_int<a> (0))
implement{a}
gisgtz_val (x) = ggt_val (x, gnumber_int<a> (0))
implement{a}
gisgtez_val (x) = ggte_val (x, gnumber_int<a> (0))
implement{a}
giseqz_val (x) = geq_val (x, gnumber_int<a> (0))
implement{a}
gisneqz_val (x) = gneq_val (x, gnumber_int<a> (0))
(* ****** ****** *)
implement{a}
gabs_val (x) =
if gisgtez_val (x) then x else gneg_val<a> (x)
// end of [gabs_val]
(* ****** ****** *)
implement{a}
gmax_val (x, y) = if ggte_val (x, y) then x else y
implement{a}
gmin_val (x, y) = if glte_val (x, y) then x else y
(* ****** ****** *)
#include "prelude/DATS/gorder_int.dats"
#include "prelude/DATS/gorder_uint.dats"
#include "prelude/DATS/gorder_bool.dats"
#include "prelude/DATS/gorder_char.dats"
#include "prelude/DATS/gorder_float.dats"
#include "prelude/DATS/gorder_string.dats"
(* ****** ****** *)
(* end of [gorder.dats] *)
|
