aboutsummaryrefslogtreecommitdiff
path: root/src/algebra/kl.spad.pamphlet
diff options
context:
space:
mode:
Diffstat (limited to 'src/algebra/kl.spad.pamphlet')
-rw-r--r--src/algebra/kl.spad.pamphlet35
1 files changed, 0 insertions, 35 deletions
diff --git a/src/algebra/kl.spad.pamphlet b/src/algebra/kl.spad.pamphlet
index d365fb44..f9b26e86 100644
--- a/src/algebra/kl.spad.pamphlet
+++ b/src/algebra/kl.spad.pamphlet
@@ -106,41 +106,7 @@ SortedCache(S:CachableSet): Exports == Implementation where
x
@
-\section{domain MKCHSET MakeCachableSet}
-<<domain MKCHSET MakeCachableSet>>=
-)abbrev domain MKCHSET MakeCachableSet
-++ Make a cachable set from any set
-++ Author: Manuel Bronstein
-++ Date Created: ???
-++ Date Last Updated: 14 May 1991
-++ Description:
-++ MakeCachableSet(S) returns a cachable set which is equal to S as a set.
-MakeCachableSet(S:SetCategory): Exports == Implementation where
- Exports == Join(CachableSet, HomotopicTo S)
- Implementation == add
- import SortedCache(%)
-
- Rep := Record(setpart: S, pos: NonNegativeInteger)
- clearCache()
-
- position x == x.pos
- setPosition(x, n) == (x.pos := n; void)
- coerce(x:%):S == x.setpart
- coerce(x:%):OutputForm == x::S::OutputForm
- coerce(s:S):% == enterInCache([s, 0]$Rep, s = #1::S)
-
- x < y ==
- if position(x) = 0 then enterInCache(x, x::S = #1::S)
- if position(y) = 0 then enterInCache(y, y::S = #1::S)
- position(x) < position(y)
-
- x = y ==
- if position(x) = 0 then enterInCache(x, x::S = #1::S)
- if position(y) = 0 then enterInCache(y, y::S = #1::S)
- position(x) = position(y)
-
-@
\section{domain KERNEL Kernel}
<<domain KERNEL Kernel>>=
)abbrev domain KERNEL Kernel
@@ -349,7 +315,6 @@ KernelFunctions2(R:OrderedSet, S:OrderedSet): with
<<category CACHSET CachableSet>>
<<package SCACHE SortedCache>>
-<<domain MKCHSET MakeCachableSet>>
<<domain KERNEL Kernel>>
<<package KERNEL2 KernelFunctions2>>
@