(***********************************************************************)
(*                                                                     *)
(*                         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, please write to the
** Free Software Foundation,  51 Franklin Street, Fifth Floor, Boston, MA
** 02110-1301, USA.
*)

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

(*
**
** A functional random-access list implementation based on nested datatypes
**
** Contributed by Hongwei Xi (hwxi AT cs DOT bu DOT edu)
** Time: April, 2010 // based on a version done in November, 2008
**
*)

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

//
// License: LGPL 3.0 (available at http://www.gnu.org/licenses/lgpl.txt)
//

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

#define ATS_STALOADFLAG 0 // no static loading at run-time

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

abstype list_t0ype_type (elt:t@ype+, n:int)
stadef list = list_t0ype_type

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

fun{} funralist_make_nil {elt:t@ype} ():<> list (elt, 0)

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

fun{elt:t@ype} funralist_length {n:nat} (xs: list (elt, n)): int n

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

fun{a:t@ype}
funralist_cons {n:nat} (x: a, xs: list (a, n)):<> list (a, n+1)
// end of [funralist_cons]

fun{a:t@ype}
funralist_uncons {n:pos} (xs: list (a, n), x: &a? >> a):<> list (a, n-1)
// end of [funralist_uncons]

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

fun{a:t@ype} funralist_head {n:pos} (xs: list (a, n)):<> a
fun{a:t@ype} funralist_tail {n:pos} (xs: list (a, n)):<> list (a, n-1)

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

fun{a:t@ype}
funralist_lookup {n:nat} (xs: list (a, n), i: natLt n):<> a
// end of [funralist_lookup]

fun{a:t@ype}
funralist_update {n:nat} (xs: list (a, n), i: natLt n, x: a):<> list (a, n)
// end of [funralist_update]

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

fun{elt:t@ype}
funralist_foreach_clo {v:view} {n:nat} {f:eff}
  (pf: !v | xs: list (elt, n), f: &(!v | elt) -<clo,f> void):<f> void
// end of [funralist_foreach_clo]

fun{elt:t@ype}
funralist_foreach_cloref {v:view} {n:nat} {f:eff}
  (pf: !v | xs: list (elt, n), f: !(!v | elt) -<cloref,f> void):<f> void
// end of [funralist_foreach_cloref]

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

(* end of [funralist_nested.sats] *)