File: array.C

package info (click to toggle)
mixviews 1.20-10.1
  • links: PTS
  • area: main
  • in suites: potato
  • size: 2,928 kB
  • ctags: 5,960
  • sloc: cpp: 32,879; ansic: 2,110; makefile: 445; sh: 17
file content (96 lines) | stat: -rw-r--r-- 2,764 bytes parent folder | download | duplicates (4)
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
90
91
92
93
94
95
96
// array.c

/******************************************************************************
 *
 *  MiXViews - an X window system based sound & data editor/processor
 *
 *  Copyright (c) 1993, 1994 Regents of the University of California
 *
 *  Author:     Douglas Scott
 *  Date:       December 13, 1994
 *
 *  Permission to use, copy and modify this software and its documentation
 *  for research and/or educational purposes and without fee is hereby granted,
 *  provided that the above copyright notice appear in all copies and that
 *  both that copyright notice and this permission notice appear in
 *  supporting documentation. The author reserves the right to distribute this
 *  software and its documentation.  The University of California and the author
 *  make no representations about the suitability of this software for any 
 *  purpose, and in no event shall University of California be liable for any
 *  damage, loss of data, or profits resulting from its use.
 *  It is provided "as is" without express or implied warranty.
 *
 ******************************************************************************/

#ifdef __GNUG__
#pragma implementation
#endif
#include "localdefs.h"
#include "array.h"

template <class T>
Array<T>::Array(int cols) : columns(cols) {
	array = new T[cols];
	T temp = 0;
	for(int i=0; i < columns; i++)
		array[i] = temp;
}

template <class T>
const Array<T> &
Array<T>::operator = (const Array<T>& rhs) {
	for(int i=0; i < columns && i < rhs.columns; i++)
		array[i] = rhs.array[i];
	return *this;
}

template <class T>
void
Array<T>::shiftLeft(int spaces) {
	register T *dest = array, *src = array + spaces - 1;
	register T* endPoint = array + columns;
	while(src < endPoint) { *dest++ = *src++; }
}

template <class T>
void
Array<T>::shiftRight(int spaces) {
	register T *dest = array + spaces - 1, *src = array;
	register T* endPoint = array + columns;
	while(dest < endPoint) { *dest++ = *src++; }
}

#if 0

TwoDimensionalArray::TwoDimensionalArray(int rws, int cols) : rows(rws) {
	arrays = new Array *[cols];
	for(int i = 0; i < rows; i++)
		arrays[i] = new Array(cols);
}

TwoDimensionalArray::~TwoDimensionalArray() {
	for(int i = 0; i < rows; i++)
		delete arrays[i];
	delete [] arrays;
}

const TwoDimensionalArray&
TwoDimensionalArray::operator = (const TwoDimensionalArray& rhs) {
	for(int i=0; i < rows && i < rhs.rows; i++)
		*arrays[i] = *rhs.arrays[i];
	return *this;
}

#endif

double **
create2DArray(int rows, int cols) {
	int ptrspace = rows * sizeof(double*);
	int rowspace = rows * sizeof(double);
	addr ptr = new char[(cols*rowspace) + ptrspace];
	double** arr = (double**) ptr;
	for(int row=0; row < rows; row++) {
		arr[row] = (double *) (ptr + ptrspace + (rowspace * row));
	}
	return arr;
}