0.4.0.0.post1.dev453 (2025-06-23)

0.4.0.0.post1.dev453 (2025-06-23)#

Features#

  • Add an IntegerSet class able to efficiently represent subset of integers using either:

    • a compact form if array.array can be used;

    • a list of integers.

    The FiniteSubSet uses now IntegerSet. (#2)

  • Create one named tuple for clarifying code:

    • Neighbourhood for representing element neighbourhoods; (#3)

  • Make changes to the function _reduced_context_completion(). In-place enlarge the lattice with an iterable of elements. Implementation of a naive version of this algorithm. Should be optimized.

    Also makes changes to testing files and add test_extend_idempotence(). Test of the idempotency property of the RᴇᴅᴜᴄᴇᴅCᴏɴᴛᴇxᴛCᴏᴍᴘʟᴇᴛɪᴏɴ algorithm. (#4)

  • Give the possibility to create a finite subset using a sorted array of intervals of int.

    Implement FiniteUniverse methods:

    • parts()

    • singletons()

    Implement FiniteUniverse attributes:

    • empty

    • whole.

    Implement FiniteSubSet methods:

    • from_intervals()

    • intervals()

    • subsets()

    • supersets() (#8)

Other Notes#

  • Major overhaul of the GALACTIC core, separating it into several parts, including the kernel that makes up this package. (#7)

Contents