2
** This program and library is free software; you can redistribute it and/or
3
** modify it under the terms of the GNU (Library) General Public License
4
** as published by the Free Software Foundation; either version 2
5
** of the License, or any later version.
7
** This program is distributed in the hope that it will be useful,
8
** but WITHOUT ANY WARRANTY; without even the implied warranty of
9
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10
** GNU (Library) General Public License for more details.
12
** You should have received a copy of the GNU (Library) General Public License
13
** along with this program; if not, write to the Free Software
14
** Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
4
$Id: array.c,v 1.13 2005/05/12 15:41:04 karman Exp $
6
This file is part of Swish-e.
8
Swish-e is free software; you can redistribute it and/or modify
9
it under the terms of the GNU General Public License as published by
10
the Free Software Foundation; either version 2 of the License, or
11
(at your option) any later version.
13
Swish-e is distributed in the hope that it will be useful,
14
but WITHOUT ANY WARRANTY; without even the implied warranty of
15
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16
GNU General Public License for more details.
18
You should have received a copy of the GNU General Public License
19
along with Swish-e; if not, write to the Free Software
20
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22
See the COPYING file that accompanies the Swish-e distribution for details
23
of the GNU GPL and the special exception available for linking against
26
** Mon May 9 17:58:02 CDT 2005
15
29
**-----------------------------------------------------------------
17
31
** Virtual Array Code.
19
33
** elemnts of arrays of long numbers avoiding the
20
34
** allocation in memory of the total array. In other words,
21
35
** if we need to read only 10 elements of the array, we
22
** will must try to make the minimal I/O memory and disk
36
** will must try to make the minimal I/O memory and disk
25
39
** To do that, the data is stored in aligned pages in disk