2 * (c) Oleg Puchinin 2007
3 * graycardinalster@gmail.com
10 /// Класс - хэш с сортировкой ключей.
18 char * get (char * key
) ;
19 char * set (char * key
, char * value
) ;
24 inline void clean () {
27 inline int autoSort () {
30 inline int setAutoSort (int d_set
) {
34 inline bool autoCheck () {
37 inline bool setAutoCheck (bool d_set
) {
41 inline EArray
* sortedElements () {
44 inline EArray
* dirtyElements () {
45 return dirty_elements
;
52 int from_file (char *f_name
);
53 void foreach (Dhash_f f
);
56 char * operator [] (char *S
);
60 dkey_t
* __find_item (char * key
) ;
61 dkey_t
* __find_dirty_item (char * key
) ;
62 void do_sort (bool b_clean
) ;
63 char * pack_item (char * key
, char * value
) ;
64 char * set_item_value (char * pack
, char * value
) ;
65 char * get_item (char * key
) ;
66 dkey_t
* unpackItem (char * item
, dkey_t
* data
);
67 List
* keys_or_values (bool val
);
70 int dfa
; // Dirty elements before autosorting.
73 EArray
* dirty_elements
;