bisc_package.tests.integration package

Submodules

bisc_package.tests.integration.bisc_simple_test module

Simplified test of the BiSC algorithm focusing on basic functionality.

class bisc_package.tests.integration.bisc_simple_test.Permutation(sequence)

Bases: object

Represents a permutation in one-line notation.

__init__(sequence)

subwords(max_length)

Returns all subwords of length at most max_length with their positions.

Return type:

List[Tuple[List[int], List[int]]]

bisc_package.tests.integration.bisc_simple_test.flatten(word)

Flattens a word to a permutation by replacing values with their relative order.

Return type:

List[int]

bisc_package.tests.integration.bisc_simple_test.simple_mine_test()

Simple test of the MINE concept with manual verification.

bisc_package.tests.integration.bisc_simple_test.test_flatten()

Test the flatten function.

bisc_package.tests.integration.simple_verification module

Simple verification of BiSC examples using basic pattern analysis. Focus on pattern presence/absence rather than full mesh pattern generation.

bisc_package.tests.integration.simple_verification.flatten(word)

Flattens a word to a permutation by replacing values with their relative order.

Return type:

List[int]

bisc_package.tests.integration.simple_verification.contains_pattern(permutation, pattern)

Check if permutation contains the given classical pattern.

Return type:

bool

bisc_package.tests.integration.simple_verification.find_missing_patterns(input_perms, max_pattern_length)

Find patterns that are missing from the input set.

Return type:

List[List[int]]

bisc_package.tests.integration.simple_verification.verify_stack_sortable()

Test 1: Stack-sortable permutations should avoid 231.

bisc_package.tests.integration.simple_verification.verify_smooth_permutations()

Test 2: Smooth permutations should avoid 1324 and 2143.

bisc_package.tests.integration.simple_verification.verify_west_2_stack()

Test 3: Partial test for West-2-stack-sortable.

bisc_package.tests.integration.simple_verification.verify_difficult_example()

Test 4: The difficult example from equation (2).

bisc_package.tests.integration.simple_verification.main()

Run all simple verifications.

bisc_package.tests.integration.verify_examples module

Verification of examples from the BiSC paper. Tests our implementation against the specific examples mentioned in the paper.

bisc_package.tests.integration.verify_examples.generate_all_permutations(max_length)

Generate all permutations up to given length.

Return type:

List[List[int]]

bisc_package.tests.integration.verify_examples.contains_pattern(permutation, pattern)

Check if permutation contains the given classical pattern.

Return type:

bool

bisc_package.tests.integration.verify_examples.verify_stack_sortable()

Verify Example 1: Stack-sortable permutations avoid 231.

bisc_package.tests.integration.verify_examples.verify_west_2_stack_sortable()

Verify Example 2: West-2-stack-sortable permutations.

bisc_package.tests.integration.verify_examples.verify_difficult_example()

Verify the difficult example from equation (2): 1, 21, 321, 2341, 4123, 4321.

bisc_package.tests.integration.verify_examples.verify_smooth_permutations()

Verify smooth permutations avoid 1324 and 2143.

bisc_package.tests.integration.verify_examples.main()

Run all verifications.

Module contents

Integration tests for the BiSC algorithm.