123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179 |
- /* oo_WRITE_BINARY.h
- *
- * Copyright (C) 1994-2009,2011-2018 Paul Boersma
- *
- * This code 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 2 of the License, or (at
- * your option) any later version.
- *
- * This code 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 work. If not, see <http://www.gnu.org/licenses/>.
- */
- #include "oo_undef.h"
- #define oo_SIMPLE(type, storage, x) \
- binput##storage (our x, f);
- #define oo_SET(type, storage, x, setType) \
- for (int _i = 0; _i <= (int) setType::MAX; _i ++) { \
- binput##storage (our x [_i], f); \
- }
- #define oo_VECTOR(type, storage, x, min, max) \
- { \
- integer _min = (min), _max = (max); \
- if (our x) { \
- NUMvector_writeBinary_##storage (our x, _min, _max, f); \
- } \
- }
- #define oo_ANYVEC(type, storage, x, sizeExpression) \
- { \
- integer _size = (sizeExpression); \
- Melder_assert (our x.size == _size); \
- if (our x.at) { \
- NUMvector_writeBinary_##storage (our x.at, 1, _size, f); \
- } \
- }
- #define oo_MATRIX(type, storage, x, row1, row2, col1, col2) \
- { \
- integer _row1 = (row1), _row2 = (row2), _col1 = (col1), _col2 = (col2); \
- if (our x) { \
- NUMmatrix_writeBinary_##storage (our x, _row1, _row2, _col1, _col2, f); \
- } \
- }
- #define oo_ANYMAT(type, storage, x, nrowExpression, ncolExpression) \
- { \
- integer _nrow = (nrowExpression), _ncol = (ncolExpression); \
- Melder_assert (our x.nrow == _nrow && our x.ncol == _ncol); \
- if (our x.at) { \
- NUMmatrix_writeBinary_##storage (our x.at, 1, _nrow, 1, _ncol, f); \
- } \
- }
- #define oo_ENUMx(kType, storage, x) \
- binput##storage ((int) our x, f);
- //#define oo_ENUMx_SET(kType, storage, x, setType) \
- // for (int _i = 0; _i <= setType::MAX; _i ++) { \
- // binput##storage ((int) our x [_i], f); \
- // }
- //#define oo_ENUMx_VECTOR(kType, storage, x, min, max) \
- // { \
- // integer _min = (min), _max = (max); \
- // if (our x) { \
- // NUMvector_writeBinary_##storage ((int) our x, _min, _max, f); \
- // } \
- // {
- #define oo_STRINGx(storage,x) \
- binput##storage (our x.get(), f);
- #define oo_STRINGx_SET(storage, x, setType) \
- for (int _i = 0; _i <= setType::MAX; _i ++) { \
- binput##storage (our x [_i].get(), f); \
- }
- #define oo_STRINGx_VECTOR(storage, x, n) \
- { \
- integer _size = (n); \
- Melder_assert (_size == our x.size); \
- for (integer _i = 1; _i <= _size; _i ++) \
- binput##storage (our x [_i].get(), f); { \
- } \
- }
- #define oo_STRUCT(Type, x) \
- our x. writeBinary (f);
- #define oo_STRUCT_SET(Type, x, setType) \
- for (int _i = 0; _i <= (int) setType::MAX; _i ++) { \
- our x [_i]. writeBinary (f); \
- }
- #define oo_STRUCT_VECTOR_FROM(Type, x, min, max) \
- { \
- integer _min = (min), _max = (max); \
- for (integer _i = _min; _i <= _max; _i ++) { \
- our x [_i]. writeBinary (f); \
- } \
- }
- #define oo_STRUCT_MATRIX_FROM(Type, x, row1, row2, col1, col2) \
- { \
- integer _row1 = (row1), _row2 = (row2), _col1 = (col1), _col2 = (col2); \
- for (integer _irow = _row1; _irow <= _row2; _irow ++) { \
- for (integer _icol = _col1; _icol <= _col2; _icol ++) { \
- our x [_irow] [_icol]. writeBinary (f); \
- } \
- } \
- }
- #define oo_OBJECT(Class, version, x) \
- binputex ((bool) our x, f); \
- if (our x) { \
- Data_writeBinary (our x.get(), f); \
- }
- #define oo_COLLECTION_OF(Class, x, ItemClass, version) \
- binputinteger32BE (our x.size, f); \
- for (integer _i = 1; _i <= our x.size; _i ++) { \
- ItemClass data = our x.at [_i]; \
- data -> struct##ItemClass :: v_writeBinary (f); \
- }
- #define oo_COLLECTION(Class, x, ItemClass, version) \
- binputinteger32BE (our x ? our x->size : 0, f); \
- if (our x) { \
- for (integer _i = 1; _i <= our x->size; _i ++) { \
- ItemClass data = our x->at [_i]; \
- data -> struct##ItemClass :: v_writeBinary (f); \
- } \
- }
- #define oo_FILE(x)
- #define oo_DIR(x)
- #define oo_DEFINE_STRUCT(Type) \
- void struct##Type :: writeBinary (FILE *f) {
- #define oo_END_STRUCT(Type) \
- }
- #define oo_DEFINE_CLASS(Class, Parent) \
- void struct##Class :: v_writeBinary (FILE *f) { \
- Class##_Parent :: v_writeBinary (f);
- #define oo_END_CLASS(Class) \
- }
- #define oo_FROM(from)
- #define oo_ENDFROM
- #define oo_DECLARING 0
- #define oo_DESTROYING 0
- #define oo_COPYING 0
- #define oo_COMPARING 0
- #define oo_VALIDATING_ENCODING 0
- #define oo_READING 0
- #define oo_READING_TEXT 0
- #define oo_READING_BINARY 0
- #define oo_WRITING 1
- #define oo_WRITING_TEXT 0
- #define oo_WRITING_BINARY 1
- #define oo_DESCRIBING 0
- /* End of file oo_WRITE_BINARY.h */
|