commonMain.it.unibo.tuprolog.collections.impl.ReteClauseMultiSet.kt Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of theory-jvm Show documentation

In-memory storage and indexing facilities for ordered and unordered knowledge bases composed by logic clauses

There is a newer version: 1.0.4

package it.unibo.tuprolog.collections.impl

import it.unibo.tuprolog.collections.AbstractReteClauseCollection
import it.unibo.tuprolog.collections.ClauseMultiSet
import it.unibo.tuprolog.collections.MutableClauseMultiSet
import it.unibo.tuprolog.collections.rete.custom.ReteTree
import it.unibo.tuprolog.core.Clause
import it.unibo.tuprolog.theory.TheoryUtils
import it.unibo.tuprolog.unify.Unificator

internal class ReteClauseMultiSet private constructor(
    rete: ReteTree,
) : ClauseMultiSet, AbstractReteClauseCollection(rete) {
    private val hashCodeCache by lazy {
        ClauseMultiSet.hashCode(this)
    }

    init {
        require(!rete.isOrdered)
    }

    /** Construct a [ReteClauseMultiSet] from given clauses */
    constructor(unificator: Unificator, clauses: Iterable) : this(ReteTree.unordered(unificator, clauses)) {
        TheoryUtils.checkClausesCorrect(clauses)
    }

    override fun count(clause: Clause): Long = rete.get(clause).count().toLong()

    override fun get(clause: Clause): Sequence = rete.get(clause)

    override fun newCollectionBuilder(rete: ReteTree): ReteClauseMultiSet {
        return ReteClauseMultiSet(rete)
    }

    override fun equals(other: Any?): Boolean {
        return if (other is ClauseMultiSet && other !is MutableClauseMultiSet) {
            ClauseMultiSet.equals(this, other)
        } else {
            false
        }
    }

    override fun hashCode(): Int = hashCodeCache

    override val self: ReteClauseMultiSet
        get() = this
}