/usr/lib/ats2-postiats-0.2.6/libats/ATS1/SATS/funset_listord.sats is in ats2-lang 0.2.6-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 | (***********************************************************************)
(* *)
(* Applied Type System *)
(* *)
(* Hongwei Xi *)
(* *)
(***********************************************************************)
(*
** ATS - Unleashing the Potential of Types!
** Copyright (C) 2002-2011 Hongwei Xi, Boston University
** 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.
*)
(* ****** ****** *)
(*
**
** A functional map implementation based on ordered lists
**
** Contributed by Hongwei Xi (hwxi AT cs DOT bu DOT edu)
** Time: May 18, 2011
**
*)
(* ****** ****** *)
abstype
set_t0ype_type (a:t@ype+) = ptr
typedef set (a:t0p) = set_t0ype_type (a)
(* ****** ****** *)
typedef cmp (a:t0p) = (a, a) -<cloref> int
fun{a:t0p}
compare_elt_elt (x1: a, x2: a, cmp: cmp(a)):<> int
(* ****** ****** *)
fun{}
funset_make_nil{a:t0p} ():<> set (a)
fun{a:t0p}
funset_make_sing (x0: a):<> set (a) // singleton set
fun{a:t0p}
funset_make_list (xs: List(INV(a)), cmp: cmp a):<!wrt> set (a)
(* ****** ****** *)
fun{a:t0p}
funset_size (xs: set(INV(a))):<> sizeGte(0)
(* ****** ****** *)
fun{a:t0p}
funset_is_member
(xs: set(INV(a)), x0: a, cmp: cmp a):<> bool
fun{a:t0p}
funset_isnot_member
(xs: set(INV(a)), x0: a, cmp: cmp a):<> bool
(* ****** ****** *)
fun{a:t0p}
funset_is_equal
(xs1: set(INV(a)), xs2: set (a), cmp: cmp (a)):<> bool
// end of [funset_is_equal]
fun{a:t0p}
funset_is_subset
(xs1: set(INV(a)), xs2: set (a), cmp: cmp (a)):<> bool
// end of [funset_is_subset]
(* ****** ****** *)
(*
** set ordering induced by the ordering on elements
*)
fun{a:t0p}
funset_compare
(xs1: set(INV(a)), xs2: set(a), cmp: cmp (a)):<> int
// end of [funset_compare]
(* ****** ****** *)
fun{a:t0p}
funset_insert (
xs: &set(INV(a)) >> _, x0: a, cmp: cmp (a)
) :<!wrt> bool (* [x0] alreay exists in [xs] *)
fun{a:t0p}
funset_remove (
xs: &set(INV(a)) >> _, x0: a, cmp: cmp (a)
) :<!wrt> bool(* removed/~removed: true/false *)
(* ****** ****** *)
fun{a:t0p}
funset_union
(xs1: set(INV(a)), xs2: set(a), cmp: cmp (a)):<> set (a)
fun{a:t0p} funset_intersect
(xs1: set(INV(a)), xs2: set(a), cmp: cmp (a)):<> set (a)
fun{a:t0p} funset_diff
(xs1: set(INV(a)), xs2: set(a), cmp: cmp (a)):<> set (a)
fun{a:t0p} funset_symdiff
(xs1: set(INV(a)), xs2: set(a), cmp: cmp (a)):<> set (a)
(* ****** ****** *)
fun{a:t0p}
funset_foreach_funenv
{v:view}{vt:vtype}
(
pf: !v | xs: set(INV(a)), f: (!v | a, !vt) -> void, env: !vt
) : void // end of [funset_foreach_funenv]
(* ****** ****** *)
//
castfn
funset2list{a:t0p} (xs: set(INV(a))):<> List (a)
//
fun{a:t0p}
funset_listize (xs: set (a)):<!wrt> List0_vt (a) // = list_copy
//
(* ****** ****** *)
(* end of [funset_listord.sats] *)
|