|
1
|
1 // Very simple integer vectors for indexing -*- C++ -*- |
|
|
2 /* |
|
|
3 |
|
|
4 Copyright (C) 1992, 1993 John W. Eaton |
|
|
5 |
|
|
6 This file is part of Octave. |
|
|
7 |
|
|
8 Octave is free software; you can redistribute it and/or modify it |
|
|
9 under the terms of the GNU General Public License as published by the |
|
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
|
11 later version. |
|
|
12 |
|
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 for more details. |
|
|
17 |
|
|
18 You should have received a copy of the GNU General Public License |
|
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
|
20 Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #if !defined (_idx_vector_h) |
|
|
25 #define _idx_vector_h 1 |
|
|
26 |
|
|
27 #ifdef __GNUG__ |
|
|
28 #pragma interface |
|
|
29 #endif |
|
|
30 |
|
|
31 #include <stdlib.h> |
|
|
32 #include <assert.h> |
|
|
33 #include <iostream.h> |
|
|
34 #include "Matrix.h" |
|
|
35 #include "Range.h" |
|
|
36 |
|
|
37 #define FAIL assert(0) /* XXX FIXME XXX */ |
|
|
38 |
|
|
39 class idx_vector |
|
|
40 { |
|
|
41 public: |
|
|
42 idx_vector (void); |
|
|
43 idx_vector (const idx_vector& a); |
|
|
44 |
|
|
45 idx_vector (Matrix& m, int do_ftn_idx, char *rc = (char *) NULL, |
|
|
46 int z_len = 0); |
|
|
47 |
|
|
48 idx_vector (const Range& r); |
|
|
49 |
|
|
50 ~idx_vector (void); |
|
|
51 |
|
|
52 idx_vector& operator = (const idx_vector& a); |
|
|
53 |
|
|
54 int capacity (void) const; |
|
|
55 int length (void) const; |
|
|
56 |
|
|
57 int elem (int n) const; |
|
|
58 int checkelem (int n) const; |
|
|
59 int operator () (int n) const; |
|
|
60 |
|
|
61 // other stuff |
|
|
62 |
|
|
63 int max (void) const; |
|
|
64 int min (void) const; |
|
|
65 |
|
|
66 int one_zero_only (void) const; |
|
|
67 int zeros_count (void) const; |
|
|
68 int ones_count (void) const; |
|
|
69 |
|
|
70 // i/o |
|
|
71 |
|
|
72 friend ostream& operator << (ostream& os, const idx_vector& a); |
|
|
73 |
|
|
74 private: |
|
|
75 |
|
|
76 int len; |
|
|
77 int one_zero; |
|
|
78 int num_zeros; |
|
|
79 int num_ones; |
|
|
80 int max_val; |
|
|
81 int min_val; |
|
|
82 int *data; |
|
|
83 |
|
|
84 void init_state (char *rc = (char *) NULL, int z_len = 0); |
|
|
85 void convert_one_zero_to_idx (void); |
|
|
86 }; |
|
|
87 |
|
|
88 inline idx_vector::idx_vector (void) |
|
|
89 { |
|
|
90 len = 0; |
|
|
91 data = 0; |
|
|
92 num_zeros = 0; |
|
|
93 num_ones = 0; |
|
|
94 one_zero = 0; |
|
|
95 } |
|
|
96 |
|
|
97 inline idx_vector::~idx_vector (void) |
|
|
98 { |
|
|
99 delete [] data; |
|
|
100 data = 0; |
|
|
101 num_zeros = 0; |
|
|
102 num_ones = 0; |
|
|
103 len = 0; |
|
|
104 one_zero = 0; |
|
|
105 } |
|
|
106 |
|
|
107 inline int idx_vector::capacity (void) const { return len; } |
|
|
108 inline int idx_vector::length (void) const { return len; } |
|
|
109 |
|
|
110 inline int idx_vector::elem (int n) const { return data[n]; } |
|
|
111 |
|
|
112 inline int |
|
|
113 idx_vector::checkelem (int n) const |
|
|
114 { |
|
|
115 if (n < 0 || n >= len) |
|
|
116 FAIL; |
|
|
117 |
|
|
118 return elem (n); |
|
|
119 } |
|
|
120 |
|
|
121 inline int idx_vector::operator () (int n) const { return checkelem (n); } |
|
|
122 |
|
|
123 inline int idx_vector::max (void) const { return max_val; } |
|
|
124 inline int idx_vector::min (void) const { return min_val; } |
|
|
125 |
|
|
126 inline int idx_vector::one_zero_only (void) const { return one_zero; } |
|
|
127 inline int idx_vector::zeros_count (void) const { return num_zeros; } |
|
|
128 inline int idx_vector::ones_count (void) const { return num_ones; } |
|
|
129 |
|
|
130 #endif |
|
|
131 |
|
|
132 /* |
|
|
133 ;;; Local Variables: *** |
|
|
134 ;;; mode: C++ *** |
|
|
135 ;;; page-delimiter: "^/\\*" *** |
|
|
136 ;;; End: *** |
|
|
137 */ |
