mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-18 19:03:45 +00:00
ee0f9f73d7
library/fatter_sparse_bitset.m:
Add this version of fat_sparse_bitset.m, which stores *two* words
worth of bits in each cell, not one. This word would otherwise be unused,
because the Boehm-Demers-Weiser allocator rounds up requests for three
word cells to four.
library/MODULES_DOC:
library/library.m:
Add the new module to the list of library modules.
library/fat_sparse_bitset.m:
library/sparse_bitset.m:
library/tree_bitset.m:
Update the documentation of all these other bitset modules. Copy
the same basic introduction to all the relevant modules. Add documentation
of the differences to tree_bitset.m and fatter_sparse_bitset.m, with
a pointer in fat_sparse_bitset.m to fatter_sparse_bitset.m.
library/test_bitset.m:
Test the new module as well as the others.
tests/hard_coded/speedtest_bitset.m:
Extend the benchmarking of list_to_set operations to the new module.
To allow the benchmarking to be tough enough to be informative, comment
out the benchmarking of the old_list_to_set operations.
126 lines
1.4 KiB
Plaintext
126 lines
1.4 KiB
Plaintext
array.m
|
|
array2d.m
|
|
assoc_list.m
|
|
bag.m
|
|
benchmarking.m
|
|
bimap.m
|
|
bit_buffer.m
|
|
bit_buffer.read.m
|
|
bit_buffer.write.m
|
|
bitmap.m
|
|
bool.m
|
|
bt_array.m
|
|
builtin.m
|
|
calendar.m
|
|
char.m
|
|
construct.m
|
|
cord.m
|
|
counter.m
|
|
deconstruct.m
|
|
diet.m
|
|
digraph.m
|
|
dir.m
|
|
edit_seq.m
|
|
enum.m
|
|
eqvclass.m
|
|
exception.m
|
|
fat_sparse_bitset.m
|
|
fatter_sparse_bitset.m
|
|
float.m
|
|
gc.m
|
|
getopt.m
|
|
getopt_io.m
|
|
hash_table.m
|
|
injection.m
|
|
int.m
|
|
int8.m
|
|
int16.m
|
|
int32.m
|
|
int64.m
|
|
integer.m
|
|
io.m
|
|
io.call_system.m
|
|
io.environment.m
|
|
io.file.m
|
|
kv_list.m
|
|
lazy.m
|
|
library.m
|
|
list.m
|
|
map.m
|
|
math.m
|
|
maybe.m
|
|
mercury_term_lexer.m
|
|
mercury_term_parser.m
|
|
multi_map.m
|
|
one_or_more.m
|
|
one_or_more_map.m
|
|
ops.m
|
|
pair.m
|
|
parsing_utils.m
|
|
pprint.m
|
|
pqueue.m
|
|
pretty_printer.m
|
|
prolog.m
|
|
psqueue.m
|
|
queue.m
|
|
ra_list.m
|
|
random.m
|
|
random.sfc16.m
|
|
random.sfc32.m
|
|
random.sfc64.m
|
|
random.system_rng.m
|
|
ranges.m
|
|
rational.m
|
|
rbtree.m
|
|
require.m
|
|
rtree.m
|
|
set.m
|
|
set_bbbtree.m
|
|
set_ctree234.m
|
|
set_ordlist.m
|
|
set_tree234.m
|
|
set_unordlist.m
|
|
solutions.m
|
|
sparse_bitset.m
|
|
stack.m
|
|
std_util.m
|
|
store.m
|
|
stream.m
|
|
stream.string_writer.m
|
|
string.builder.m
|
|
string.m
|
|
table_statistics.m
|
|
term.m
|
|
term_context.m
|
|
term_conversion.m
|
|
term_int.m
|
|
term_subst.m
|
|
term_unify.m
|
|
term_vars.m
|
|
term_io.m
|
|
term_to_xml.m
|
|
thread.barrier.m
|
|
thread.channel.m
|
|
thread.closeable_channel.m
|
|
thread.future.m
|
|
thread.m
|
|
thread.mvar.m
|
|
thread.semaphore.m
|
|
time.m
|
|
tree234.m
|
|
tree_bitset.m
|
|
type_desc.m
|
|
uint.m
|
|
uint8.m
|
|
uint16.m
|
|
uint32.m
|
|
uint64.m
|
|
unit.m
|
|
univ.m
|
|
varset.m
|
|
version_array.m
|
|
version_array2d.m
|
|
version_bitmap.m
|
|
version_hash_table.m
|
|
version_store.m
|