186 lines
6.3 KiB
C
186 lines
6.3 KiB
C
|
/* spmatrix/gsl_spmatrix_short.h
|
||
|
|
*
|
||
|
|
* Copyright (C) 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020 Patrick Alken
|
||
|
|
*
|
||
|
|
* This program 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.
|
||
|
|
*
|
||
|
|
* This program 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 this program; if not, write to the Free Software
|
||
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef __GSL_SPMATRIX_SHORT_H__
|
||
|
|
#define __GSL_SPMATRIX_SHORT_H__
|
||
|
|
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <gsl/gsl_math.h>
|
||
|
|
#include <gsl/gsl_bst.h>
|
||
|
|
#include <gsl/gsl_vector_short.h>
|
||
|
|
#include <gsl/gsl_matrix_short.h>
|
||
|
|
|
||
|
|
#undef __BEGIN_DECLS
|
||
|
|
#undef __END_DECLS
|
||
|
|
#ifdef __cplusplus
|
||
|
|
# define __BEGIN_DECLS extern "C" {
|
||
|
|
# define __END_DECLS }
|
||
|
|
#else
|
||
|
|
# define __BEGIN_DECLS /* empty */
|
||
|
|
# define __END_DECLS /* empty */
|
||
|
|
#endif
|
||
|
|
|
||
|
|
__BEGIN_DECLS
|
||
|
|
|
||
|
|
/*
|
||
|
|
* COO format:
|
||
|
|
*
|
||
|
|
* If data[n] = A_{ij}, then:
|
||
|
|
* i = A->i[n]
|
||
|
|
* j = A->p[n]
|
||
|
|
*
|
||
|
|
* Compressed column format (CSC):
|
||
|
|
*
|
||
|
|
* If data[n] = A_{ij}, then:
|
||
|
|
* i = A->i[n]
|
||
|
|
* A->p[j] <= n < A->p[j+1]
|
||
|
|
* so that column j is stored in
|
||
|
|
* [ data[p[j]], data[p[j] + 1], ..., data[p[j+1] - 1] ]
|
||
|
|
*
|
||
|
|
* Compressed row format (CSR):
|
||
|
|
*
|
||
|
|
* If data[n] = A_{ij}, then:
|
||
|
|
* j = A->i[n]
|
||
|
|
* A->p[i] <= n < A->p[i+1]
|
||
|
|
* so that row i is stored in
|
||
|
|
* [ data[p[i]], data[p[i] + 1], ..., data[p[i+1] - 1] ]
|
||
|
|
*/
|
||
|
|
|
||
|
|
typedef struct
|
||
|
|
{
|
||
|
|
size_t size1; /* number of rows */
|
||
|
|
size_t size2; /* number of columns */
|
||
|
|
|
||
|
|
/* i (size nzmax) contains:
|
||
|
|
*
|
||
|
|
* COO/CSC: row indices
|
||
|
|
* CSR: column indices
|
||
|
|
*/
|
||
|
|
int *i;
|
||
|
|
|
||
|
|
short *data; /* matrix elements of size nzmax */
|
||
|
|
|
||
|
|
/*
|
||
|
|
* COO: p[n] = column number of element data[n]
|
||
|
|
* CSC: p[j] = index in data of first non-zero element in column j
|
||
|
|
* CSR: p[i] = index in data of first non-zero element in row i
|
||
|
|
*/
|
||
|
|
int *p;
|
||
|
|
|
||
|
|
size_t nzmax; /* maximum number of matrix elements */
|
||
|
|
size_t nz; /* number of non-zero values in matrix */
|
||
|
|
|
||
|
|
gsl_bst_workspace *tree; /* binary tree structure */
|
||
|
|
gsl_spmatrix_pool *pool; /* memory pool for binary tree nodes */
|
||
|
|
size_t node_size; /* size of individual tree node in bytes */
|
||
|
|
|
||
|
|
/*
|
||
|
|
* workspace of size MAX(size1,size2)*MAX(sizeof(short),sizeof(int))
|
||
|
|
* used in various routines
|
||
|
|
*/
|
||
|
|
union
|
||
|
|
{
|
||
|
|
void *work_void;
|
||
|
|
int *work_int;
|
||
|
|
short *work_atomic;
|
||
|
|
} work;
|
||
|
|
|
||
|
|
int sptype; /* sparse storage type */
|
||
|
|
size_t spflags; /* GSL_SPMATRIX_FLG_xxx */
|
||
|
|
} gsl_spmatrix_short;
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Prototypes
|
||
|
|
*/
|
||
|
|
|
||
|
|
/* allocation / initialization */
|
||
|
|
|
||
|
|
gsl_spmatrix_short * gsl_spmatrix_short_alloc (const size_t n1, const size_t n2);
|
||
|
|
gsl_spmatrix_short * gsl_spmatrix_short_alloc_nzmax (const size_t n1, const size_t n2,
|
||
|
|
const size_t nzmax, const int sptype);
|
||
|
|
void gsl_spmatrix_short_free (gsl_spmatrix_short * m);
|
||
|
|
int gsl_spmatrix_short_realloc (const size_t nzmax, gsl_spmatrix_short * m);
|
||
|
|
size_t gsl_spmatrix_short_nnz (const gsl_spmatrix_short * m);
|
||
|
|
const char * gsl_spmatrix_short_type (const gsl_spmatrix_short * m);
|
||
|
|
int gsl_spmatrix_short_set_zero (gsl_spmatrix_short * m);
|
||
|
|
int gsl_spmatrix_short_tree_rebuild (gsl_spmatrix_short * m);
|
||
|
|
|
||
|
|
/* compress */
|
||
|
|
|
||
|
|
int gsl_spmatrix_short_csc (gsl_spmatrix_short * dest, const gsl_spmatrix_short * src);
|
||
|
|
int gsl_spmatrix_short_csr (gsl_spmatrix_short * dest, const gsl_spmatrix_short * src);
|
||
|
|
gsl_spmatrix_short * gsl_spmatrix_short_compress (const gsl_spmatrix_short * src, const int sptype);
|
||
|
|
gsl_spmatrix_short * gsl_spmatrix_short_compcol (const gsl_spmatrix_short * src);
|
||
|
|
gsl_spmatrix_short * gsl_spmatrix_short_ccs (const gsl_spmatrix_short * src);
|
||
|
|
gsl_spmatrix_short * gsl_spmatrix_short_crs (const gsl_spmatrix_short * src);
|
||
|
|
|
||
|
|
/* copy */
|
||
|
|
|
||
|
|
int gsl_spmatrix_short_memcpy (gsl_spmatrix_short * dest, const gsl_spmatrix_short * src);
|
||
|
|
|
||
|
|
/* file I/O */
|
||
|
|
|
||
|
|
int gsl_spmatrix_short_fprintf (FILE * stream, const gsl_spmatrix_short * m, const char * format);
|
||
|
|
gsl_spmatrix_short * gsl_spmatrix_short_fscanf (FILE * stream);
|
||
|
|
int gsl_spmatrix_short_fwrite (FILE * stream, const gsl_spmatrix_short * m);
|
||
|
|
int gsl_spmatrix_short_fread (FILE * stream, gsl_spmatrix_short * m);
|
||
|
|
|
||
|
|
/* get/set */
|
||
|
|
|
||
|
|
short gsl_spmatrix_short_get (const gsl_spmatrix_short * m, const size_t i, const size_t j);
|
||
|
|
int gsl_spmatrix_short_set (gsl_spmatrix_short * m, const size_t i, const size_t j, const short x);
|
||
|
|
short * gsl_spmatrix_short_ptr (const gsl_spmatrix_short * m, const size_t i, const size_t j);
|
||
|
|
|
||
|
|
/* minmax */
|
||
|
|
|
||
|
|
int gsl_spmatrix_short_minmax (const gsl_spmatrix_short * m, short * min_out, short * max_out);
|
||
|
|
int gsl_spmatrix_short_min_index (const gsl_spmatrix_short * m, size_t * imin_out, size_t * jmin_out);
|
||
|
|
|
||
|
|
/* operations */
|
||
|
|
|
||
|
|
int gsl_spmatrix_short_scale (gsl_spmatrix_short * m, const short x);
|
||
|
|
int gsl_spmatrix_short_scale_columns (gsl_spmatrix_short * m, const gsl_vector_short * x);
|
||
|
|
int gsl_spmatrix_short_scale_rows (gsl_spmatrix_short * m, const gsl_vector_short * x);
|
||
|
|
int gsl_spmatrix_short_add (gsl_spmatrix_short * c, const gsl_spmatrix_short * a, const gsl_spmatrix_short * b);
|
||
|
|
int gsl_spmatrix_short_dense_add (gsl_matrix_short * a, const gsl_spmatrix_short * b);
|
||
|
|
int gsl_spmatrix_short_dense_sub (gsl_matrix_short * a, const gsl_spmatrix_short * b);
|
||
|
|
int gsl_spmatrix_short_d2sp (gsl_spmatrix_short * T, const gsl_matrix_short * A);
|
||
|
|
int gsl_spmatrix_short_sp2d (gsl_matrix_short * A, const gsl_spmatrix_short * S);
|
||
|
|
|
||
|
|
#ifndef GSL_DISABLE_DEPRECATED
|
||
|
|
|
||
|
|
int gsl_spmatrix_short_add_to_dense (gsl_matrix_short * a, const gsl_spmatrix_short * b);
|
||
|
|
|
||
|
|
#endif
|
||
|
|
|
||
|
|
/* properties */
|
||
|
|
|
||
|
|
int gsl_spmatrix_short_equal (const gsl_spmatrix_short * a, const gsl_spmatrix_short * b);
|
||
|
|
short gsl_spmatrix_short_norm1 (const gsl_spmatrix_short * a);
|
||
|
|
|
||
|
|
/* swap */
|
||
|
|
|
||
|
|
int gsl_spmatrix_short_transpose (gsl_spmatrix_short * m);
|
||
|
|
int gsl_spmatrix_short_transpose2 (gsl_spmatrix_short * m);
|
||
|
|
int gsl_spmatrix_short_transpose_memcpy (gsl_spmatrix_short * dest, const gsl_spmatrix_short * src);
|
||
|
|
|
||
|
|
__END_DECLS
|
||
|
|
|
||
|
|
#endif /* __GSL_SPMATRIX_SHORT_H__ */
|