Mercurial > hg > octave-lyh

comparison liboctave/idx-vector.h @ 3079:eb827eb9b8ff

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
[project @ 1997-08-03 20:44:07 by jwe]
author jwe
date Sun, 03 Aug 1997 20:46:29 +0000
parents 8b262e771614
children 0d640dc625c7
comparison
equal deleted inserted replaced
3078:5e4b19abfeb1 3079:eb827eb9b8ff
96 int zeros_count (void) const { return num_zeros; } 96 int zeros_count (void) const { return num_zeros; }
97 int ones_count (void) const { return num_ones; } 97 int ones_count (void) const { return num_ones; }
98 98
99 int is_colon (void) const { return colon; } 99 int is_colon (void) const { return colon; }
100 int is_colon_equiv (int n, int sort_uniq); 100 int is_colon_equiv (int n, int sort_uniq);
101
102 void sort (bool uniq);
101 103
102 int orig_rows (void) const { return orig_nr; } 104 int orig_rows (void) const { return orig_nr; }
103 int orig_columns (void) const { return orig_nc; } 105 int orig_columns (void) const { return orig_nc; }
104 106
105 // other stuff 107 // other stuff
229 231
230 int is_colon (void) const { return rep->is_colon (); } 232 int is_colon (void) const { return rep->is_colon (); }
231 int is_colon_equiv (int n, int sort_uniq = 0) const 233 int is_colon_equiv (int n, int sort_uniq = 0) const
232 { return rep->is_colon_equiv (n, sort_uniq); } 234 { return rep->is_colon_equiv (n, sort_uniq); }
233 235
236 void sort (bool uniq = false) { rep->sort (uniq); }
237
234 int orig_rows (void) const { return rep->orig_rows (); } 238 int orig_rows (void) const { return rep->orig_rows (); }
235 int orig_columns (void) const { return rep->orig_columns (); } 239 int orig_columns (void) const { return rep->orig_columns (); }
236 240
237 int orig_empty (void) const 241 int orig_empty (void) const
238 { 242 {