/usr/include/scilab/api_boolean_sparse.h is in scilab-include 5.5.2-2ubuntu3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 | /*
* Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
* Copyright (C) 2009 - DIGITEO - Antoine ELIAS
*
* This file must be used under the terms of the CeCILL.
* This source file is licensed as described in the file COPYING, which
* you should have received as part of this distribution. The terms
* are also available at
* http://www.cecill.info/licences/Licence_CeCILL_V2.1-en.txt
*/
#ifndef __BOOLEAN_SPARSE_API__
#define __BOOLEAN_SPARSE_API__
#if !defined(__INTERNAL_API_SCILAB__)
#error Do not include api_boolean_sparse.h. Include api_scilab.h instead.
#endif
#ifdef __cplusplus
extern "C" {
#endif
/*******************************/
/* boolean sparse functions */
/*******************************/
/**
* Get boolean sparse variable
* @param[in] _piAddress variable address
* @param[out] _piRows return number of rows
* @param[out] _piCols return number of columns
* @param[out] _piNbItem return number of items
* @param[out] _piNbItemRow return array of number of items for each row
* @param[out] _piColPos return array of item column positions ( 1 indexed )
* @return if the operation succeeded (0) or not ( !0 )
*/
SciErr getBooleanSparseMatrix(void* _pvCtx, int* _piAddress, int* _piRows, int* _piCols, int* _piNbItem, int** _piNbItemRow, int** _piColPos);
/**
* Allocate boolean sparse variable data
* @param[in] _iVar variable number
* @param[in] _iRows number of rows
* @param[in] _iCols number of columns
* @param[in] _iNbItem number of items
* @param[out] _piNbItemRow return array of number of items for each row
* @param[out] _piColPos return array of item column positions ( 1 indexed )
* @return if the operation succeeded (0) or not ( !0 )
*/
SciErr allocBooleanSparseMatrix(void* _pvCtx, int _iVar, int _iRows, int _iCols, int _iNbItem, int** _piNbItemRow, int** _piColPos);
/**
* Create boolean sparse variable
* @param[in] _iVar variable number
* @param[in] _iRows number of rows
* @param[in] _iCols number of columns
* @param[in] _iNbItem number of items
* @param[in] _piNbItemRow array of number of items for each row
* @param[in] _piColPos array of item column positions ( 1 indexed )
* @return if the operation succeeded (0) or not ( !0 )
*/
SciErr createBooleanSparseMatrix(void* _pvCtx, int _iVar, int _iRows, int _iCols, int _iNbItem, const int* _piNbItemRow, const int* _piColPos);
/**
* Create named boolean sparse variable
* @param[in] _pstName variable name
* @param[in] _iRows number of rows
* @param[in] _iCols number of columns
* @param[in] _iNbItem number of items
* @param[in] _piNbItemRow array of number of items for each row
* @param[in] _piColPos array of item column positions ( 1 indexed )
* @return if the operation succeeded (0) or not ( !0 )
*/
SciErr createNamedBooleanSparseMatrix(void* _pvCtx, const char* _pstName, int _iRows, int _iCols, int _iNbItem, const int* _piNbItemRow, const int* _piColPos);
/**
* Read named boolean sparse variable
* @param[in] _pstName variable name
* @param[out] _piRows return number of rows
* @param[out] _piCols return number of columns
* @param[out] _piNbItem return number of items
* @param[out] _piNbItemRow return array of number of item for each row
* @param[out] _piColPos return array of item column position ( 1 indexed )
* @return if the operation succeeded (0) or not ( !0 )
*/
SciErr readNamedBooleanSparseMatrix(void* _pvCtx, const char* _pstName, int* _piRows, int* _piCols, int* _piNbItem, int* _piNbItemRow, int* _piColPos);
/* shortcut functions */
/**
* Check if the variable type is boolean sparse
* @param[in] _piAddress variable address
* @return 1 for true and 0 for false
*/
int isBooleanSparseType(void* _pvCtx, int* _piAddress);
/**
* Check if the variable type is boolean sparse
* @param[in] _pstName variable name
* @return 1 for true and 0 for false
*/
int isNamedBooleanSparseType(void* _pvCtx, const char* _pstName);
/**
* Get boolean sparse variable data
* @param[in] _piAddress variable address
* @param[out] _piRows return number of rows
* @param[out] _piCols return number of columns
* @param[out] _piNbItem return number of items
* @param[out] _piNbItemRow return array of number of items for each row
* @param[out] _piColPos return array of item column positions ( 1 indexed )
* @return if the operation succeeded (0) or not ( !0 )
*/
int getAllocatedBooleanSparseMatrix(void* _pvCtx, int* _piAddress, int* _piRows, int* _piCols, int* _piNbItem, int** _piNbItemRow, int** _piColPos);
/**
* Get named boolean sparse variable data
* @param[in] _pstName variable name
* @param[out] _piRows return number of rows
* @param[out] _piCols return number of columns
* @param[out] _piNbItem return number of items
* @param[out] _piNbItemRow return array of number of items for each row
* @param[out] _piColPos return array of item column positions ( 1 indexed )
* @return if the operation succeeded (0) or not ( !0 )
*/
int getNamedAllocatedBooleanSparseMatrix(void* _pvCtx, const char* _pstName, int* _piRows, int* _piCols, int* _piNbItem, int** _piNbItemRow, int** _piColPos);
/**
* Free data allocated by shortcut functions
* @param[in] _piNbItemRow array of number of items for each row
* @param[in] _piColPos array of item column positions ( 1 indexed )
*/
void freeAllocatedBooleanSparse(int* _piNbItemRow, int* _piColPos);
#ifdef __cplusplus
}
#endif
#endif /* __BOOLEAN_SPARSE_API__ */
|