-Properties are associated with algorithms and are used to select between different implementations dynamically.
+Selecting algorithm implementations by properties
+=================================================
+
+Properties are associated with algorithms and are used to select between
+different implementations dynamically.
Some consequences of these assumptions are:
* That definition is uncommon and queries are very common, we can treat
Some consequences of these assumptions are:
* That definition is uncommon and queries are very common, we can treat
properties are changed as doing so removes the need to index on both the
global and requested property strings.
properties are changed as doing so removes the need to index on both the
global and requested property strings.
lock more easily. The global lock is held for short periods of time with
per algorithm locking being used for longer intervals.
lock more easily. The global lock is held for short periods of time with
per algorithm locking being used for longer intervals.
names and values to small integer indices. Names and values are stored in
separate hash tables. The two Boolean values, the strings "yes" and "no",
are populated as the first two members of the value table. All property
names and values to small integer indices. Names and values are stored in
separate hash tables. The two Boolean values, the strings "yes" and "no",
are populated as the first two members of the value table. All property
provided to convert from an index back to the original string (this can be
done by maintaining parallel stacks of strings if required).
provided to convert from an index back to the original string (this can be
done by maintaining parallel stacks of strings if required).
These convert ASCII strings into lists of properties. The resulting
lists are sorted by the name index. Some additional utility functions
for dealing with property lists are also included: comparison of a query
against a definition and merging two queries into a single larger query.
These convert ASCII strings into lists of properties. The resulting
lists are sorted by the name index. Some additional utility functions
for dealing with property lists are also included: comparison of a query
against a definition and merging two queries into a single larger query.
without bounds and must garbage collect under-used entries. The garbage
collection does not have to be exact.
without bounds and must garbage collect under-used entries. The garbage
collection does not have to be exact.
parsed properties. It is used by property.c to improve performance when
the same definition appears multiple times.
parsed properties. It is used by property.c to improve performance when
the same definition appears multiple times.