- Copyright (C) 2006 Free Software Foundation, Inc.
- Written by John Darrington <john@darrington.wattle.id.au>
+ Copyright (C) 2006, 2007 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
impl_resize (struct flexifile *ff, int n_values, int posn);
/* Gets a case, for which writing may not be safe */
impl_resize (struct flexifile *ff, int n_values, int posn);
/* Gets a case, for which writing may not be safe */
CONST_CLASS_FLEXIFILE (CONST_CASEFILE(ff)->class) ;
return class->get_case(ff, casenum, c);
CONST_CLASS_FLEXIFILE (CONST_CASEFILE(ff)->class) ;
return class->get_case(ff, casenum, c);
CONST_CLASS_FLEXIFILE (CONST_CASEFILE(ff)->class) ;
return class->resize(ff, n_values, posn);
CONST_CLASS_FLEXIFILE (CONST_CASEFILE(ff)->class) ;
return class->resize(ff, n_values, posn);
CONST_CLASS_FLEXIFILE (CONST_CASEFILE(ff)->class) ;
return class->insert_case(ff, c, posn);
CONST_CLASS_FLEXIFILE (CONST_CASEFILE(ff)->class) ;
return class->insert_case(ff, c, posn);
CONST_CLASS_FLEXIFILE (CONST_CASEFILE(ff)->class) ;
return class->delete_cases (ff, n_cases, first);
}
CONST_CLASS_FLEXIFILE (CONST_CASEFILE(ff)->class) ;
return class->delete_cases (ff, n_cases, first);
}
{
ff->capacity += CHUNK_SIZE;
ff->cases = xrealloc(ff->cases, ff->capacity * sizeof ( *ff->cases) );
{
ff->capacity += CHUNK_SIZE;
ff->cases = xrealloc(ff->cases, ff->capacity * sizeof ( *ff->cases) );
struct flexifilereader *ffr = FLEXIFILEREADER(cr);
struct flexifile *ff = FLEXIFILE(casereader_get_casefile(cr));
struct flexifilereader *ffr = FLEXIFILEREADER(cr);
struct flexifile *ff = FLEXIFILE(casereader_get_casefile(cr));
casefile_register (cf, (struct class_casefile *) &class);
ff->value_cnt = value_cnt;
casefile_register (cf, (struct class_casefile *) &class);
ff->value_cnt = value_cnt;
- for ( i = 0 ; i < c->case_data->value_cnt * MAX_SHORT_STRING; ++i )
- putchar(c->case_data->values->s[i]);
+ for ( i = 0 ; i < value_cnt * MAX_SHORT_STRING; ++i )
+ putchar (case_str (c, 0)[i]);
{
struct ccase c;
case_create (&c, ff->value_cnt + n_values);
case_copy (&c, 0, &ff->cases[i], 0, posn);
{
struct ccase c;
case_create (&c, ff->value_cnt + n_values);
case_copy (&c, 0, &ff->cases[i], 0, posn);
memset (case_data_rw_idx(&c, posn), ' ', n_values * MAX_SHORT_STRING) ;
memset (case_data_rw_idx(&c, posn), ' ', n_values * MAX_SHORT_STRING) ;
&ff->cases[i], posn, ff->value_cnt - posn);
case_destroy (&ff->cases[i]);
&ff->cases[i], posn, ff->value_cnt - posn);
case_destroy (&ff->cases[i]);