comparison src/structs.h @ 119:e8f07016e34d

updated for version 7.0042
author vimboss
date Wed, 19 Jan 2005 22:18:32 +0000
parents e918d3e340a4
children f67f8a8d81ba
comparison
equal deleted inserted replaced
118:45fd0ec37cf3 119:e8f07016e34d
1927 char_u *arguments; 1927 char_u *arguments;
1928 #endif 1928 #endif
1929 } prt_settings_T; 1929 } prt_settings_T;
1930 1930
1931 #define PRINT_NUMBER_WIDTH 8 1931 #define PRINT_NUMBER_WIDTH 8
1932
1933 /* Item for a hashtable. "hi_key" can be one of three values:
1934 * NULL: Never been used
1935 * HI_KEY_REMOVED: Entry was removed
1936 * Otherwise: Used item, pointer to the actual key; this usually is
1937 * inside the item, subtract an offset to locate the item.
1938 * This reduces the size of hashitem by 1/3.
1939 */
1940 typedef struct hashitem_S
1941 {
1942 long_u hi_hash; /* cached hash number of hi_key */
1943 char_u *hi_key;
1944 } hashitem;
1945
1946 /* The address of "hash_removed" is used as a magic number for hi_key to
1947 * indicate a removed item. */
1948 #define HI_KEY_REMOVED &hash_removed
1949 #define HASHITEM_EMPTY(hi) ((hi)->hi_key == NULL || (hi)->hi_key == &hash_removed)
1950
1951 /* Initial size for a hashtable. Our items are relatively small and growing
1952 * is expensive, thus use 16 as a start. Must be a power of 2. */
1953 #define HT_INIT_SIZE 16
1954
1955 typedef struct hashtable_S
1956 {
1957 long_u ht_mask; /* mask used for hash value (nr of items in
1958 * array is "ht_mask" + 1) */
1959 int ht_used; /* number of items used */
1960 int ht_filled; /* number of items used + removed */
1961 int ht_error; /* when set growing failed, can't add more
1962 items before growing works */
1963 hashitem *ht_array; /* points to the array, allocated when it's
1964 not "ht_smallarray" */
1965 hashitem ht_smallarray[HT_INIT_SIZE]; /* initial array */
1966 } hashtable;