Prolog-Arrays

Multi-dimensional, dynamic, logical arrays with logarithmic complexity indexing, implemented in ISO Prolog.

Version of 2022/04/24

https://github.com/plazajan

Copyright 1988-2023, Jan A. Plaza

This file is part of Prolog-Arrays. Prolog-Arrays 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 3 of the License, or (at your option) any later version. Prolog-Arrays 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 Prolog-Arrays. If not, see https://www.gnu.org/licenses/.

---

Arrays implemented in Prolog

We define multi-dimensional, dynamic, logical arrays with logarithmic indexing. The implementation uses only standard featues of Prolog (ISO Prolog).

By an array we mean an indexed container, not for a block of memory. The arrays are tree-like terms which are manipulated by Prolog procedures.

Places in a K-dimensional array are indexed by K-tuples of indices, i.e. lists of natural numbers. Indexing is zero-based. One does not declare the size of an array; arbitrarily large indices are allowed - this is why these arrays are called dynamic. The array grows as needed, however without reallocating memory. The arrays, like Prolog's variables, are local to procedures and admit only the usual logical assignment - incremental assignment (by unification) that can be undone by backtracking; this is why they are called logical.

An empty place in an array is represented by a variable. If such a variable is unified with a term, the term is stored in the array. If a term T1 is put in a place where T2 is stored, T1 and T2 are pseudo-unified (T1=T2) and the result is stored in the array. If T1 and T2 do not pseudo-unify the procedure fails. Backtracking can undo the pseudo-unification.

Once an element is put into an array it can be read but it can not be removed (except by backtracking). Instead of removing an element e1 and putting a new one e2 in its place, one can store terms like [e1|X] and then modify X, e.g. X=[e2|X1], etc. Another possibility is to replace the entire array by a new one like the original one except that the element in question is replaced by another; a suitable procedure is provided.

One cannot distinguish between an empty place in an array and a place in which a variable is stored; therefore to store a variable, say V, it is better to store a term that contains the variable, say [V].

In the implementation, the effect of multiple dimensions is obtained by storing one-dimensional arrays in one-dimensional arrays in one-dimensional arrays, etc. E.g. the goal

getFromArray(Array3,[7,11],X) 

is equivalent to

getFromArray(Array3,[7],AuxArray), getFromArray(AuxArray,[11],X)

One does not declare the number of dimensions of an array but it is determined by the length of the index list.

The access time to the N-th place of a one-dimensional array is of the order logN (for all the procedures below except changeArray and genArrayMembers). The arrays are dynamic data structures; the amount of space they occupy in the memory increases with the number of elements stored. An one-dimensional array that stores only one item, at index N, uses auxiliary space of the order logN. A one-dimnsional array that stores items at indices 0..N only uses auxilairy space of the order N, not counting the space used by the itmes. (This asymptotic estimate is the same as for the auxilary space taken by a list with N elements.)

The following predicates are defined.

(1)  putIntoArray(Array, Position, Element)

Arguments:
Array - a term representing array (initially a variable).
Position - a non-empty list of natural numbers (>=0).
Element - a term (typically an atom but variables and open terms are allowed).

Result:
Element is pseudo-unified with the term stored at the Position or with the variable representing this place if the place is empty. If the terms do not unify the procedure fails. Array becomes a term representing the initial array with the result of pseudo-unification stored at the position Position.

Backtracking:
The second call fails.

(2)  putIntoArrayM(Array, Position, Element)    

exactly like putIntoArray(Array, Position, Element) except that the following messages are supplied for the purpose of debugging:
"ERROR! Incorrect specification of the position Position. putIntoArrayM failed."
"The element put in the position Position is not pseudo-unifiable with the element stored. putIntoArrayM failed."

(3)  getFromArray(Array, Position, Element)  

Arguments:
Array - a term representing array.
Position - a non-empty list of natural numbers (>=0).
Element - a term (typically a variable).

Result:
Element is pseudo-unified with the term stored at the Position. If terms do not unify the procedure fails. If this place is empty or there is only a variable the procedure fails.

Backtracking:
The second call fails.

(4)  changeArray(Array, Position, NewElement, NewArray)  

Arguments:
Array - a term representing array.
Position - a non-empty list of natural numbers (>=0).
NewElement - a term (typically atom but variables and open terms are allowed).
NewArray - a variable.

Result:
NewArray becomes a term representing the array containing the
elements of Array except Position, where NewElement is stored. Array and NewArray have a large part of their structure in common; therefore it is advised not to use Array after NewArray is obtained - some changes made to Array may cause changes to NewArray, some others need not.

Backtracking:
The second call fails.

(5)  lastInArray(Array, Position, Element)  

Arguments:
Array - a term representing array.
Position - a non-empty list of variables.
Element - a term (typically a variable).

Result:
Variables of the list Position are instantiated to the indices of the place in Array which contains a non-variable and is last in the lexicographical order. If there are no non-variables in the array the procedure fails. Element is pseudo-unified with the term stored at this place. If the
terms do not unify the procedure fails.

Backtracking:
The second call fails.

(6)  genArrayMembers(Array, Position, Element)  

Arguments:
Array - a term representing array.
Position - a non-empty list of variables.
Element - a variable.

Result:
Variables of the list Position are instantiated to the indices of the place in Array which contains a non-variable and is first in the lexicographical order. If there are no non-variables in the array the procedure fails. Element is instantiated to the term stored at this place.

Backtracking:
Every next call returns the lexicographically next non-variable element and its position.

The following terms are used to represent arrays:

* ------- * ------- * ------- * ------- ...
|         |         |         |
0         #         #         #
         / \       / \       / \
         1-5      #...#      ...  
                 / \   \
                6- 10...30

where each * is a cons cell and each # consists of four cons cells representing [X1, X2, X3, X4 | X5]. Do not think about this as a list with the rest X5; it is just a way to store five items. When this implementation was deveoped, using four cons cells was slightly more efficient than using user-defined function symbol of arity 5. (Comments welcome.)

The trees built of #'s are of rank (branching factor) 5. One can modify the construction changing the rank to any k >= 2. In such an implementation, the time to put an element in the Nth place of an array can be bounded by (c1*k+c2)log N where the base of the logarithm is k, and where c1, c2 are constants that depend on the platform. According to tests, in the 1988 LPA Prolog 2.0w on a Mac Plus, rank 5 is the most efficient while using indices from 0 to around 100. If one is going to use indices that are many orders bigger it may be better to change the rank to a bigger value. If lists are implemented in a standard way the choice of the rank does not affect the asymptotic estimate of the auxiliary space used by the array. (Comments welcome.)

A major characteristic of Prolog is that of a logical variable, i.e. a local variable with a nondestructive, incremental assignment that can be undone by backtracking. The implementation below shares these features.

Modern implementations of Prolog provide some versions of arrays. There are global arrays in GNU Prolog, and in SWI Prolog arrays can be simulated by setarg or nb_setarg; while these arrays are of arbitrary fixed size, our arrays grow dynamically.

The code has been tested in SWI Prolog 8.4.2 and GNU Prolog 1.5.0, in 2022.

---