Mercurial > hg > octave-lyh
comparison liboctave/sparse-sort.cc @ 8752:06b9903a029b
fix & clean up complex & sparse sorting
author | Jaroslav Hajek <highegg@gmail.com> |
---|---|
date | Mon, 16 Feb 2009 10:15:43 +0100 |
parents | ada435261879 |
children | eb63fbe60fab |
comparison
equal
deleted
inserted
replaced
8751:9f7ce4bf7650 | 8752:06b9903a029b |
---|---|
47 else if (tmp > 0) | 47 else if (tmp > 0) |
48 return false; | 48 return false; |
49 return (i->r < j->r); | 49 return (i->r < j->r); |
50 } | 50 } |
51 | 51 |
52 template class octave_sort<octave_sparse_sort_idxl *>; | |
53 | |
52 // Need to know the original order of the sorted indexes in | 54 // Need to know the original order of the sorted indexes in |
53 // sparse assignments, and this class does that | 55 // sparse assignments, and this class does that |
54 bool | 56 bool |
55 octave_idx_vector_comp (octave_idx_vector_sort* i, | 57 octave_idx_vector_comp (octave_idx_vector_sort* i, |
56 octave_idx_vector_sort* j) | 58 octave_idx_vector_sort* j) |
57 { | 59 { |
58 return (i->i < j->i); | 60 return (i->i < j->i); |
59 } | 61 } |
60 | 62 |
63 template class octave_sort<octave_idx_vector_sort *>; | |
64 | |
61 /* | 65 /* |
62 ;;; Local Variables: *** | 66 ;;; Local Variables: *** |
63 ;;; mode: C++ *** | 67 ;;; mode: C++ *** |
64 ;;; End: *** | 68 ;;; End: *** |
65 */ | 69 */ |