![]() | ![]() | ![]() | GSF Reference Manual | ![]() |
---|
int gsf_infile_num_children (GsfInfile *infile); GsfInput* gsf_infile_child_by_index (GsfInfile *infile, int i); GsfInput* gsf_infile_child_by_name (GsfInfile *infile, char const *name); GsfInput* gsf_infile_child_by_vname (GsfInfile *infile, char const *name, ...); #define GSF_INFILE_CLASS (k) #define GSF_IS_INFILE_CLASS (k) struct GsfInfileClass;
int gsf_infile_num_children (GsfInfile *infile);
infile : | the structured storage |
Returns : | the number of children the storage has, or -1 if the storage can not have children. |
GsfInput* gsf_infile_child_by_index (GsfInfile *infile, int i);
TODO : For 2.0 api will change to include a GError.
infile : | |
i : | |
Returns : | a newly created child which must be unrefed. |
GsfInput* gsf_infile_child_by_name (GsfInfile *infile, char const *name);
TODO : For 2.0 api will change to include a GError.
infile : | |
name : | |
Returns : | a newly created child which must be unrefed. |
GsfInput* gsf_infile_child_by_vname (GsfInfile *infile, char const *name, ...);
A returns a newly created child which must be unrefed.
infile : | |
name : | A NULL terminated list of names |
... : | |
Returns : |
|
#define GSF_INFILE_CLASS(k) (G_TYPE_CHECK_CLASS_CAST ((k), GSF_INFILE_TYPE, GsfInfileClass))
k : |
|
#define GSF_IS_INFILE_CLASS(k) (G_TYPE_CHECK_CLASS_TYPE ((k), GSF_INFILE_TYPE))
k : |
|
struct GsfInfileClass { GsfInputClass input_class; int (*num_children) (GsfInfile *infile); char const *(*name_by_index) (GsfInfile *infile, int i); GsfInput *(*child_by_index) (GsfInfile *infile, int i, GError **err); GsfInput *(*child_by_name) (GsfInfile *infile, char const *name, GError **err); };
<<< gsf-infile | gsf-infile-msole >>> |