Home Conference 2005 Order Boxed Set Product Download VU Training FAQ Press and News Docs and Papers Partner Help Team     register/help User Name: Password: Login	ODYNARR.H Go to the documentation of this file. //Filename :: ODYNARR.H //Description :: Dynamic Array Object #ifndef __ODYNARR_H #define __ODYNARR_H #ifndef __ALL_H #include <ALL.H> #endif #ifndef __STRING_H #include <string.h> #endif class File; //--------- Define constant ------------// #define DEF_DYNARRAY_BLOCK_SIZE 30 // default allocation block size (no. of unities each block has) //---------- Define sort types --------// enum { SORT_INT=1, SORT_SHORT, SORT_CHAR, SORT_CHAR_PTR, SORT_CHAR_STR }; //-------- BEGIN OF CLASS DynArrary ---------// class DynArray { public : int ele_num; // the size of the whole array int block_num; // the number of element of each block int cur_pos; // current position int last_ele; // last element position ( the array is not fully used ) int ele_size; // the size of each element int sort_offset; char sort_type; char* body_buf; // cur_pos and last_ele are start from 1 (not 0) //----------------------------------------------// public : DynArray(int,int=DEF_DYNARRAY_BLOCK_SIZE); ~DynArray(); void deinit(); void resize(int); void linkin(void*); void linkin_unique(void*); void linkout(int= -1); void update(void*, int= -1); void insert(void*); void insert_at(int,void*); void add_blank(int); void init_sort(int,char); void linkin_sort_scan_from_bottom(void*); // void resort(int); void* get(); void* get(int); void* get_ptr(); void* get_ptr(int); void read(void*); int check_pos(); void push(void*); void pop(void* =0); void start(); void end(); int fwd(); int bkwd(); void jump(int); void go(int); int recno(); int size(); int is_start(); int is_end(); int scan_whole(void*); int scan(void*,int,char,int=0); int compare(void*,int,char); void quick_sort( int(*cmpFun)(const void*, const void*) ); void bubble_sort( int(*cmpFun)(const void*, const void*) ); void clean_up(int* =0); void free_ptr(void*,int*); void zap(int resizeFlag=1); int write_file(File*); // Write current dynamic array to file int read_file(File*); // Read dynamic array from file }; //--------- END OF CLASS DynArray ---------// //--------- BEGIN OF FUNCTION DynArray::get -----------// // // Return : the memory pointer to the body_buf of current element // NULL if the record no. is invalid. // inline void* DynArray::get() { if( cur_pos == 0 ) return NULL; return (void*) (body_buf+(cur_pos-1)*ele_size); } inline void* DynArray::get(int specRec) { if( specRec<1 || specRec>last_ele ) return NULL; return (void*) (body_buf+(specRec-1)*ele_size); } //--------- END OF FUNCTION DynArray::get -----------// //--------- BEGIN OF FUNCTION DynArray::get_ptr -----------// // // The content of the entry is a pointer, return the content // is a pointer // // Return : the pointer // NULL if the record no. is invalid. inline void* DynArray::get_ptr() { if( cur_pos == 0 ) return NULL; return (void*) *((char**)(body_buf+(cur_pos-1)*ele_size)); } inline void* DynArray::get_ptr(int specRec) { if( specRec < 1 || specRec > last_ele ) return NULL; return (void*) *((char**)(body_buf+(specRec-1)*ele_size)); } //--------- END OF FUNCTION DynArray::get_ptr -----------// //--------- BEGIN OF FUNCTION DynArray::read -----------// // // Read current record into the given buffer // inline void DynArray::read(void* ent) { if( ent ) memcpy(ent, get(), ele_size ); } //---------- END OF FUNCTION DynArray::read -----------// //--------- BEGIN OF FUNCTION DynArray::push,pop -----------// // <void*> ent = the address of the entity to be linked into the array inline void DynArray::push(void* ent) { linkin(ent); } // [void*] ent = the address of the entity to be overwritten by current element inline void DynArray::pop(void* ent) { end(); read(ent); linkout(); } //----------- END OF FUNCTION DynArray::push,pop ----------// //-------- BEGIN OF FUNCTIONO DynArray::start,end,fwd,bkwd -------------// // inline void DynArray::start() { cur_pos = min(1,last_ele); } inline void DynArray::end() { cur_pos = last_ele; } inline int DynArray::fwd() { if (cur_pos < last_ele ) { cur_pos++; return 1; } else return 0; } inline int DynArray::bkwd() { if (cur_pos > 1) { cur_pos--; return 1; } else return 0; } //---------- END OF FUNCTION DynArray::start,end,fwd,bkwd ---------// //--------- BEGIN OF FUNCTION DynArray::jump,go,pos,size ----------// inline void DynArray::jump(int step) { cur_pos+=step; if ( cur_pos < 0 ) cur_pos = min(1,last_ele) ; if ( cur_pos > last_ele ) cur_pos = last_ele; } inline void DynArray::go(int desPos) { if ( desPos >= 1 && desPos <= last_ele ) cur_pos = desPos; } inline int DynArray::recno() { return cur_pos; } inline int DynArray::size() { return last_ele; } //----------- END OF FUNCTION DynArray::jump,go,pos,size ---------// //-------- BEGIN OF FUNCTION DynArray::isstart,isend ------// inline int DynArray::is_start() { return( cur_pos <= 1 ); } inline int DynArray::is_end() { return( cur_pos >= last_ele ); } //-------- END OF FUNCTION DynArray::isstart,isend --------// #endif
	Privacy Policy | Terms of Service Virtual U Project © 2003 Two Custom House Wharf, Suite 201 Portland, ME 04101 P: 1-888-286-3540 | E: info@virtual-u.org