1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63
|
/*
Copyright (C) 2004-2015 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/>.
*/
#ifdef 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 *>;
|