|
5164
|
1 /* |
|
|
2 |
|
7017
|
3 Copyright (C) 2004, 2005, 2006, 2007 David Bateman |
|
7016
|
4 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004 Andy Adler |
|
|
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 #ifdef HAVE_CONFIG_H |
|
|
25 #include <config.h> |
|
|
26 #endif |
|
|
27 |
|
|
28 #include <cassert> |
|
7048
|
29 #include <cstring> |
|
5164
|
30 |
|
|
31 #include "oct-sort.cc" |
|
|
32 #include "quit.h" |
|
|
33 |
|
|
34 #include "sparse-sort.h" |
|
|
35 |
|
|
36 // A simple class and instantiation of the octave merge sort class |
|
|
37 // to sort sparse data before matrix creation. This is significantly |
|
|
38 // faster than using octave_qsort. |
|
|
39 |
|
|
40 bool |
|
|
41 octave_sparse_sidxl_comp (octave_sparse_sort_idxl* i, |
|
|
42 octave_sparse_sort_idxl* j) |
|
|
43 { |
|
5603
|
44 octave_idx_type tmp = i->c - j->c; |
|
5164
|
45 if (tmp < 0) |
|
|
46 return true; |
|
|
47 else if (tmp > 0) |
|
|
48 return false; |
|
|
49 return (i->r < j->r); |
|
|
50 } |
|
|
51 |
|
5603
|
52 // Need to know the original order of the sorted indexes in |
|
|
53 // sparse assignments, and this class does that |
|
|
54 bool |
|
|
55 octave_idx_vector_comp (octave_idx_vector_sort* i, |
|
|
56 octave_idx_vector_sort* j) |
|
|
57 { |
|
|
58 return (i->i < j->i); |
|
|
59 } |
|
|
60 |
|
5164
|
61 /* |
|
|
62 ;;; Local Variables: *** |
|
|
63 ;;; mode: C++ *** |
|
|
64 ;;; End: *** |
|
|
65 */ |
