Definition at line 541 of file types.c.
Data Fields | |
word_t *restrict | incidenceb |
Binary incidence matrix for type counting. | |
zom_t *restrict | incidencezom |
Zero-one-more incidence matrix for hapax counting. | |
unsigned | iterations |
The number of iterations. | |
unsigned | slots |
The number of slots. | |
unsigned | requested_slot_size |
The size of each slot. | |
unsigned | nsample |
The number of samples. | |
unsigned | ntype |
The number of types. | |
unsigned | type_words |
Memory words per sample. | |
unsigned | total_items |
The total number of items. | |
unsigned * | sample_items |
Items per sample. | |
bool | slot_size |
Specify the size of a slot instead of the number of the slots. | |
bool | items_from_table |
Get the item counts from the incidence matrix instead of using a separate vector. | |
bool | hapax |
Count the number of hapaxes only. | |
bool | brief |
Skip redundant identical rows in output. | |
bool | raw_data |
Output data for each permutation. | |
bool | nonrandom |
For debugging: do not randomise but use the identity permutation. | |
bool | builtin_rng |
For debugging: use the built-in pseudorandom number generator. |
word_t* restrict input_t::incidenceb |
Binary incidence matrix for type counting.
Each row of type_words consecutive elements corresponds to a sample.
Definition at line 544 of file types.c.
Referenced by calculate_bounds_normal(), and free_input().
zom_t* restrict input_t::incidencezom |
Zero-one-more incidence matrix for hapax counting.
Organised in the same way as incidenceb.
Definition at line 547 of file types.c.
Referenced by calculate_bounds_hapax(), and free_input().
unsigned input_t::iterations |
The number of iterations.
Always defined by parse_command_line.
Definition at line 550 of file types.c.
Referenced by print_result().
unsigned input_t::slots |
The number of slots.
Not used if raw_data. If slot_size is true, this is defined by prepare_slots based on requested_slot_size; otherwise it is defined already in parse_command_line. At least 2.
Definition at line 553 of file types.c.
Referenced by print_result().
unsigned input_t::requested_slot_size |
unsigned input_t::nsample |
The number of samples.
Positive.
Definition at line 559 of file types.c.
Referenced by next_permutation().
unsigned input_t::ntype |
The number of types.
Positive.
Definition at line 562 of file types.c.
Referenced by print_result().
unsigned input_t::type_words |
Memory words per sample.
Positive.
Definition at line 565 of file types.c.
Referenced by calculate_bounds_hapax(), and calculate_bounds_normal().
unsigned input_t::total_items |
unsigned* input_t::sample_items |
bool input_t::slot_size |
bool input_t::hapax |
Count the number of hapaxes only.
By default, the program computes the number of all types. Hapaxes are types which have occurred exactly once so far.
Definition at line 578 of file types.c.
Referenced by free_input().
bool input_t::brief |
Skip redundant identical rows in output.
If there are 3 or more identical rows, print only the first one and the last one.
Definition at line 581 of file types.c.
Referenced by print_result().
bool input_t::raw_data |
Output data for each permutation.
By default, the program accumulates information on each permutation for each slot; only a summary of the results is printed. If raw_data
is set, then the raw type (or hapax) accumulation curve is printed for each permutation.
Definition at line 584 of file types.c.
Referenced by main().
bool input_t::nonrandom |
For debugging: do not randomise but use the identity permutation.
Definition at line 586 of file types.c.
Referenced by next_permutation().
bool input_t::builtin_rng |
For debugging: use the built-in pseudorandom number generator.
Definition at line 588 of file types.c.
Referenced by next_permutation().