-
Notifications
You must be signed in to change notification settings - Fork 15
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
10 changed files
with
238 additions
and
220 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
138 changes: 138 additions & 0 deletions
138
.../commonMain/kotlin/it/unibo/tuprolog/collections/rete/custom/nodes/FunctorIndexingNode.kt
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,138 @@ | ||
| package it.unibo.tuprolog.collections.rete.custom.nodes | ||
|
|
||
| import it.unibo.tuprolog.collections.rete.custom.Utils | ||
| import it.unibo.tuprolog.collections.rete.custom.Utils.arityOfNestedFirstArgument | ||
| import it.unibo.tuprolog.collections.rete.custom.Utils.nestedFirstArgument | ||
| import it.unibo.tuprolog.collections.rete.custom.clause.IndexedClause | ||
| import it.unibo.tuprolog.collections.rete.custom.clause.SituatedIndexedClause | ||
| import it.unibo.tuprolog.core.Clause | ||
| import it.unibo.tuprolog.core.Rule | ||
| import it.unibo.tuprolog.core.Var | ||
| import it.unibo.tuprolog.unify.Unificator.Companion.matches | ||
| import it.unibo.tuprolog.utils.Cached | ||
| import it.unibo.tuprolog.utils.dequeOf | ||
|
|
||
| internal class FunctorIndexingNode( | ||
| private val ordered: Boolean, | ||
| private val nestingLevel: Int | ||
| ) : FunctorNode(), FunctorIndexing { | ||
|
|
||
| private val arities: MutableMap<Int, ArityIndexing> = mutableMapOf() | ||
| private val theoryCache: Cached<MutableList<SituatedIndexedClause>> = Cached.of(this::regenerateCache) | ||
|
|
||
| override fun get(clause: Clause): Sequence<Clause> = | ||
| arities[clause.nestedArity()]?.get(clause) ?: emptySequence() | ||
|
|
||
| override fun assertA(clause: IndexedClause) { | ||
| arities.getOrPut(clause.nestedArity()) { | ||
| FamilyArityIndexingNode( | ||
| ordered, | ||
| nestingLevel | ||
| ) | ||
| }.assertA(clause + this) | ||
| } | ||
|
|
||
| override fun assertZ(clause: IndexedClause) { | ||
| arities.getOrPut(clause.nestedArity()) { | ||
| FamilyArityIndexingNode( | ||
| ordered, | ||
| nestingLevel | ||
| ) | ||
| }.assertZ(clause + this) | ||
| } | ||
|
|
||
| override fun retractAll(clause: Clause): Sequence<Clause> = | ||
| arities[clause.nestedArity()]?.retractAll(clause) | ||
| ?: emptySequence() | ||
|
|
||
| override fun getCache(): Sequence<SituatedIndexedClause> = | ||
| theoryCache.value.asSequence() | ||
|
|
||
| override fun getFirstIndexed(clause: Clause): SituatedIndexedClause? = | ||
| if (clause.isGlobal()) { | ||
| Utils.merge( | ||
| arities.values.map { | ||
| it.extractGlobalIndexedSequence(clause) | ||
| } | ||
| ).firstOrNull { it.innerClause matches clause } | ||
| } else arities[clause.nestedArity()]?.getFirstIndexed(clause) | ||
|
|
||
| override fun getIndexed(clause: Clause): Sequence<SituatedIndexedClause> { | ||
| return if (clause.isGlobal()) { | ||
| Utils.merge( | ||
| arities.values.map { | ||
| it.getIndexed(clause) | ||
| } | ||
| ) | ||
| } else { | ||
| arities[clause.nestedArity()]?.getIndexed(clause) ?: emptySequence() | ||
| } | ||
| } | ||
|
|
||
| override fun retractAllIndexed(clause: Clause): Sequence<SituatedIndexedClause> = | ||
| if (clause.isGlobal()) { | ||
| val partialResult = Utils.merge( | ||
| arities.values.map { | ||
| it.extractGlobalIndexedSequence(clause) | ||
| }) | ||
| .filter { it.innerClause matches clause } | ||
| .toList() | ||
| if (partialResult.isNotEmpty()) { | ||
| invalidateCache() | ||
| partialResult.forEach { it.removeFromIndex() } | ||
| } | ||
| partialResult.asSequence() | ||
| } else { | ||
| arities[clause.nestedArity()]?.retractAllIndexed(clause) | ||
| ?: emptySequence() | ||
| } | ||
|
|
||
| override fun extractGlobalIndexedSequence(clause: Clause): Sequence<SituatedIndexedClause> { | ||
| return if (ordered) { | ||
| Utils.merge( | ||
| arities.values.map { | ||
| it.extractGlobalIndexedSequence(clause) | ||
| } | ||
| ) | ||
| } else { | ||
| Utils.flattenIndexed( | ||
| arities.values.map { | ||
| it.extractGlobalIndexedSequence(clause) | ||
| } | ||
| ) | ||
| } | ||
| } | ||
|
|
||
| private fun Clause.isGlobal(): Boolean = | ||
| this is Rule && this.head.nestedFirstArgument(nestingLevel) is Var | ||
|
|
||
| private fun Clause.nestedArity(): Int = | ||
| (this as? Rule)?.head?.arityOfNestedFirstArgument(nestingLevel) | ||
| ?: error("The nestedArity method cannot be invoked on non-rule clauses") | ||
|
|
||
| private fun IndexedClause.nestedArity(): Int = | ||
| this.innerClause.head!!.arityOfNestedFirstArgument(nestingLevel) | ||
|
|
||
| override fun invalidateCache() { | ||
| theoryCache.invalidate() | ||
| // arities.values.forEach { it.invalidateCache() } | ||
| } | ||
|
|
||
| private fun regenerateCache(): MutableList<SituatedIndexedClause> = | ||
| dequeOf( | ||
| if (ordered) { | ||
| Utils.merge( | ||
| arities.values.map { | ||
| it.getCache() | ||
| } | ||
| ) | ||
| } else { | ||
| Utils.flattenIndexed( | ||
| arities.values.map { outer -> | ||
| outer.getCache() | ||
| } | ||
| ) | ||
| } | ||
| ) | ||
|
|
||
| } |
Oops, something went wrong.