)abbrev domain PRIMARR PrimitiveArray
++ Description: This provides a fast array type with no bound checking on
++ elt's.  Minimum index is 0 in this type, cannot be changed.
PrimitiveArray(S : Type) : OneDimensionalArrayAggregate S == add
   Qmax ==> QVMAXINDEX$Lisp
   Qsize ==> QVSIZE$Lisp
   Qelt ==> QAREF1$Lisp
   Qsetelt ==> QSETAREF1$Lisp
   Qnew ==> MAKE_-ARRAY$Lisp
   Qnew1 ==> MAKEARR1$Lisp

   #x                          == Qsize x
   minIndex x                  == 0
   empty()                     == Qnew(0$Lisp)
   new(n, x)                   == Qnew1(n, x)
   qelt(x, i)                  == Qelt(x, i)
   elt(x : %, i : Integer)         == Qelt(x, i)
   qsetelt!(x, i, s)          == Qsetelt(x, i, s)
   setelt!(x : %, i : Integer, s : S) == Qsetelt(x, i, s)
   fill!(x, s)       == (for i in 0..Qmax x repeat Qsetelt(x, i, s); x)

   -- logically unnecessary, but we want to take advantage from
   -- fast indexing.
   if S has Hashable then
       hashUpdate!(s : HashState, x : %) : HashState ==
           for i in 0..Qmax x repeat
               s := hashUpdate!(s, Qelt(x, i))$S
           s


)abbrev package PRIMARR2 PrimitiveArrayFunctions2
++ Description: This package provides tools for operating on primitive arrays
++ with unary and binary functions involving different underlying types.
PrimitiveArrayFunctions2(A, B) : Exports == Implementation where
  A, B : Type

  VA ==> PrimitiveArray A
  VB ==> PrimitiveArray B
  O2 ==> FiniteLinearAggregateFunctions2(A, VA, B, VB)
  Exports ==> with
    scan   : ((A, B) -> B, VA, B) -> VB
        ++ scan(f, a, r) successively applies
        ++ \spad{reduce(f, x, r)} to more and more leading sub-arrays
        ++ x of primitive array \spad{a}.
        ++ More precisely, if \spad{a} is \spad{[a1, a2, ...]}, then
        ++ \spad{scan(f, a, r)} returns
        ++ \spad{[reduce(f, [a1], r), reduce(f, [a1, a2], r), ...]}.
    reduce : ((A, B) -> B, VA, B) -> B
        ++ reduce(f, a, r) applies function f to each
        ++ successive element of the
        ++ primitive array \spad{a} and an accumulant initialized to r.
        ++ For example,
        ++ \spad{reduce(_+$Integer, [1, 2, 3], 0)}
        ++ does \spad{3+(2+(1+0))}. Note: third argument r
        ++ may be regarded as the
        ++ identity element for the function f.
    map    : (A -> B, VA) -> VB
        ++ map(f, a) applies function f to each member of primitive array
        ++ \spad{a} resulting in a new primitive array over a
        ++ possibly different underlying domain.

  Implementation ==> add
    map(f, v)       == map(f, v)$O2
    scan(f, v, b)   == scan(f, v, b)$O2
    reduce(f, v, b) == reduce(f, v, b)$O2

)abbrev domain TUPLE Tuple
++ Description: This domain is used to interface with the interpreter's notion
++ of comma-delimited sequences of values.
Tuple(S : Type) : CoercibleTo(PrimitiveArray S) with
  coerce : PrimitiveArray S -> %
        ++ coerce(a) makes a tuple from primitive array a
  select : (%, NonNegativeInteger) -> S
        ++ select(x, n) returns the n-th element of tuple x.
        ++ tuples are 0-based
  "#" : % -> NonNegativeInteger
        ++ #(x) returns the number of elements in tuple x
  if S has CoercibleTo(OutputForm) then CoercibleTo(OutputForm)
  if S has SetCategory then SetCategory
 == add
  Rep := Record(len : NonNegativeInteger, elts : PrimitiveArray S)

  coerce(x : PrimitiveArray S) : %  == [#x, x]
  coerce(x : %) : PrimitiveArray(S) == x.elts
  #x == x.len

  select(x, n) ==
    n >= x.len => error "Index out of bounds"
    x.elts.n

  if S has SetCategory then
    x = y == (x.len = y.len) and (x.elts =$PrimitiveArray(S) y.elts)

  if S has CoercibleTo(OutputForm) then

    coerce(x : %) : OutputForm ==
      paren [(x.elts.i)::OutputForm
             for i in minIndex x.elts .. maxIndex x.elts]$List(OutputForm)

)abbrev domain IFARRAY IndexedFlexibleArray
++ Author: Michael Monagan July/87, modified SMW June/91
++ Description: A FlexibleArray is the notion of an array intended to allow
++ for growth at the end only.  Hence the following efficient operations
++   \spad{concat!(a, x)} meaning append item x at the end of the array \spad{a}
++   \spad{delete!(a, n)} meaning delete the last item from the array \spad{a}
++ Flexible arrays support the other operations inherited from
++ \spadtype{ExtensibleLinearAggregate}. However, these are not efficient.
++ Flexible arrays combine the \spad{O(1)} access time property of arrays
++ with growing and shrinking at the end in \spad{O(1)} (average) time.
++ This is done by using an ordinary array which may have zero or more
++ empty slots at the end.  When the array becomes full it is copied
++ into a new larger (50% larger) array.  Conversely, when the array
++ becomes less than 1/2 full, it is copied into a smaller array.
++ Flexible arrays provide for an efficient implementation of many
++ data structures in particular heaps, stacks and sets.

IndexedFlexibleArray(S : Type, mn : Integer) : Exports == Implementation where
  A ==> PrimitiveArray S
  I ==> Integer
  N ==> NonNegativeInteger
  U ==> UniversalSegment Integer
  Exports ==
    Join(OneDimensionalArrayAggregate S, ExtensibleLinearAggregate S) with
      flexibleArray : List S -> %
        ++ flexibleArray(l) creates a flexible array from the list of elements l
      physicalLength : % -> NonNegativeInteger
        ++ physicalLength(x) returns the number of elements x can accommodate before growing
      physicalLength! : (%, I) -> %
        ++ physicalLength!(x, n) changes the physical length of x to be n and returns the new array.
      shrinkable : Boolean -> Boolean
        ++ shrinkable(b) sets the shrinkable attribute of flexible arrays to b and returns the previous value
      removeRepeats! : % -> %
        ++ removeRepeats!(u) destructively replaces runs of consecutive
        ++ equal elements of u by single elements.

  Implementation == add
    Rep := Record(physLen : I, logLen : I, f : A)
    shrinkable? : Boolean := true
    growAndFill : (%, I, S) -> %
    growWith    : (%, I, S) -> %
    growAdding  : (%, I, %) -> %
    shrink : (%, I)    -> %
    newa  : (N, A) -> A

    physicalLength(r) == qcoerce(r.physLen)@NonNegativeInteger
    physicalLength!(r, n) ==
       r.physLen = 0  => error "flexible array must be non-empty"
       growWith(r, n, r.f.0)

    empty()      == [0, 0, empty()]
    #r           == (r.logLen)::N
    fill!(r, x) == (fill!(r.f, x); r)
    maxIndex r   == r.logLen - 1 + mn
    minIndex r   == mn
    new(n, a)    == [n, n, new(n, a)]

    shrinkable(b) ==
      oldval := shrinkable?
      shrinkable? := b
      oldval

    flexibleArray l ==
       n := #l
       n = 0 => empty()
       x := l.1
       a := new(n, x)
       for i in mn + 1..mn + n-1 for y in rest l repeat a.i := y
       a

    -- local utility operations
    newa(n, a) ==
       zero? n => empty()
       new(n, a.0)

    growAdding(r, b, s) ==
       b = 0 => r
       #r > 0 => growAndFill(r, b, (r.f).0)
       #s > 0 => growAndFill(r, b, (s.f).0)
       error "no default filler element"

    growAndFill(r, b, x) ==
       (r.logLen := r.logLen + b) <= r.physLen => r
       -- enlarge by 50% + b
       n := r.physLen + r.physLen quo 2 + 1
       if r.logLen > n then n := r.logLen
       growWith(r, n, x)

    growWith(r, n, x) ==
       y := new(n::N, x)$PrimitiveArray(S)
       a := r.f
       for k in 0 .. r.physLen-1 repeat y.k := a.k
       r.physLen := n
       r.f := y
       r

    shrink(r, i) ==
       r.logLen := r.logLen - i
       negative?(n := r.logLen) => error "internal bug in flexible array"
       2*n+2 > r.physLen => r
       not shrinkable? => r
       n = 0 => empty()
       r.physLen := n
       y := newa(n::N, a := r.f)
       for k in 0 .. n-1 repeat y.k := a.k
       r.f := y
       r

    copy r ==
       n := #r
       a := r.f
       v := newa(n, a := r.f)
       for k in 0..n-1 repeat v.k := a.k
       [n, n, v]


    elt(r : %, i : I) ==
       i < mn or i >= r.logLen + mn =>
           error "index out of range"
       r.f.(i-mn)

    setelt!(r : %, i : I, x : S) ==
       i < mn or i >= r.logLen + mn =>
           error "index out of range"
       r.f.(i-mn) := x

    -- operations inherited from extensible aggregate
    merge(g, a, b)   == merge!(g, copy a, b)

    concat!(r : %, x : S) ==
       growAndFill(r, 1, x)
       r.f.(r.logLen-1) := x
       r

    concat!(a : %, b : %) ==
       if eq?(a, b) then b := copy b
       n := #a
       growAdding(a, #b, b)
       copyInto!(a, b, n + mn)

    remove!(g : (S->Boolean), a : %) ==
       k : I := 0
       for i in 0..maxIndex a - mn repeat
          if not g(a.i) then (a.k := a.i; k := k+1)
       shrink(a, #a - k)

    delete!(r : %, i1 : I) ==
       i := i1 - mn
       i < 0 or i > r.logLen => error "index out of range"
       for k in i..r.logLen-2 repeat r.f.k := r.f.(k+1)
       shrink(r, 1)

    delete!(r : %, i : U) ==
       l := low(i) - mn; m := maxIndex r - mn
       h := (hasHi i => high(i) - mn; m)
       l < 0 or h > m => error "index out of range"
       for j in l.. for k in h+1..m repeat r.f.j := r.f.k
       shrink(r, max(0, h-l+1))

    insert!(x : S, r : %, i1 : I) : % ==
       i := i1 - mn
       n := r.logLen
       i < 0 or i > n => error "index out of range"
       growAndFill(r, 1, x)
       for k in n-1 .. i by -1 repeat r.f.(k+1) := r.f.k
       r.f.i := x
       r

    insert!(a : %, b : %, i1 : I) : % ==
       i := i1 - mn
       if eq?(a, b) then b := copy b
       m := #a; n := #b
       i < 0 or i > n => error "index out of range"
       growAdding(b, m, a)
       for k in n-1 .. i by -1 repeat b.f.(m+k) := b.f.k
       for k in m-1 .. 0 by -1 repeat b.f.(i+k) := a.f.k
       b

    merge!(g, a, b) ==
       m := #a; n := #b; growAdding(a, n, b)
       for i in m-1..0 by -1 for j in m+n-1.. by -1 repeat a.f.j := a.f.i
       i := n; j := 0
       for k in 0.. while i < n+m and j < n repeat
          if g(a.f.i, b.f.j) then (a.f.k := a.f.i; i := i+1)
          else (a.f.k := b.f.j; j := j+1)
       for k in k.. for j in j..n-1 repeat a.f.k := b.f.j
       a

    select!(g : (S->Boolean), a : %) ==
       k : I := 0
       for i in 0..maxIndex a - mn repeat if g(a.f.i) then (a.f.k := a.f.i;k := k+1)
       shrink(a, #a - k)

    if S has BasicType then
      removeDuplicates! a ==
         ct := #a
         ct < 2 => a

         i     := mn
         nlim  := mn + ct
         nlim0 := nlim
         while i < nlim repeat
            j := i+1
            for k in j..nlim-1 | a.k ~= a.i repeat
                a.j := a.k
                j := j+1
            nlim := j
            i := i+1
         nlim ~= nlim0 => delete!(a, i..)
         a

      removeRepeats! a ==
          ct := #a
          ct < 2 => a

          j := mn
          nlim := mn + ct
          t := a(j)
          i := j + 1
          while i < nlim repeat
              s := a(i)
              if s ~= t then
                  j := j + 1
                  a(j) := (t := s)
              i := i + 1
          j + 1 < nlim => delete!(a, (j + 1)..)
          a

)abbrev domain FARRAY FlexibleArray
++ Description: A FlexibleArray is the notion of an array intended to allow
++ for growth at the end only.  Hence the following efficient operations
++   \spad{concat!(a, x)} meaning append item x at the end of the array \spad{a}
++   \spad{delete!(a, n)} meaning delete the last item from the array \spad{a}
++ Flexible arrays support the other operations inherited from
++ \spadtype{ExtensibleLinearAggregate}. However, these are not efficient.
++ Flexible arrays combine the \spad{O(1)} access time property of arrays
++ with growing and shrinking at the end in \spad{O(1)} (average) time.
++ This is done by using an ordinary array which may have zero or more
++ empty slots at the end.  When the array becomes full it is copied
++ into a new larger (50% larger) array.  Conversely, when the array
++ becomes less than 1/2 full, it is copied into a smaller array.
++ Flexible arrays provide for an efficient implementation of many
++ data structures in particular heaps, stacks and sets.

FlexibleArray(S : Type) == Implementation where
  ARRAYMININDEX ==> 1       -- if you want to change this, be my guest
  Implementation ==> IndexedFlexibleArray(S, ARRAYMININDEX)
-- Join(OneDimensionalArrayAggregate S, ExtensibleLinearAggregate S)

)abbrev domain IARRAY1 IndexedOneDimensionalArray
++ Author: Micheal Monagan Aug/87
++ Description: This is the basic one dimensional array data type.

IndexedOneDimensionalArray(S : Type, mn : Integer):
 OneDimensionalArrayAggregate S == add
   Qmax ==> QVMAXINDEX$Lisp
   Qsize ==> QVSIZE$Lisp
   Qelt ==> QAREF1$Lisp
   Qsetelt ==> QSETVELT$Lisp
   Qnew ==> MAKE_-ARRAY$Lisp
   Qnew1 ==> MAKEARR1$Lisp
   I ==> Integer

   #x               == Qsize x
   fill!(x, s)     == (for i in 0..Qmax x repeat Qsetelt(x, i, s); x)
   minIndex x       == mn

   empty()          == Qnew(0$Lisp)
   new(n, s)        == Qnew1(n, s)

   map!(f, s1)  ==
      n : Integer := Qmax(s1)
      n < 0 => s1
      for i in 0..n repeat Qsetelt(s1, i, f(Qelt(s1, i)))
      s1

   map(f, s1)       ==
      n : Integer := Qmax(s1)
      n < 0 => s1
      ss2 : % := Qnew(n+1)
      for i in 0..n repeat Qsetelt(ss2, i, f(Qelt(s1, i)))
      ss2

   map(f, a, b)   ==
      maxind : Integer := min(Qmax a, Qmax b)
      maxind < 0 => empty()
      c : % := Qnew(maxind+1)
      for i in 0..maxind repeat
        Qsetelt(c, i, f(Qelt(a, i), Qelt(b, i)))
      c

   -- logically unnecessary, but we want to take advantage from
   -- fast indexing.
   if S has Hashable then

       hashUpdate!(s : HashState, x : %) : HashState ==
           for i in 0..Qmax x repeat
               s := hashUpdate!(s, Qelt(x, i))$S
           s

   if zero? mn then
     qelt(x, i)       == Qelt(x, i)
     qsetelt!(x, i, s) == Qsetelt(x, i, s)

     elt(x : %, i : I) ==
       negative? i or i > maxIndex(x) => error "index out of range"
       qelt(x, i)

     setelt!(x : %, i : I, s : S) ==
       negative? i or i > maxIndex(x) => error "index out of range"
       qsetelt!(x, i, s)

   else if (mn = 1) then
     maxIndex x       == Qsize x
     qelt(x, i)       == Qelt(x, i-1)
     qsetelt!(x, i, s) == Qsetelt(x, i-1, s)

     elt(x : %, i : I) ==
       less_SI(i, 1$Lisp)$Lisp or less_SI(Qsize x, i)$Lisp =>
         error "index out of range"
       Qelt(x, i-1)

     setelt!(x : %, i : I, s : S) ==
       less_SI(i, 1$Lisp)$Lisp or less_SI(Qsize x, i)$Lisp =>
         error "index out of range"
       Qsetelt(x, i-1, s)

    else
       qelt(x, i)       == Qelt(x, i - mn)
       qsetelt!(x, i, s) == Qsetelt(x, i - mn, s)

       elt(x : %, i : I) ==
         i < mn or i > maxIndex(x) => error "index out of range"
         qelt(x, i)

       setelt!(x : %, i : I, s : S) ==
         i < mn or i > maxIndex(x) => error "index out of range"
         qsetelt!(x, i, s)

)abbrev domain ARRAY1 OneDimensionalArray
++ Description: This is the domain of 1-based one dimensional arrays.

OneDimensionalArray(S : Type) : Exports == Implementation where
  ARRAYMININDEX ==> 1       -- if you want to change this, be my guest
  Exports == OneDimensionalArrayAggregate S with
    oneDimensionalArray : List S -> %
        ++ oneDimensionalArray(l) creates an array from a list of elements l
    oneDimensionalArray : (NonNegativeInteger, S) -> %
        ++ oneDimensionalArray(n, s) creates an array from n copies of element s
  Implementation == IndexedOneDimensionalArray(S, ARRAYMININDEX) add

    -- qelt and qsetelt! are logically unnecessary, but good for
    -- performance
    Qelt1 ==> QAREF1O$Lisp
    Qsetelt1 ==> QSETAREF1O$Lisp

    qelt(x, i) == Qelt1(x, i, ARRAYMININDEX)
    qsetelt!(x, i, s) == Qsetelt1(x, i, s, ARRAYMININDEX)

    oneDimensionalArray(u) ==
      n := #u
      n = 0 => empty()
      a := new(n, first u)
      for i in 2..n for x in rest u repeat a.i := x
      a
    oneDimensionalArray(n, s) == new(n, s)

)abbrev package ARRAY12 OneDimensionalArrayFunctions2
++ Description: This package provides tools for operating on one-dimensional
++ arrays with unary and binary functions involving different underlying types.
OneDimensionalArrayFunctions2(A, B) : Exports == Implementation where
  A, B : Type

  VA ==> OneDimensionalArray A
  VB ==> OneDimensionalArray B
  O2 ==> FiniteLinearAggregateFunctions2(A, VA, B, VB)

  Exports ==> with
    scan   : ((A, B) -> B, VA, B) -> VB
        ++ scan(f, a, r) successively applies
        ++ \spad{reduce(f, x, r)} to more and more leading sub-arrays
        ++ x of one-dimensional array \spad{a}.
        ++ More precisely, if \spad{a} is \spad{[a1, a2, ...]}, then
        ++ \spad{scan(f, a, r)} returns
        ++ \spad{[reduce(f, [a1], r), reduce(f, [a1, a2], r), ...]}.
    reduce : ((A, B) -> B, VA, B) -> B
        ++ reduce(f, a, r) applies function f to each
        ++ successive element of the
        ++ one-dimensional array \spad{a} and an accumulant initialized to r.
        ++ For example,
        ++ \spad{reduce(_+$Integer, [1, 2, 3], 0)}
        ++ does \spad{3+(2+(1+0))}. Note: third argument r
        ++ may be regarded as the
        ++ identity element for the function f.
    map    : (A -> B, VA) -> VB
        ++ map(f, a) applies function f to each member of one-dimensional array
        ++ \spad{a} resulting in a new one-dimensional array over a
        ++ possibly different underlying domain.

  Implementation ==> add
    map(f, v)       == map(f, v)$O2
    scan(f, v, b)   == scan(f, v, b)$O2
    reduce(f, v, b) == reduce(f, v, b)$O2

--Copyright (c) 1991-2002, The Numerical ALgorithms Group Ltd.
--All rights reserved.
--
--Redistribution and use in source and binary forms, with or without
--modification, are permitted provided that the following conditions are
--met:
--
--    - Redistributions of source code must retain the above copyright
--      notice, this list of conditions and the following disclaimer.
--
--    - Redistributions in binary form must reproduce the above copyright
--      notice, this list of conditions and the following disclaimer in
--      the documentation and/or other materials provided with the
--      distribution.
--
--    - Neither the name of The Numerical ALgorithms Group Ltd. nor the
--      names of its contributors may be used to endorse or promote products
--      derived from this software without specific prior written permission.
--
--THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
--IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
--TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
--PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
--OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
--EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
--PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
--PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
--LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
--NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
--SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.


--%% TupleFunctions2
--TupleFunctions2(A: Type, B: Type): with
--  map: (A -> B, Tuple A) -> Tuple B
-- == add
--  map(f, t) ==
--    p: PrimitiveArray(B) := new length t
--    for i in minIndex p .. maxIndex p repeat
--      p.i := f select(t, i)
--    p::Tuple(B)
