Searched refs:bitset_population (Results 1 – 8 of 8) sorted by relevance
/dports/devel/tla/tla-1.3.5/src/hackerlab/tests/bitset-tests/ |
H A D | unit-bitset.c | 171 pop = bitset_population (bits_per_subset, real_bitset); in print_test_set() 202 pop = bitset_population (size, b); in print_test_set() 256 pop = bitset_population (size, b); in print_ordinary_set() 511 printfmt (&errn, 1, "%d %ld\n", test_no, bitset_population (a_size, a)); in main()
|
H A D | unit-bits.c | 315 if (!(bitset_population (65536, b) == bits_population (b16))) in main()
|
H A D | unit-bitset-tree.c | 317 if (!(bitset_population (65536, b) == bits_tree_population (0, rules, b16))) in main()
|
/dports/devel/tla/tla-1.3.5/src/hackerlab/bitsets/ |
H A D | bitset.c | 752 bitset_population (bit_t size, bitset a) in bitset_population() function 807 overcount = bitset_population (to - first_subset_offset, a + first_subset); in bitset_population_range() 808 count_error = bitset_population (from - first_subset_offset, a + first_subset); in bitset_population_range()
|
H A D | bitset.h | 183 extern bit_t bitset_population (bit_t size, bitset a);
|
H A D | bitsets-data-sheet.doc | 123 bitset_population (); bitset_population_range ();
|
H A D | bitset-tree.c | 1461 return bitset_population (rule->subset_size, (bitset)a); in bits_tree_population()
|
/dports/devel/tla/tla-1.3.5/src/docs-hackerlab/texi/ |
H A D | bitsets.texi | 717 @b{* Function} @code{bitset_population}@fuindex bitset_population 721 bit_t bitset_population (bit_t size, bitset a); 736 bit_t bitset_population (bitset a, bit_t from, bit_t to);
|