Searched refs:bitset_is_full_range (Results 1 – 8 of 8) sorted by relevance
/dports/devel/tla/tla-1.3.5/src/hackerlab/bitsets/ |
H A D | bitset.h | 168 extern int bitset_is_full_range (bitset a, bit_t from, bit_t to);
|
H A D | bitsets-data-sheet.doc | 116 bitset_is_full_range (); bitset_adjoin ();
|
H A D | bitset.c | 335 bitset_is_full_range (bitset a, bit_t from, bit_t to) in bitset_is_full_range() function
|
H A D | bitset-tree.c | 744 return bitset_is_full_range ((bitset)a, from, to); in bits_tree_is_full_range()
|
/dports/devel/tla/tla-1.3.5/src/hackerlab/tests/bitset-tests/ |
H A D | unit-bitset.c | 188 is_full = bitset_is_full_range (real_bitset, bits_per_subset + size, real_size); in print_test_set() 437 printfmt (&errn, 1, "%d %d\n", test_no, bitset_is_full_range (a, range_start, range_end)); in main()
|
H A D | unit-bits.c | 452 if (bitset_is_full_range (b, from, to) != bits_is_full_range (b16, from, to)) in main()
|
H A D | unit-bitset-tree.c | 454 if (bitset_is_full_range (b, from, to) != bits_tree_is_full_range (0, rules, b16, from, to)) in main()
|
/dports/devel/tla/tla-1.3.5/src/docs-hackerlab/texi/ |
H A D | bitsets.texi | 470 @b{* Function} @code{bitset_is_full_range}@fuindex bitset_is_full_range 474 int bitset_is_full_range (bitset a, bit_t from, bit_t to);
|