Mercurial > octave
view liboctave/util/sparse-sort.cc @ 23084:ef4d915df748
maint: Merge stable to default.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Mon, 23 Jan 2017 14:27:48 -0500 |
parents | 3a2b891d0b33 e9a0469dedd9 |
children | 092078913d54 |
line wrap: on
line source
/* Copyright (C) 2004-2016 David Bateman Copyright (C) 1998-2004 Andy Adler This file is part of Octave. Octave is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. Octave is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Octave; see the file COPYING. If not, see <http://www.gnu.org/licenses/>. */ #if defined (HAVE_CONFIG_H) # include "config.h" #endif #include <cassert> #include <cstring> #include "oct-sort.cc" #include "quit.h" #include "sparse-sort.h" // A simple class and instantiation of the octave merge sort class // to sort sparse data before matrix creation. This is significantly // faster than using octave_qsort. bool octave_sparse_sidxl_comp (octave_sparse_sort_idxl* i, octave_sparse_sort_idxl* j) { octave_idx_type tmp = i->c - j->c; if (tmp < 0) return true; else if (tmp > 0) return false; return (i->r < j->r); } template class octave_sort<octave_sparse_sort_idxl *>; // Need to know the original order of the sorted indexes in // sparse assignments, and this class does that bool octave_idx_vector_comp (octave_idx_vector_sort* i, octave_idx_vector_sort* j) { return (i->i < j->i); } template class octave_sort<octave_idx_vector_sort *>;