index.KAF

6757                
(|OneDimensionalArrayAggregate| S)
|category|
(((|OneDimensionalArrayAggregate| |#1|) (|Category|) (|Type|))
 (T |OneDimensionalArrayAggregate|))
(T T)
(|Join| (|FiniteLinearAggregate| |t#1|) (|ShallowlyMutableAggregate| |t#1|))
"aggcat.spad"
((~= (#1=((|Boolean|) $ $) 18 (|has| |#1| . #2=((|BasicType|))) ELT))
 (|swap!|
  (((|Void|) $ #3=(|Integer|) #3#) 35
   (|has| $ (|ShallowlyMutableAggregate| |#1|)) ELT))
 (|sorted?| ((#4=(|Boolean|) (|Mapping| #4# |#1| |#1|) $) 96 T ELT)
  ((#4# $) 90 (|has| |#1| . #5=((|OrderedSet|))) ELT))
 (|sort!|
  (($ (|Mapping| #4# |#1| |#1|) . #6=($)) 87
   (|has| $ (|ShallowlyMutableAggregate| |#1|)) ELT)
  (#7=($ $) 86
   (AND (|has| |#1| . #5#) (|has| $ (|ShallowlyMutableAggregate| |#1|))) ELT))
 (|sort| (($ (|Mapping| #4# |#1| |#1|) . #6#) 97 T ELT)
         (#7# 91 (|has| |#1| . #5#) ELT))
 (|setelt|
  ((|#1| $ #3# |#1|) 47 (|has| $ (|ShallowlyMutableAggregate| |#1|)) ELT)
  ((|#1| $ #8=(|UniversalSegment| #3#) |#1|) 55
   (|has| $ (|ShallowlyMutableAggregate| |#1|)) ELT))
 (|select|
  (($ (|Mapping| #9=(|Boolean|) |#1|) . #10=($)) 69
   (|has| $ (|FiniteAggregate| |#1|)) ELT))
 (|sample| (#11=($) 6 T CONST))
 (|reverse!| (#7# 88 (|has| $ (|ShallowlyMutableAggregate| |#1|)) ELT))
 (|reverse| (#7# 98 T ELT))
 (|removeDuplicates|
  (($ $) 71
   (AND (|has| |#1| . #12=((|BasicType|))) (|has| $ (|FiniteAggregate| |#1|)))
   ELT))
 (|remove|
  (($ |#1| $) 70 (AND (|has| |#1| . #12#) (|has| $ (|FiniteAggregate| |#1|)))
   ELT)
  (($ (|Mapping| #9# |#1|) . #10#) 68 (|has| $ (|FiniteAggregate| |#1|)) ELT))
 (|reduce|
  ((|#1| (|Mapping| |#1| |#1| |#1|) $ |#1| |#1|) 110
   (|has| |#1| . #13=((|BasicType|))) ELT)
  ((|#1| (|Mapping| |#1| |#1| |#1|) $ |#1|) 106 T ELT)
  ((|#1| (|Mapping| |#1| |#1| |#1|) $) 105 T ELT))
 (|qsetelt!|
  ((|#1| $ #3# |#1|) 48 (|has| $ (|ShallowlyMutableAggregate| |#1|)) ELT))
 (|qelt| ((|#1| $ #3#) 46 T ELT))
 (|position| ((#14=(|Integer|) (|Mapping| #4# |#1|) $) 95 T ELT)
             ((#14# |#1| $) 94 (|has| |#1| . #15=((|BasicType|))) ELT)
             ((#14# |#1| $ #14#) 93 (|has| |#1| . #15#) ELT))
 (|new| (($ (|NonNegativeInteger|) |#1|) 65 T ELT))
 (|minIndex| ((#3# . #16=($)) 38 (|has| #3# . #17=((|OrderedSet|))) ELT))
 (|min| (#18=($ $ $) 80 (|has| |#1| . #5#) ELT))
 (|merge| (($ (|Mapping| #4# |#1| |#1|) $ $) 99 T ELT)
  (($ $ $) 92 (|has| |#1| . #5#) ELT))
 (|members| (((|List| |#1|) $) 104 T ELT))
 (|member?| ((#19=(|Boolean|) |#1| $) 109 (|has| |#1| . #13#) ELT))
 (|maxIndex| ((#3# . #16#) 39 (|has| #3# . #17#) ELT))
 (|max| (#18# 81 (|has| |#1| . #5#) ELT))
 (|map!| (($ (|Mapping| |#1| |#1|) $) 112 T ELT))
 (|map| (($ (|Mapping| |#1| |#1|) $) 26 T ELT)
  (($ (|Mapping| |#1| |#1| |#1|) $ $) 60 T ELT))
 (|latex| (((|String|) $) 21 (|has| |#1| . #20=((|SetCategory|))) ELT))
 (|insert| (($ |#1| $ #3#) 57 T ELT) (($ $ $ #3#) 56 T ELT))
 (|indices| (((|List| #3#) $) 41 T ELT))
 (|index?| ((#21=(|Boolean|) #3# $) 42 T ELT))
 (|hash| (((|SingleInteger|) $) 20 (|has| |#1| . #20#) ELT))
 (|first| ((|#1| $) 37 (|has| #3# . #17#) ELT))
 (|find| (((|Union| |#1| "failed") (|Mapping| #19# |#1|) $) 107 T ELT))
 (|fill!| (($ $ |#1|) 36 (|has| $ (|ShallowlyMutableAggregate| |#1|)) ELT))
 (|every?| ((#19# (|Mapping| #19# |#1|) . #22=($)) 102 T ELT))
 (|eval|
  (($ $ (|List| (|Equation| |#1|))) 25
   (AND (|has| |#1| (|Evalable| |#1|)) (|has| |#1| . #20#)) ELT)
  (($ $ (|Equation| |#1|)) 24
   (AND (|has| |#1| (|Evalable| |#1|)) (|has| |#1| . #20#)) ELT)
  (($ $ |#1| |#1|) 23 (AND (|has| |#1| (|Evalable| |#1|)) (|has| |#1| . #20#))
   ELT)
  (($ $ (|List| |#1|) (|List| |#1|)) 22
   (AND (|has| |#1| (|Evalable| |#1|)) (|has| |#1| . #20#)) ELT))
 (|eq?| ((#23=(|Boolean|) $ $) 10 T ELT))
 (|entry?|
  ((#21# |#1| $) 40
   (AND (|has| $ (|FiniteAggregate| |#1|)) (|has| |#1| (|BasicType|))) ELT))
 (|entries| (((|List| |#1|) $) 43 T ELT)) (|empty?| ((#23# $) 7 T ELT))
 (|empty| (#11# 8 T ELT))
 (|elt| ((|#1| $ #3# |#1|) 45 T ELT) ((|#1| $ #3#) 44 T ELT)
  (($ $ #8#) 66 T ELT))
 (|delete| (($ $ #3#) 59 T ELT) (($ $ #8#) 58 T ELT))
 (|count| ((#24=(|NonNegativeInteger|) |#1| $) 108 (|has| |#1| . #13#) ELT)
  ((#24# (|Mapping| #19# |#1|) $) 103 T ELT))
 (|copyInto!|
  (($ $ $ #14#) 89 (|has| $ (|ShallowlyMutableAggregate| |#1|)) ELT))
 (|copy| (($ $) 9 T ELT))
 (|convert| ((#25=(|InputForm|) $) 72 (|has| |#1| (|ConvertibleTo| #25#)) ELT))
 (|construct| (($ (|List| |#1|)) 67 T ELT))
 (|concat| (($ $ |#1|) 64 T ELT) (($ |#1| $) 63 T ELT) (($ $ $) 62 T ELT)
           (($ (|List| $)) 61 T ELT))
 (|coerce|
  (((|OutputForm|) $) 16 (|has| |#1| (|CoercibleTo| (|OutputForm|))) ELT))
 (|before?| (#1# 19 (|has| |#1| . #2#) ELT))
 (|any?| ((#19# (|Mapping| #19# |#1|) . #22#) 101 T ELT))
 (>= (#26=((|Boolean|) $ $) 82 (|has| |#1| . #5#) ELT))
 (> (#26# 84 (|has| |#1| . #5#) ELT)) (= (#1# 17 (|has| |#1| . #2#) ELT))
 (<= (#26# 83 (|has| |#1| . #5#) ELT)) (< (#26# 85 (|has| |#1| . #5#) ELT))
 (|#| ((#24# $) 100 T ELT)))
A1AGG
(((|FiniteLinearAggregate| S) . T) ((|ShallowlyMutableAggregate| S) . T))
(((|Aggregate|) . T) ((|BasicType|) |has| |#1| (|BasicType|))
 ((|CoercibleTo| (|OutputForm|)) |has| |#1| (|CoercibleTo| (|OutputForm|)))
 ((|Collection| |#1|) . T) (#1=(|ConvertibleTo| (|InputForm|)) |has| |#1| #1#)
 ((|Eltable| (|UniversalSegment| #2=(|Integer|)) $) . T)
 ((|Eltable| #2# |#1|) . T) ((|EltableAggregate| #2# |#1|) . T)
 ((|Evalable| |#1|) AND (|has| |#1| (|Evalable| |#1|))
  (|has| |#1| (|SetCategory|)))
 ((|FiniteAggregate| |#1|) . T) ((|FiniteLinearAggregate| |#1|) . T)
 ((|Functorial| |#1|) . T) ((|HomogeneousAggregate| |#1|) . T)
 ((|IndexedAggregate| #2# |#1|) . T)
 ((|InnerEvalable| |#1| |#1|) AND (|has| |#1| (|Evalable| |#1|))
  (|has| |#1| (|SetCategory|)))
 ((|LinearAggregate| |#1|) . T) (#3=(|OrderedSet|) |has| |#1| . #4=(#3#))
 ((|OrderedType|) |has| |#1| . #4#)
 ((|SetCategory|) |has| |#1| (|SetCategory|))
 ((|ShallowlyMutableAggregate| |#1|) . T) ((|Type|) . T))
((|constructor|
  (NIL
   "One-dimensional-array aggregates serves as models for one-dimensional arrays. Categorically,{} these aggregates are finite linear aggregates with the shallowly mutable property,{} that is,{} any component of the array may be changed without affecting the identity of the overall array. Array data structures are typically represented by a fixed area in storage and therefore cannot efficiently grow or shrink on demand as can list structures (see however \\spadtype{FlexibleArray} for a data structure which is a cross between a list and an array). Iteration over,{} and access to,{} elements of arrays is extremely fast (and often can be optimized to open-code). Insertion and deletion however is generally slow since an entirely new data structure must be created for the result.")))
(("documentation" 0 5944) ("ancestors" 0 5039) ("parents" 0 4965)
 ("abbreviation" 0 4959) ("predicates" 0 NIL) ("attributes" 0 NIL)
 ("signaturesAndLocals" 0 NIL) ("superDomain" 0 NIL) ("operationAlist" 0 264)
 ("modemaps" 0 NIL) ("sourceFile" 0 250) ("constructorCategory" 0 173)
 ("dualSignature" 0 167) ("constructorModemap" 0 67) ("constructorKind" 0 56)
 ("constructorForm" 0 21))