/usr/lib/ats-anairiats-0.2.11/libats/DATS/biarray.dats is in ats-lang-anairiats 0.2.11-1build1.
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 | (***********************************************************************)
(* *)
(* Applied Type System *)
(* *)
(* Hongwei Xi *)
(* *)
(***********************************************************************)
(*
** ATS - Unleashing the Potential of Types!
** Copyright (C) 2002-2010 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 as published by the Free
** Software Foundation; either version 2.1, 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, write to the Free
** Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
** 02110-1301, USA.
*)
(* ****** ****** *)
(*
**
** Bidirectional Arrays (arrays moving from left to right and vice versa)
** Contributed by Hongwei Xi (hwxi AT cs DOT bu DOT edu)
** Time: September, 2011
**
*)
(* ****** ****** *)
#define ATS_DYNLOADFLAG 0 // no need for dynamic loading
(* ****** ****** *)
staload "libats/SATS/biarray.sats"
(* ****** ****** *)
assume
biarray_v (
a:viewt@ype, n:int, lbeg:addr, lend:addr
) = [ofs:int | lend==lbeg+ofs] (
MUL (n, sizeof(a), ofs), array_v (a, n, lbeg)
) // end of [biarray_v]
(* ****** ****** *)
implement
array_v_of_biarray_v (pf) =
let prval (pfmul, pfarr) = pf in pfarr end
// end of [array_v_of_biarray_v]
(* ****** ****** *)
implement
biarray_v_of_array_v (pfmul, pfarr) = (pfmul, pfarr)
(* ****** ****** *)
implement
biarray_v_offset
{a} (pf) = pfmul where {
prval (pfmul, pfarr) = pf
prval () = pf := biarray_v_of_array_v {a} (pfmul, pfarr)
} // end of [biarray_v_offset]
(* ****** ****** *)
implement
biarray_v_unnil (pf) = let
val (pfmul, pfarr) = pf; val () = array_v_unnil (pfarr)
in
mul_elim (pfmul)
end // end of [biarray_v_unnil]
(* ****** ****** *)
(* end of [biarray.dats] *)
|