This file is indexed.

/usr/lib/ats2-postiats-0.2.6/libats/ATS1/SATS/funmset_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
142
143
144
145
146
147
148
149
150
(***********************************************************************)
(*                                                                     *)
(*                         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
**
*)

(* ****** ****** *)
//
// HX-2014-01-15: Porting to ATS2
//
(* ****** ****** *)
//
abstype
mset_t0ype_type (a:t@ype+) = ptr
//
typedef mset(a:t@ype) = mset_t0ype_type(a)
//
(* ****** ****** *)

typedef cmp (a:t@ype) = (a, a) -<cloref> int

fun{a:t@ype}
compare_elt_elt (x1: a, x2: a, cmp: cmp (a)):<> int

(* ****** ****** *)
//
fun{}
funmset_make_nil
  {a:t@ype} ((*void*)):<> mset (a)
//
fun{a:t@ype}
funmset_make_sing (x: a): mset (a)
fun{a:t@ype}
funmset_make_pair
  (x1: a, x2: a, cmp: cmp a): mset (a)
//
fun{a:t@ype}
funmset_make_list (xs: List a, cmp: cmp a): mset (a)
//
(* ****** ****** *)

fun{a:t@ype}
funmset_size (xs: mset(INV(a))):<> Size

(* ****** ****** *)

fun{a:t@ype}
funmset_get_ntime
  (xs: mset(INV(a)), x0: a, cmp: cmp a):<> intGte(0)
// end of [funmset_get_ntime]

(* ****** ****** *)

fun{a:t@ype}
funmset_is_member (xs: mset(INV(a)), x0: a, cmp: cmp a):<> bool
fun{a:t@ype}
funmset_isnot_member (xs: mset(INV(a)), x0: a, cmp: cmp a):<> bool

(* ****** ****** *)

fun{a:t@ype}
funmset_is_equal
  (xs1: mset(INV(a)), mxs2: mset (a), cmp: cmp (a)):<> bool
// end of [funmset_is_equal]

(* ****** ****** *)

fun{a:t@ype}
funmset_is_subset
  (xs1: mset(INV(a)), xs2: mset (a), cmp: cmp (a)):<> bool
// end of [funmset_is_subset]

(* ****** ****** *)
(*
** multiset ordering induced by the ordering on elements
*)
fun{a:t@ype}
funmset_compare
  (xs1: mset(INV(a)), xs2: mset (a), cmp: cmp (a)):<> int
// end of [funmset_compare]

(* ****** ****** *)

fun{a:t@ype}
funmset_insert
(
  xs: &mset(INV(a)) >> _, x0: a, cmp: cmp (a)
) :<!wrt> void // end of [funmset_insert]

fun{a:t@ype}
funmset_remove
(
  xs: &mset(INV(a)) >> _, x0: a, cmp: cmp (a)
) :<!wrt> bool(*removed/not: true/false*)
// end of [funmset_remove]

(* ****** ****** *)

fun{a:t@ype}
funmset_union
  (xs1: mset(INV(a)), xs2: mset (a), cmp: cmp (a)): mset (a)
fun{a:t@ype}
funmset_intersect
  (xs1: mset(INV(a)), xs2: mset (a), cmp: cmp (a)): mset (a)

(* ****** ****** *)
//
fun{a:t@ype}
funmset_listize (xs: mset(INV(a))): List0_vt (a) // no repeats
//
fun{a:t@ype} // if an element occurs n times, then it is repeated
funmset_mlistize (xs: mset (INV(a))): List0_vt (a) // n times in the output
//
(* ****** ****** *)

(* end of [funmset_listord.sats] *)