Did you know ... | Search Documentation: |
Pack logtalk -- logtalk-3.86.0/library/mutations/NOTES.md |
This file is part of Logtalk https://logtalk.org/ SPDX-FileCopyrightText: 1998-2023 Paulo Moura <pmoura@logtalk.org> SPDX-License-Identifier: Apache-2.0
Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
mutations
Experimental library. Should not be used in production code. Details can be changed without advance notice.
The mutations
library provides support for generating random mutations
of selected types. The library defines default mutation algorithms for the
following basic types:
mutations_store
object as the hook object.
This library is expected to eventually be used to support mutation-based fuzz testing.
By default, loading this library loads a set of default mutation algorithms. These can be overridden by defining alternative mutations and a custom loader file.
Open the [../../docs/library_index.html#mutations](../../docs/library_index.html#mutations) link in a web browser.
To load all entities in this library, load the loader.lgt
file:
| ?- logtalk_load(mutations(loader))
.
To test this library predicates, load the tester.lgt
file:
| ?- logtalk_load(mutations(tester))
.
The mutations
category complements the type
object and thus its predicates
are accessed via this object. For example:
| ?- type::mutation(integer, 123, M)
.
M = 1293
yes
| type::mutation(integer, 123, M)
.
M = 5123
yes
| type::mutation(integer, 123, M)
.
M = -123
yes
| type::mutation(integer, 123, M)
.
M = 23
yes
When there are multiple mutation algorithms for a given type, the predicate `type::mutation/3` chooses one of them randomly. We can query the number of mutation algorithms available per type using the `mutations_store::counter/2` predicate:
| ?- mutations_store::counter(Type, Count)
.
Type = atom,
Count = 6 ;
Type = integer,
Count = 7 ;
...
Loading this library also loads the arbitrary
library, which provides
get_seed/1 and set_seed/1 predicates that can be used to control the
pseudo-random number generator.