Mercurial > hg > octave-nkf
annotate liboctave/boolSparse.h @ 14626:f947d2922feb stable rc-3-6-2-0
3.6.2-rc0 release candidate
* configure.ac (AC_INIT): Version is now 3.6.2-rc0.
(OCTAVE_RELEASE_DATE): Now 2012-05-11.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Fri, 11 May 2012 13:46:18 -0400 |
parents | 72c96de7a403 |
children |
rev | line source |
---|---|
5164 | 1 /* |
2 | |
14138
72c96de7a403
maint: update copyright notices for 2012
John W. Eaton <jwe@octave.org>
parents:
13030
diff
changeset
|
3 Copyright (C) 2004-2012 David Bateman |
11523 | 4 Copyright (C) 1998-2004 Andy Adler |
7016 | 5 |
6 This file is part of Octave. | |
5164 | 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 | |
7016 | 10 Free Software Foundation; either version 3 of the License, or (at your |
11 option) any later version. | |
5164 | 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 | |
7016 | 19 along with Octave; see the file COPYING. If not, see |
20 <http://www.gnu.org/licenses/>. | |
5164 | 21 |
22 */ | |
23 | |
24 #if !defined (octave_boolSparse_h) | |
25 #define octave_boolSparse_h 1 | |
26 | |
27 #include "Sparse.h" | |
28 #include "MSparse-defs.h" | |
29 #include "Sparse-op-defs.h" | |
30 | |
10983
4b51c0a20a98
optimize sum of sparse logical matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
10527
diff
changeset
|
31 class SparseMatrix; |
4b51c0a20a98
optimize sum of sparse logical matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
10527
diff
changeset
|
32 |
5164 | 33 class |
6108 | 34 OCTAVE_API |
5164 | 35 SparseBoolMatrix : public Sparse<bool> |
36 { | |
37 public: | |
38 | |
39 SparseBoolMatrix (void) : Sparse<bool> () { } | |
40 | |
5275 | 41 SparseBoolMatrix (octave_idx_type r, octave_idx_type c) : Sparse<bool> (r, c) { } |
5164 | 42 |
11586
12df7854fa7c
strip trailing whitespace from source files
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
43 explicit SparseBoolMatrix (octave_idx_type r, octave_idx_type c, bool val) |
5164 | 44 : Sparse<bool> (r, c, val) { } |
45 | |
11586
12df7854fa7c
strip trailing whitespace from source files
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
46 SparseBoolMatrix (const dim_vector& dv, octave_idx_type nz = 0) : |
6823 | 47 Sparse<bool> (dv, nz) { } |
48 | |
5164 | 49 SparseBoolMatrix (const Sparse<bool>& a) : Sparse<bool> (a) { } |
50 | |
51 SparseBoolMatrix (const SparseBoolMatrix& a) : Sparse<bool> (a) { } | |
52 | |
11586
12df7854fa7c
strip trailing whitespace from source files
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
53 SparseBoolMatrix (const SparseBoolMatrix& a, const dim_vector& dv) |
5164 | 54 : Sparse<bool> (a, dv) { } |
55 | |
56 explicit SparseBoolMatrix (const boolMatrix& a) : Sparse<bool> (a) { } | |
57 | |
58 explicit SparseBoolMatrix (const boolNDArray& a) : Sparse<bool> (a) { } | |
59 | |
13030
b646413c3d0e
Make operators do smarter sparse conversions on permutation matrices.
Jordi Gutiérrez Hermoso <jordigh@gmail.com>
parents:
11586
diff
changeset
|
60 explicit SparseBoolMatrix (const PermMatrix& a) : Sparse<bool> (a) { }; |
b646413c3d0e
Make operators do smarter sparse conversions on permutation matrices.
Jordi Gutiérrez Hermoso <jordigh@gmail.com>
parents:
11586
diff
changeset
|
61 |
11586
12df7854fa7c
strip trailing whitespace from source files
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
62 SparseBoolMatrix (const Array<bool>& a, const idx_vector& r, |
12df7854fa7c
strip trailing whitespace from source files
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
63 const idx_vector& c, octave_idx_type nr = -1, |
10527
b4d2080b6df7
Replace nzmax by nnz as needed
David Bateman <dbateman@free.fr>
parents:
10480
diff
changeset
|
64 octave_idx_type nc = -1, bool sum_terms = true, |
b4d2080b6df7
Replace nzmax by nnz as needed
David Bateman <dbateman@free.fr>
parents:
10480
diff
changeset
|
65 octave_idx_type nzm = -1) |
b4d2080b6df7
Replace nzmax by nnz as needed
David Bateman <dbateman@free.fr>
parents:
10480
diff
changeset
|
66 : Sparse<bool> (a, r, c, nr, nc, sum_terms, nzm) { } |
10479
ded9beac7582
optimize sparse matrix assembly
Jaroslav Hajek <highegg@gmail.com>
parents:
10421
diff
changeset
|
67 |
5275 | 68 SparseBoolMatrix (octave_idx_type r, octave_idx_type c, octave_idx_type num_nz) : Sparse<bool> (r, c, num_nz) { } |
5164 | 69 |
70 SparseBoolMatrix& operator = (const SparseBoolMatrix& a) | |
71 { | |
72 Sparse<bool>::operator = (a); | |
73 return *this; | |
74 } | |
75 | |
76 bool operator == (const SparseBoolMatrix& a) const; | |
77 bool operator != (const SparseBoolMatrix& a) const; | |
78 | |
11586
12df7854fa7c
strip trailing whitespace from source files
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
79 SparseBoolMatrix transpose (void) const |
5164 | 80 { return Sparse<bool>::transpose (); } |
81 | |
82 // destructive insert/delete/reorder operations | |
83 | |
5275 | 84 SparseBoolMatrix& insert (const SparseBoolMatrix& a, octave_idx_type r, octave_idx_type c); |
5164 | 85 |
6823 | 86 SparseBoolMatrix& insert (const SparseBoolMatrix& a, const Array<octave_idx_type>& indx); |
87 | |
11586
12df7854fa7c
strip trailing whitespace from source files
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
88 SparseBoolMatrix concat (const SparseBoolMatrix& rb, |
10312
cbc402e64d83
untabify liboctave header files
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
89 const Array<octave_idx_type>& ra_idx); |
5164 | 90 |
7515
f3c00dc0912b
Eliminate the rest of the dispatched sparse functions
David Bateman <dbateman@free.fr>
parents:
7017
diff
changeset
|
91 SparseBoolMatrix diag (octave_idx_type k = 0) const; |
f3c00dc0912b
Eliminate the rest of the dispatched sparse functions
David Bateman <dbateman@free.fr>
parents:
7017
diff
changeset
|
92 |
5164 | 93 boolMatrix matrix_value (void) const; |
94 | |
95 SparseBoolMatrix squeeze (void) const; | |
96 | |
10421
99e9bae2d81e
improve sparse indexing interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10312
diff
changeset
|
97 SparseBoolMatrix index (const idx_vector& i, bool resize_ok) const; |
5164 | 98 |
10421
99e9bae2d81e
improve sparse indexing interface
Jaroslav Hajek <highegg@gmail.com>
parents:
10312
diff
changeset
|
99 SparseBoolMatrix index (const idx_vector& i, const idx_vector& j, bool resize_ok) const; |
5164 | 100 |
101 SparseBoolMatrix reshape (const dim_vector& new_dims) const; | |
102 | |
5275 | 103 SparseBoolMatrix permute (const Array<octave_idx_type>& vec, bool inv = false) const; |
5164 | 104 |
5275 | 105 SparseBoolMatrix ipermute (const Array<octave_idx_type>& vec) const; |
5164 | 106 |
107 // unary operations | |
108 | |
109 SparseBoolMatrix operator ! (void) const; | |
110 | |
111 // other operations | |
112 | |
113 SparseBoolMatrix all (int dim = -1) const; | |
114 SparseBoolMatrix any (int dim = -1) const; | |
10983
4b51c0a20a98
optimize sum of sparse logical matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
10527
diff
changeset
|
115 SparseMatrix sum (int dim = -1) const; |
5164 | 116 |
117 // i/o | |
118 | |
6108 | 119 friend OCTAVE_API std::ostream& operator << (std::ostream& os, const SparseBoolMatrix& a); |
120 friend OCTAVE_API std::istream& operator >> (std::istream& is, SparseBoolMatrix& a); | |
5164 | 121 }; |
122 | |
6708 | 123 SPARSE_SMS_EQNE_OP_DECLS (SparseBoolMatrix, bool, OCTAVE_API) |
124 SPARSE_SMS_BOOL_OP_DECLS (SparseBoolMatrix, bool, OCTAVE_API) | |
5164 | 125 |
6708 | 126 SPARSE_SSM_EQNE_OP_DECLS (bool, SparseBoolMatrix, OCTAVE_API) |
127 SPARSE_SSM_BOOL_OP_DECLS (bool, SparseBoolMatrix, OCTAVE_API) | |
5164 | 128 |
6708 | 129 SPARSE_SMSM_EQNE_OP_DECLS (SparseBoolMatrix, SparseBoolMatrix, OCTAVE_API) |
130 SPARSE_SMSM_BOOL_OP_DECLS (SparseBoolMatrix, SparseBoolMatrix, OCTAVE_API) | |
5164 | 131 |
132 #endif |