1 import "JavaBuiltin" as Java
2 import "StringBuilder" as StringBuilder
4 /** The following types and names are builtin *************
5 data Boolean = True | False
24 data [a] = [] | [a] | [a,a] | [a,a,a] | ...
27 data (a,b,c) = (a,b,c)
28 data Maybe a = Nothing | Just a
32 data TypeRep = TCon String | TApply TypeRep TypeRep
34 typeOf :: Typeable a => a -> Type
38 binding :: Serializable a => Binding a
39 ***********************************************************/
41 importJava "java.util.Arrays" where
44 showDoubleArray :: DoubleArray -> String
46 "Converts an array to a list."
48 arrayToList :: Array a -> [a]
50 importJava "java.util.List" where
51 "Converts a list to an array."
53 listToArray :: [a] -> Array a
55 instance Show DoubleArray where
56 show = showDoubleArray
58 importJava "org.simantics.scl.runtime.Coercion" where
59 "Converts a list of doubles to a double array."
60 toDoubleArray :: [Double] -> DoubleArray
61 "Converts a double array to a list of doubles."
62 fromDoubleArray :: DoubleArray -> [Double]
65 * Precedences and associativity of all operators defined in Prelude
71 infixl 7 (*), (/), div, mod
73 infixl 5 (\\), (<<), (<+)
74 infix 4 (!=), (<), (<=), (>=), (>)
76 infixr 2 (||), orElse, morelse
77 infixr 1 (>>=), (>>), (:=)
81 "Creates a constant function. `const x` defines a function that always returns `x`."
87 Function application. `f $ x` is equivalent with `f x`. The function has two uses.
88 First is to remove parentheses from deeply nested expressions:
90 f (g (h x)) == f $ g $ h x
92 The second use is with higher order functions:
94 map ($ parameter) functions
98 ($) :: (a -> <e> b) -> a -> <e> b
101 "Transforms a function taking a pair as a parameter to a function taking two values as a parameter."
103 curry :: ((a, b) -> <e> c) -> a -> b -> <e> c
104 curry f x y = f (x, y)
106 "Transforms a function two values as a parameter to a function taking a pair as a parameter."
108 uncurry :: (a -> b -> <e> c) -> ((a, b) -> <e> c)
109 uncurry f (x, y) = f x y
111 "Transforms a function taking a triple as a parameter to a function taking three values as a parameter."
113 curry3 :: ((a, b, c) -> <e> d) -> a -> b -> c -> <e> d
114 curry3 f x y z = f (x, y, z)
116 "Transforms a function three values as a parameter to a function taking a priple as a parameter."
118 uncurry3 :: (a -> b -> c -> <e> d) -> ((a, b, c) -> <e> d)
119 uncurry3 f (x, y, z) = f x y z
121 "Flips the parameters of a binary function."
123 flip :: (a -> b -> <e> c) -> b -> a -> <e> c
126 swap :: (a,b) -> (b,a)
132 (!=) :: a -> a -> Boolean
133 a != b = not (a == b)
136 The class of linearly ordered types.
137 Method `compare` must be implemented in instances.
141 `compare x y` returns a negative number, if `x` is smaller than `y`,
142 a positive number, if `x` is bigger than `y` and zero if they are equal.
144 compare :: a -> a -> Integer
145 compare a b = if a < b then -1 else if a > b then 1 else 0
148 (<) :: a -> a -> Boolean
149 a < b = compare a b < 0
151 (<=) :: a -> a -> Boolean
152 a <= b = compare a b <= 0
154 (>) :: a -> a -> Boolean
155 a > b = compare a b > 0
157 (>=) :: a -> a -> Boolean
158 a >= b = compare a b >= 0
160 "Minimum of the parameters"
162 min a b = if a < b then a else b
163 "Maximum of the parameters"
165 max a b = if a > b then a else b
168 Combines two integers such that if the first one is non-zero, it is returned, otherwise
169 the second-one. The second parameter is not implemented, if it is not needed.
171 The function is useful for implementing efficient recursive comparison of structures,
174 compare (x1,y1,z1) (x2,y2,z2) = compare x1 x2 &<& compare y1 y2 &<& compare z1 z2
177 (&<&) :: Integer -> (<e> Integer) -> <e> Integer
178 a &<& b = if a == 0 then b else a
180 "Maximum over a list"
182 maximum :: Ord a => [a] -> a
185 "Minimum over a list"
187 minimum :: Ord a => [a] -> a
190 "As `maximum` but compares the elements by the given projection."
191 maximumBy :: Ord b => (a -> <e> b) -> [a] -> <e> a
192 maximumBy f l = snd $ foldl1 maxF $ map (\x -> (f x, x)) l
194 maxF a b = if fst a >= fst b then a else b
197 As `minimum` but compares the elements by the given projection.
202 returns a pair with the smallest second component.
204 minimumBy :: Ord b => (a -> <e> b) -> [a] -> <e> a
205 minimumBy f l = snd $ foldl1 minF $ map (\x -> (f x, x)) l
207 minF a b = if fst a <= fst b then a else b
211 instance Functor ((->) a) where
214 instance Monad ((->) a) where
216 (m >>= f) x = f (m x) x
219 instance Category (->) where
224 instance (Additive b) => Additive (a -> <e> b) where
226 (f + g) x = f x + g x
228 instance (Ring b) => Ring (a -> <e> b) where
230 (neg f) x = neg (f x)
231 (f - g) x = f x - g x
232 (f * g) x = f x * g x
233 (fromInteger c) x = fromInteger c
235 //instance Show (a -> <e> b) where
236 // show f = "<function>"
238 "Appends a string to the string builder."
239 (<<) :: StringBuilder.T -> String -> <Proc> StringBuilder.T
240 (<<) = StringBuilder.appendString
243 The class of types whose elements can be converted to a string representation.
244 Method `show` or `(<+)` must be implemented.
247 "Converts a value to string."
249 "Appends the string representation of the value to the string builder."
250 (<+) :: StringBuilder.T -> a -> <Proc> StringBuilder.T
252 Returns the precedence of the value. It is used to determine if parenteheses
253 are needed around the string representation of the value. The default value is 0
254 and means that parentheses are never added.
256 precedence :: a -> Integer
258 "Converts a value to a string like `show` but does not put string literals in double quotes."
259 showForPrinting :: a -> String
261 show v = runProc (StringBuilder.toString (StringBuilder.new <+ v))
262 showForPrinting v = show v
263 sb <+ v = StringBuilder.appendString sb (show v)
267 `Par` data type is used to control the placement of parentheses when converting values to string.
268 Value `Par prec val` is converted to string like `val` but parentheses are put around, if the
269 precedence of the value is greater than `prec`.
271 data Par a = Par Integer a
273 instance (Show a) => Show (Par a) where
274 sb <+ (Par outerPrec v) = if prec > outerPrec
275 then sb << "(" <+ v << ")"
277 where prec = precedence v
279 "Type class for parsing strings to values."
281 "Converts a string to a required type of value."
284 The `Additive` class is used for types that are additive monoids. The operations
285 must satisfy the following laws (at least approximately, when implemented for
286 floating point numbers):
287 (a + b) + c = a + (b + c)
290 class Additive a where
292 Neutral element of (+), i.e,
298 "Adds two objects (numbers, vectors, strings, etc.) together."
303 sum [e1,e2,...,eN] = e1 + e2 + ... + eN
305 Implemented usually more efficiently than with repetitive
306 application of `(+)`.
311 class (Additive a) => AdditiveGroup a where
317 The `Ring` class is used for types that are algebraic rings. The operations
318 must satisfy the following laws (at least approximately)
319 in addition to the laws of Additive:
324 (a * b) * c = a * (b * c)
326 a * (b + c) = a * b + a * c
327 (a + b) * c = a * c + b * c
329 class (Additive a) => Ring a where
331 Negation. Synonym for unary `-`.
336 "Neutral element of multiplication"
340 "Converts an integer to a desired numeric type."
341 fromInteger :: Integer -> a
346 The `OrderedRing` class combines the Ring and Ord classes. It additionally
347 supports absolute value function.
349 class (Ring a, Ord a) => OrderedRing a where
352 abs x = if x < zero then neg x else x
353 "Converts the given number to `Integer`"
354 toInteger :: a -> Integer
357 The `Integer` class is used for types that represent either all integers or some
360 class (OrderedRing a) => Integral a where
361 "Integer division truncated toward zero."
363 "Integer remainder, satisfying ``(x `div` y)*y + (x `mod` y) = x``"
367 The `Real` class is used for types that represent some approximation of real numbers.
369 class (OrderedRing a) => Real a where
374 "Pi (3.141592654...)"
400 "Inverse hyberbolic sine"
402 "Inverse hyberbolic cosine"
404 "Inverse hyberbolic tangent"
406 "The largest integer not greater than the given number"
408 "The smallest integer not smaller than the given number"
412 Two parameter version of `atan`. Its value is determined by the following
413 equations when (x,y) is a unit vector:
420 atan2 y x = atan (y/x)
423 "Converts a `Double` value to a desired numeric type."
424 fromDouble :: Double -> a
425 "Converts the given number to `Double`"
426 toDouble :: a -> Double
428 a ^ b = exp (b * log a)
430 sinh x = 0.5 * (exp x - exp (neg x))
431 cosh x = 0.5 * (exp x + exp (neg x))
432 tanh x = (e2x - 1) / (e2x + 1)
436 asinh x = log (x + sqrt (x*x + one))
437 acosh x = log (x + sqrt (x*x - one))
438 atanh x = 0.5 * log ((one+x)/(one-x))
440 /// Import mathematical functions ///
443 importJava "java.lang.Math" where
448 sinDouble :: Double -> Double
451 cosDouble :: Double -> Double
454 tanDouble :: Double -> Double
457 asinDouble :: Double -> Double
460 acosDouble :: Double -> Double
463 atanDouble :: Double -> Double
466 atan2Double :: Double -> Double -> Double
469 sinhDouble :: Double -> Double
472 coshDouble :: Double -> Double
475 tanhDouble :: Double -> Double
478 expDouble :: Double -> Double
481 logDouble :: Double -> Double
484 powDouble :: Double -> Double -> Double
487 sqrtDouble :: Double -> Double
490 ceilDouble :: Double -> Double
493 floorDouble :: Double -> Double
496 roundDouble :: Double -> Long
499 absInteger :: Integer -> Integer
502 absLong :: Long -> Long
505 absFloat :: Float -> Float
508 absDouble :: Double -> Double
511 minInteger :: Integer -> Integer -> Integer
514 minLong :: Long -> Long -> Long
517 minFloat :: Float -> Float -> Float
520 minDouble :: Double -> Double -> Double
523 maxInteger :: Integer -> Integer -> Integer
526 maxLong :: Long -> Long -> Long
529 maxFloat :: Float -> Float -> Float
532 maxDouble :: Double -> Double -> Double
537 importJava "java.lang.Byte" where
539 showByte :: Byte -> String
542 readByte :: String -> Byte
544 instance Ord Byte where
550 instance Additive Byte where
551 zero = Java.i2b Java.iconst_0
554 instance Ring Byte where
557 one = Java.i2b Java.iconst_1
559 fromInteger = Java.i2b
561 instance Show Byte where
563 precedence v = if v >= 0 then 0 else 100
565 instance Read Byte where
570 importJava "java.lang.Short" where
572 showShort :: Short -> String
575 readShort :: String -> Short
577 instance Ord Short where
583 instance Additive Short where
587 instance Ring Short where
592 fromInteger = Java.i2s
594 instance Show Short where
596 precedence v = if v >= 0 then 0 else 100
598 instance Read Short where
604 importJava "java.lang.Integer" where
606 showInteger :: Integer -> String
609 readInteger :: String -> Integer
611 instance Ord Integer where
617 instance Additive Integer where
621 instance Ring Integer where
628 instance OrderedRing Integer where
632 instance Integral Integer where
636 instance Show Integer where
638 precedence v = if v >= 0 then 0 else 100
640 instance Read Integer where
646 importJava "java.lang.Long" where
648 showLong :: Long -> String
651 readLong :: String -> Long
653 instance Ord Long where
659 instance Additive Long where
663 instance Ring Long where
668 fromInteger = Java.i2l
670 instance OrderedRing Long where
674 instance Integral Long where
678 instance Show Long where
680 precedence v = if v >= 0 then 0 else 100
682 instance Read Long where
687 importJava "java.lang.Float" where
690 compareFloat :: Float -> Float -> Integer
694 showFloat :: Float -> String
698 readFloat :: String -> Float
700 "Converts 32-bit floating point number to a 32-bit integer with the same byte level representation."
701 floatToIntBits :: Float -> Integer
703 instance Ord Float where
704 compare = compareFloat
710 instance Additive Float where
714 instance Ring Float where
719 fromInteger = Java.i2f
721 instance OrderedRing Float where
725 instance Real Float where
727 x ^ y = Java.d2f (powDouble (Java.f2d x) (Java.f2d y))
728 pi = fromDouble piDouble
729 sqrt = Java.d2f . sqrtDouble . Java.f2d
730 exp = Java.d2f . expDouble . Java.f2d
731 log = Java.d2f . logDouble . Java.f2d
732 sin = Java.d2f . sinDouble . Java.f2d
733 cos = Java.d2f . cosDouble . Java.f2d
734 tan = Java.d2f . tanDouble . Java.f2d
735 asin = Java.d2f . asinDouble . Java.f2d
736 acos = Java.d2f . acosDouble . Java.f2d
737 atan = Java.d2f . atanDouble . Java.f2d
738 sinh = Java.d2f . sinhDouble . Java.f2d
739 cosh = Java.d2f . coshDouble . Java.f2d
740 tanh = Java.d2f . tanhDouble . Java.f2d
741 floor = Java.d2f . floorDouble . Java.f2d
742 ceil = Java.d2f . ceilDouble . Java.f2d
743 atan2 y x = Java.d2f (atan2Double (Java.f2d y) (Java.f2d x))
744 round = roundDouble . Java.f2d
745 fromDouble = Java.d2f
748 instance Show Float where
750 precedence v = if v >= 0 then 0 else 100
752 instance Read Float where
757 importJava "java.lang.Double" where
760 compareDouble :: Double -> Double -> Integer
764 showDouble :: Double -> String
767 @JavaName parseDouble
768 readDouble :: String -> Double
770 "Converts 64-bit floating point number to a 64-bit integer with the same byte level representation."
771 doubleToLongBits :: Double -> Long
773 isFinite :: Double -> Boolean
774 isNaN :: Double -> Boolean
775 isInfinite :: Double -> Boolean
777 instance Ord Double where
778 compare = compareDouble
784 instance Additive Double where
788 instance Ring Double where
793 fromInteger = Java.i2d
795 instance OrderedRing Double where
799 instance Real Double where
822 instance Show Double where
824 precedence v = if v >= 0 then 0 else 100
826 instance Read Double where
831 importJava "java.lang.Character" where
833 showCharacter :: Character -> String
835 "Returns true, if the given character is a letter."
836 isLetter :: Character -> Boolean
838 "Returns true, if the given character is a digit."
839 isDigit :: Character -> Boolean
841 instance Ord Character where
847 instance Show Character where
848 sb <+ c = sb << "'" << showCharacter c << "'"
850 "Adds a given integer to the character code."
851 addChar :: Character -> Integer -> Character
854 "Subtracts a given integer from the character code."
855 subChar :: Character -> Character -> Integer
861 The `Functor` class is used for types that can be mapped over. Instances of `Functor` should satisfy the following laws:
864 fmap (f . g) == fmap f . fmap g
866 class Functor f where
867 "Lifts a pure function to the given functor."
868 fmap :: (a -> b) -> f a -> f b
870 class CoFunctor f where
871 comap :: (a -> b) -> f b -> f a
875 class (Functor f) => Applicative f where
877 (<*>) :: f (a -> b) -> f a -> f b
878 (*>) :: f a -> f b -> f b
879 (<*) :: f a -> f b -> f a
881 u *> v = pure (const id) <*> u <*> v
882 u <* v = pure const <*> u <*> v
883 fmap f x = pure f <*> x
888 The `Monad` class defines the basic operations over a monad, a concept from a branch of mathematics known as category theory.
889 From the perspective of a SCL programmer, however, it is best to think of a monad as an abstract datatype of actions.
890 SCL's `mdo expressions provide a convenient syntax for writing monadic expressions.
892 Instances of `Monad` should satisfy the following laws:
894 return a >>= k == k a
896 m >>= (\x -> k x >>= h) == (m >>= k) >>= h
897 fmap f xs == xs >>= return . f
899 class (Functor m) => Monad m where
900 "Inject a value into the monadic type."
902 "Sequentially compose two actions, passing any value produced by the first as an argument to the second."
903 (>>=) :: m a -> (a -> m b) -> m b
905 The join function is the conventional monad join operator. It removes one level of monadic
908 For lists, `join` concatenates a list of lists:
910 join [[1,2], [3,4]] = [1, 2, 3, 4]
912 join :: m (m a) -> m a
916 Sequentially compose two actions, discarding any value produced by the first, like sequencing operators
917 (such as the semicolon) in imperative languages."
920 (>>) :: Monad m => m a -> m b -> m b
921 a >> b = a >>= (\_ -> b)
923 "While loop. `while cond body` executes the `body` while the `cond` is true."
925 while :: (<e> Boolean) -> (<e> a) -> <e> ()
926 while cond body = loop ()
927 where loop _ = if cond
928 then do body ; loop ()
932 Sequences the given monadic value infinitely:
934 repeatForever m = m >> m >> m >> ...
936 repeatForever m = m >> repeatForever m
938 replicateM :: Monad m => Integer -> m a -> m [a]
939 replicateM count m = loop count emptyList
941 loop count l | count <= 0 = return l
944 loop (count-1) (addList l v)
946 replicateM_ :: Monad m => Integer -> m a -> m ()
947 replicateM_ count m | count <= 0 = return ()
948 | otherwise = m >> replicateM_ (count-1) m
953 A class of monads with zero element satisfying
957 class (Monad m) => MonadZero m where
960 "Injects a boolean test to a type beloning to `MonadZero`."
961 guard :: MonadZero m => Boolean -> m ()
962 guard True = return ()
968 A class of monads with associative binary operator `mplus` satisfying the following laws:
972 mplus (mplus a b) c = mplus a (mplus b c)
973 mplus a b >>= k = mplus (a >>= k) (b >>= k)
975 class (MonadZero m) => MonadPlus m where
976 mplus :: m a -> m a -> m a
981 A class of monads with associative binary operator `morelse` satisfying the following laws:
985 morelse (morelse a b) c = morelse a (morelse b c)
986 morelse (return a) b = return a
988 class (MonadZero m) => MonadOr m where
989 morelse :: m a -> m a -> m a
994 A class of types that can be mapped over with effectful mapping functions.
996 class (Functor f) => FunctorE f where
998 Applies the function to all elements of the container and
999 returns the similarly shaped container with the results:
1003 map f [e1, e2, ..., eN] = [f e1, f e2, ..., f eN]
1007 map (*2) [1..5] = [2, 4, 6, 8, 10]
1009 map :: (a -> <e> b) -> f a -> <e> (f b)
1010 "Calls the given function with all elements of the given container."
1011 iter :: (a -> <e> b) -> f a -> <e> ()
1012 "Calls the given function with all elements of the given container giving also the index of the element as a parameter."
1013 iterI :: (Integer -> a -> <e> b) -> f a -> <e> ()
1015 "Iterates the elements of the given collection. Same as `iter` but parameters flipped."
1016 for :: FunctorE f => f a -> (a -> <e> b) -> <e> ()
1020 "Iterates the elements of the given collection providing also the indices of the elements. Same as `iterI` but parameters flipped."
1021 forI :: FunctorE f => f a -> (Integer -> a -> <e> b) -> <e> ()
1023 forI l f = iterI f l
1025 "`forN n f` calls `f` for all integers `0`, ..., `n-1`"
1027 forN :: Integer -> (Integer -> <e> b) -> <e> ()
1031 then do f i ; loop (i+1)
1035 mapI :: (Integer -> a -> <e> b) -> [a] -> <e> [b]
1036 mapI f l = build (\empty cons -> let
1038 loop i accum = if i < len
1039 then loop (i+1) (cons accum (f i (l!i)))
1044 `mapMaybe` combines `map` and `filter` functions.
1045 It applies the given function to every element of the input list. If the result
1046 is `Just x`, then `x` is added to the resulting list.
1048 mapMaybe f lst = [y | x <- lst, Just y = f x]
1051 mapMaybe :: (a -> <e> Maybe b) -> [a] -> <e> [b]
1052 mapMaybe f l = build (\empty cons -> foldl (\cur x -> match f x with Just v -> cons cur v ; _ -> cur) empty l)
1055 Applies the given function to all elements of the list. Produces two lists: the first contains all elements `x`
1056 for which the function returned `Left x` and the second list contains all elements `y` for which the function
1059 mapEither :: (a -> <e> Either b c) -> [a] -> <e> ([b], [c])
1060 mapEither f list = runProc do
1063 for list (\x -> match f x with
1064 Left v -> addArrayList l v
1065 Right v -> addArrayList r v)
1066 (Java.unsafeCoerce l, Java.unsafeCoerce r)
1070 class (Functor f) => FunctorM f where
1071 "`mapM f` is equivalent to `sequence . map f`."
1072 mapM :: Monad m => (a -> m b) -> f a -> m (f b)
1073 "Evaluate each action in the sequence from left to right, and collect the results."
1074 sequence :: Monad m => f (m a) -> m (f a)
1075 mapM f l = sequence (fmap f l)
1079 "Identity function."
1084 Ignores the given value. This function is used in a situation where a function returns
1085 a value in a context where the value is not expected.
1092 ignoreM :: a -> Maybe b
1096 Composes two functions
1099 (.) :: (b -> <e> c) -> (a -> <e> b) -> (a -> <e> c)
1104 "A type class for sequences. All sequences must support indexing by integers."
1105 class /*(Additive a) =>*/ Sequence a where
1106 "Length of the sequence"
1107 length :: a -> Integer
1108 "`take n s` returns the first `n` elements of the sequence `s`."
1109 take :: Integer -> a -> a
1110 "`drop n s` removes the first `n` elements of the sequence `s`."
1111 drop :: Integer -> a -> a
1113 `sub s begin end` returns a subsequence of `s` starting from
1114 index `begin` and ending just before index `end`.
1116 sub :: a -> Integer -> Integer -> a
1118 take n v = sub v 0 (min n (length v))
1119 drop n v = sub v (min n len) len
1123 instance Sequence [a] where
1127 instance Sequence String where
1128 length = lengthString
1131 class IndexedSequence f where
1132 "`seq ! i` returns the `i`th element of the sequence `seq`. Indexing starts from zero."
1133 (!) :: f a -> Integer -> a
1135 instance IndexedSequence [] where
1141 Equivalent to the boolean value `True`. The value is meant to be used in
1148 otherwise :: Boolean
1151 instance Ord Boolean where
1152 compare False False = 0
1153 compare False True = neg 1
1154 compare True False = 1
1155 compare True True = 0
1157 instance Show Boolean where
1159 show False = "False"
1162 Boolean conjunction (and). The function is a macro that evaluates the second parameter
1163 only if the first parameter is `True`.
1166 <tr><th>a</th><th>b</th><th>a && b</th></tr>
1167 <tr><td>True</td><td>True</td><td>True</td></tr>
1168 <tr><td>True</td><td>False</td><td>False</td></tr>
1169 <tr><td>False</td><td>not evaluated</td><td>False</td></tr>
1173 (&&) :: Boolean -> Boolean -> Boolean
1174 a && b = if a then b else False
1177 Boolean disjunction (or). The function is a macro that evaluates the second parameter
1178 only if the first parameter is `False`.
1181 <tr><th>a</th><th>b</th><th>a || b</th></tr>
1182 <tr><td>True</td><td>not evaluated</td><td>True</td></tr>
1183 <tr><td>False</td><td>True</td><td>True</td></tr>
1184 <tr><td>False</td><td>False</td><td>False</td></tr>
1188 (||) :: Boolean -> Boolean -> Boolean
1189 a || b = if a then True else b
1193 not a = if a then False else True
1197 //data Maybe a = Nothing | Just a
1199 "Given `Just x` this function returns `x`. If the parameter is `Nothing`, the function raises an exception."
1200 fromJust :: Maybe a -> a
1201 fromJust (Just a) = a
1203 deriving instance (Ord a) => Ord (Maybe a)
1204 deriving instance (Show a) => Show (Maybe a)
1206 instance Functor Maybe where
1207 fmap _ Nothing = Nothing
1208 fmap f (Just x) = Just (f x)
1210 instance FunctorE Maybe where
1211 map _ Nothing = Nothing
1212 map f (Just x) = Just (f x)
1215 iter f (Just x) = ignore (f x)
1217 iterI _ Nothing = ()
1218 iterI f (Just x) = ignore (f 0 x)
1220 instance Monad Maybe where
1224 Nothing >>= _ = Nothing
1228 join Nothing = Nothing
1231 instance MonadZero Maybe where
1234 instance MonadOr Maybe where
1235 morelse a@(Just _) _ = a
1238 "`execJust v f` executes the function `f` with parameter value `x`, if `v=Just x`. If `v=Nothing`, the function does nothing."
1240 execJust :: Maybe a -> (a -> <e> b) -> <e> ()
1241 execJust maybeValue procedure = match maybeValue with
1242 Just v -> ignore $ procedure v
1245 "`fromMaybe def v` returns `def` if `v=Nothing` and `x` if `v=Just x`."
1247 fromMaybe :: a -> Maybe a -> a
1248 fromMaybe default maybeValue = match maybeValue with
1254 Provides a default value if the first parameter is Nothing.
1255 The default value is evaluated only if needed. The function
1256 can be used as an operator and is right associative so that
1257 the following is possible:
1259 tryWithTheFirstMethod
1260 `orElse` tryWithTheSecondMethod
1261 `orElse` fail "Didn't succeed."
1264 orElse :: Maybe a -> (<e> a) -> <e> a
1265 orElse (Just x) _ = x
1266 orElse Nothing def = def
1271 The Either type represents values with two possibilities: a value of type `Either a b` is either `Left a` or `Right b`.
1273 The `Either` type is sometimes used to represent a value which is either correct or an error; by convention, the `Left` constructor
1274 is used to hold an error value and the `Right` constructor is used to hold a correct value (mnemonic: "right" also means "correct").
1276 data Either a b = Left a | Right b
1278 deriving instance (Ord a, Ord b) => Ord (Either a b)
1279 deriving instance (Show a, Show b) => Show (Either a b)
1281 instance Functor (Either a) where
1282 fmap _ (Left x) = Left x
1283 fmap f (Right y) = Right (f y)
1285 instance FunctorE (Either a) where
1286 map _ (Left x) = Left x
1287 map f (Right y) = Right (f y)
1289 iter _ (Left x) = ()
1290 iter f (Right y) = ignore (f y)
1292 iterI _ (Left x) = ()
1293 iterI f (Right y) = ignore (f 0 y)
1295 instance Monad (Either b) where
1298 Left x >>= _ = Left x
1301 join (Left x) = Left x
1306 importJava "java.lang.String" where
1309 concatString :: String -> String -> String
1311 @JavaName "compareTo"
1312 compareString :: String -> String -> Integer
1315 lengthString :: String -> Integer
1318 `replaceString original pattern replacement` replaces all occurrences of `pattern` in the string by `replacement`.
1321 replaceString :: String -> String -> String -> String
1325 splitString_ :: String -> String -> Array String
1328 `indexOf string s` finds the first occurrence of `s` from `string` and returns its index.
1329 If the `s` does not occur in the string, return `-1`."
1332 indexOf :: String -> String -> Integer
1334 "Works like `indexOf` but starts searching from the given index instead of the beginning of the string."
1336 indexOfStartingFrom :: String -> String -> Integer -> Integer
1338 "Works like `indexOf` but returns the index of the last occurrence."
1339 @JavaName lastIndexOf
1340 lastIndexOf :: String -> String -> Integer
1342 "Works like `lastIndexOf` but starts searching from the given index instead of the end of the string."
1343 @JavaName lastIndexOf
1344 lastIndexOfStartingFrom :: String -> String -> Integer -> Integer
1348 subString :: String -> Integer -> Integer -> String
1351 `regionMatches str1 offset1 str2 offset2 len` tests whether
1352 `sub str1 offset1 (offset1+len) == sub str2 offset2 (offset2+len)`.
1354 regionMatches :: String -> Integer -> String -> Integer -> Integer -> Boolean
1356 "`startsWith string prefix` returns true if the string begins with the given prefix."
1357 startsWith :: String -> String -> Boolean
1359 "`endsWith string suffix` returns true if the string ends with the given prefix."
1360 endsWith :: String -> String -> Boolean
1362 "Removes leading and trailing whitespace from the string."
1363 trim :: String -> String
1365 "`contains string s` returns true if `string` contains `s` as a substring."
1366 contains :: String -> String -> Boolean
1368 "`charAt string i` returns the `i`th character of the string."
1369 charAt :: String -> Integer -> Character
1371 "Converts all letters of the string to lower case."
1372 toLowerCase :: String -> String
1373 "Converts all letters of the string to upper case."
1374 toUpperCase :: String -> String
1376 "Creates a string from a vector of characters."
1378 string :: Vector Character -> String
1380 instance Ord String where
1381 compare = compareString
1383 instance Additive String where
1386 sum ss = runProc (StringBuilder.toString $ foldl StringBuilder.appendString StringBuilder.new ss)
1389 importJava "org.simantics.scl.runtime.string.StringEscape" where
1390 appendEscapedString :: StringBuilder.T -> String -> <Proc> StringBuilder.T
1392 instance Show String where
1393 showForPrinting = id
1394 sb <+ v = (appendEscapedString (sb << "\"") v) << "\""
1396 instance Read String where
1399 @deprecated "Instead of 'splitString text pattern', write 'split pattern text' (note change in the parameter order)."
1400 "`splitString text pattern` splits the string into a list of string where the parts are sepratated in the original list by the given pattern."
1401 splitString :: String -> String -> [String]
1402 splitString source pattern = arrayToList $ splitString_ source pattern
1404 split :: String -> String -> [String]
1405 split pattern text = arrayToList $ splitString_ text pattern
1409 instance Ord () where
1412 instance Additive () where
1416 instance Show () where
1421 "Gives the first element of a pair."
1426 "Gives the second element of a pair."
1431 instance (Ord a, Ord b) => Ord (a, b) where
1432 compare (a0, b0) (a1, b1) = compare a0 a1 &<& compare b0 b1
1434 instance (Additive a, Additive b) => Additive (a, b) where
1436 (a0, b0) + (a1, b1) = (a0+a1, b0+b1)
1438 instance Functor ((,) a) where
1439 fmap f (a,b) = (a, f b)
1441 instance (Show a, Show b) => Show (a, b) where
1442 sb <+ (x, y) = sb << "(" <+ x << ", " <+ y << ")"
1446 instance (Ord a, Ord b, Ord c) => Ord (a, b, c) where
1447 compare (a0, b0, c0) (a1, b1, c1) = compare a0 a1 &<& compare b0 b1 &<& compare c0 c1
1449 instance (Additive a, Additive b, Additive c) => Additive (a, b, c) where
1450 zero = (zero, zero, zero)
1451 (a0, b0, c0) + (a1, b1, c1) = (a0+a1, b0+b1, c0+c1)
1453 instance Functor ((,,) a b) where
1454 fmap f (a,b,c) = (a, b, f c)
1456 instance (Show a, Show b, Show c) => Show (a, b, c) where
1457 sb <+ (x, y, z) = sb << "(" <+ x << ", " <+ y << ", " <+ z << ")"
1461 instance (Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d) where
1462 compare (a0, b0, c0, d0) (a1, b1, c1, d1) =
1463 compare a0 a1 &<& compare b0 b1 &<& compare c0 c1 &<& compare d0 d1
1465 instance (Additive a, Additive b, Additive c, Additive d) => Additive (a, b, c, d) where
1466 zero = (zero, zero, zero, zero)
1467 (a0, b0, c0, d0) + (a1, b1, c1, d1) = (a0+a1, b0+b1, c0+c1, d0+d1)
1469 instance Functor ((,,,) a b c) where
1470 fmap f (a,b,c,d) = (a, b, c, f d)
1472 instance (Show a, Show b, Show c, Show d) => Show (a, b, c, d) where
1473 sb <+ (x, y, z, w) = sb << "(" <+ x << ", " <+ y << ", " <+ z << ", " <+ w << ")"
1477 instance (Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e) where
1478 compare (a0, b0, c0, d0, e0) (a1, b1, c1, d1, e1) =
1479 compare a0 a1 &<& compare b0 b1 &<& compare c0 c1 &<& compare d0 d1 &<& compare e0 e1
1481 instance (Additive a, Additive b, Additive c, Additive d, Additive e) => Additive (a, b, c, d, e) where
1482 zero = (zero, zero, zero, zero, zero)
1483 (a0, b0, c0, d0, e0) + (a1, b1, c1, d1, e1) = (a0+a1, b0+b1, c0+c1, d0+d1, e0+e1)
1485 instance Functor ((,,,,) a b c d) where
1486 fmap f (a,b,c,d,e) = (a, b, c, d, f e)
1490 instance (Ord a) => Ord [a] where
1491 compare a b = loop 0
1496 then (if i >= lB then 0 else -1)
1499 else compare (a!i) (b!i) &<& loop (i+1)
1501 instance Functor [] where
1504 instance FunctorE [] where
1509 instance Monad [] where
1510 return x = singletonList x
1511 l >>= f = concatMap f l
1514 instance MonadZero [] where
1517 instance MonadPlus [] where
1520 instance Additive [a] where
1524 instance FunctorM [] where
1525 sequence = foldl (\m mel -> m >>= \l -> mel >>= \el -> return (addList l el)) (return emptyList)
1526 mapM f l = sequence (map f l)
1528 "Appends the string representations of all elements of the list to the string builder and separates the values with the given separator."
1529 printWithSeparator :: Show a => StringBuilder.T -> String -> [a] -> <Proc> StringBuilder.T
1530 printWithSeparator sb sep l = loop 0
1533 loop i = if i >= len then sb
1535 (if i==0 then sb else sb << sep) <+ l!i
1538 "Joins the string representations of the list of values with the given separator."
1539 joinWithSeparator :: Show a => String -> [a] -> String
1540 joinWithSeparator separator values = runProc (
1541 StringBuilder.toString $ printWithSeparator StringBuilder.new separator values)
1543 instance (Show a) => Show [a] where
1548 if (i>0) then sb << ", " else sb
1555 importJava "java.util.List" where
1556 "`getList l i` returns the `i`th element of the list `l`. Indexing starts from zero. You can also use the `!` infix function for this purpose."
1558 getList :: [a] -> Integer -> a
1562 lengthList :: [a] -> Integer
1565 subList :: [a] -> Integer -> Integer -> [a]
1568 isEmpty :: [a] -> Boolean
1571 importJava "java.util.Collections" where
1573 //singletonList :: a -> [a]
1578 emptyList = build (\empty cons -> empty)
1581 "Creates a list with exectly one element."
1583 singletonList :: a -> [a]
1584 singletonList v = build (\empty cons -> cons empty v)
1587 // foldl f i (a + b) = foldl f (foldl f i a) b
1589 appendList :: [a] -> [a] -> [a]
1590 appendList a b = build (\empty cons -> foldl cons (foldl cons empty a) b)
1593 importJava "org.simantics.scl.runtime.list.ShareableList" where
1594 "Concatenates two lists."
1597 appendList :: [a] -> [a] -> [a]
1599 "Adds the given value to the end of the list."
1601 addList :: [a] -> a -> [a]
1604 importJava "java.util.ArrayList" where
1608 newArrayList :: <Proc> ArrayList a
1611 addArrayList :: ArrayList a -> a -> <Proc> ()
1614 A primitive for constructing a list by `empty` and `cons` operations given to the function given as a parameter to this function.
1617 build (\empty cons -> cons (cons (cons empty 1) 2) 3)
1623 The SCL compiler makes the following optimization when encountering `build` and `foldl` functions after inlining:
1625 foldl f i (build g) = g i f
1628 build :: forall b e2. (forall a e1. a -> (a -> b -> <e1> a) -> <e1,e2> a) -> <e2> [b]
1629 build f = runProc do
1631 f () (\_ v -> addArrayList l v)
1634 "A specific implementation of `map` for lists."
1637 mapEList :: (a -> <e> b) -> [a] -> <e> [b]
1638 mapEList f l = build (\empty cons -> foldl (\cur x -> cons cur (f x)) empty l)
1640 "A specific implementation of `fmap` for lists."
1642 mapList :: (a -> b) -> [a] -> [b]
1643 mapList f l = build (\empty cons -> foldl (\cur x -> cons cur (f x)) empty l)
1645 "`guardList v` returns a singleton `[()]` if `v=True` and the empty list if `v=False`."
1647 guardList :: Boolean -> [()]
1648 guardList cond = build (\empty cons -> if cond then cons empty () else empty)
1651 `concatMap` combines `map` and `join` functions.
1652 It maps the elements of a given list to lists with the given function and concatenates the results.
1654 concatMap f lst = join (map f lst) = [y | x <- lst, y <- f x]
1657 concatMap :: (a -> <e> [b]) -> [a] -> <e> [b]
1658 concatMap f l = build (\empty cons -> foldl (\cur le -> foldl cons cur (f le)) empty l)
1661 Applies the given function to the elements of the lists until the function returns something
1662 else than `Nothing`. This return value is also returned as a result of this function.
1665 mapFirst :: (a -> <e> Maybe b) -> [a] -> <e> Maybe b
1666 mapFirst f l = loop 0
1669 loop i = if i == len
1671 else match f (l!i) with
1673 Nothing -> loop (i+1)
1676 foldl op initialValue list
1678 applies a binary operator `op` to all elements of `list` from left to right
1679 starting with `initialValue`. For example,
1681 foldl op init [x1, x2, x3, x4] = (((init `op` x1) `op` x2) `op` x3) `op` x4
1684 foldl :: forall a b e. (a -> b -> <e> a) -> a -> [b] -> <e> a
1685 foldl f initial l = loop initial 0
1688 loop cur i = if i==len
1690 else loop (f cur (l!i)) (i+1)
1692 foldlI :: forall a b e. (Integer -> a -> b -> <e> a) -> a -> [b] -> <e> a
1693 foldlI f initial l = loop initial 0
1696 loop cur i = if i==len
1698 else loop (f i cur (l!i)) (i+1)
1700 scanl :: (b -> a -> <e> b) -> b -> [a] -> <e> [b]
1701 scanl f initial l = build (\empty cons -> let
1703 loop cur i accum = let nl = cons accum cur
1706 else loop (f cur (l!i)) (i+1) nl
1707 in loop initial 0 empty)
1709 "`foldr` is defined like `foldl` but it process the list from right to left."
1711 foldr :: (b -> a -> <e> a) -> a -> [b] -> <e> a
1712 foldr f initial l = loop initial (length l - 1)
1714 loop cur i = if i < 0
1716 else loop (f (l!i) cur) (i-1)
1718 foldr1 :: (a -> a -> <e> a) -> [a] -> <e> a
1719 foldr1 f l = loop (l!(len-1)) (len-2)
1722 loop cur i = if i < 0
1724 else loop (f (l!i) cur) (i-1)
1727 `filter pred lst` returns those elements of `lst` that the predicate `pred` accepts. For example
1729 filter (> 3) [1, 2, 3, 4, 5, 6] = [4, 5, 6]
1732 filter :: (a -> <e> Boolean) -> [a] -> <e> [a]
1733 filter p l = build (\empty cons -> foldl (\cur x -> if p x then cons cur x else cur) empty l)
1736 Takes those elements of the input list that match `(Just x)` and adds the contents to the resulting list. For example,
1738 filterJust [Just 1, Nothing, Just 5] = [1, 5]
1741 filterJust :: [Maybe a] -> [a]
1742 filterJust l = build (\empty cons -> foldl (\cur x -> match x with Just v -> cons cur v ; _ -> cur) empty l)
1744 listToMaybe :: [a] -> Maybe a
1745 listToMaybe l = if isEmpty l then Nothing else Just (l!0)
1747 maybeToList :: Maybe a -> [a]
1748 maybeToList (Just a) = [a]
1752 `takeWhile p l`, returns the longest prefix (possibly empty) of list `l` of elements that satisfy `p`
1754 takeWhile :: (a -> <e> Boolean) -> [a] -> <e> [a]
1755 takeWhile f l = loop 0
1758 loop i | i == len = l
1759 | f (l!i) = loop (i+1)
1760 | otherwise = take i l
1762 partition :: (a -> <e> Boolean) -> [a] -> <e> ([a], [a])
1763 partition p l = runProc do
1768 then addArrayList res1 el
1769 else addArrayList res2 el
1771 (Java.unsafeCoerce res1, Java.unsafeCoerce res2)
1774 `range begin end` produces a list of consecutive integers starting from `begin` and ending to `end` (including `end`).
1775 The compiler supports syntactic sugar `[begin..end]` for this function.
1778 range :: Integer -> Integer -> [Integer]
1779 range first last = build (\empty cons -> do
1780 loop i cur = if i > last then cur else loop (i+1) (cons cur i)
1783 "A specific implementation of `iter` for lists."
1785 iterList :: (a -> <e> b) -> [a] -> <e> ()
1786 iterList f l = foldl (\_ x -> ignore (f x)) () l
1788 "A specific implementation of `iterI` for lists."
1790 iterIList :: (Integer -> a -> <e> b) -> [a] -> <e> ()
1791 iterIList f l = do foldl (\i x -> do f i x ; i+1) 0 l ; ()
1794 Generates a list from a given starting state and iteration function.
1797 let nextState 0 = Nothing
1798 nextState i = Just (i, i `div` 2)
1799 in unfoldr nextState 30
1806 unfoldr :: (b -> <e> Maybe (a, b)) -> b -> <e> [a]
1807 unfoldr f s = build (\empty cons -> do
1810 Just (el,newS) -> loop newS (cons cur el)
1814 importJava "org.simantics.scl.runtime.Lists" where
1818 mapList :: (a -> b) -> [a] -> [b]
1821 mapEList :: (a -> <e> b) -> [a] -> <e> [b]
1824 iterList :: (a -> <e> ()) -> [a] -> <e> ()
1825 concatMap :: (a -> <e> [b]) -> [a] -> <e> [b]
1828 Combines two lists into one list of pairs. The length of the resulting list is the length of the smallest input list.
1830 zip [1, 2, 3, 4, 5] ['a', 'b', 'c'] = [(1, 'a'), (2, 'b'), (3, 'c')]
1832 zip :: [a] -> [b] -> [(a,b)]
1833 "Combines two lists by using the given function for combining the elements. The length of the resulting list is the length of the smallest input list."
1834 zipWith :: (a -> b -> <e> c) -> [a] -> [b] -> <e> [c]
1836 Produces two lists from one list of pairs.
1838 unzip [(1, 'a'), (2, 'b'), (3, 'c')] = ([1, 2, 3], ['a', 'b', 'c'])
1840 unzip :: [(a,b)] -> ([a],[b])
1842 //"@filter p l@ returns those elements of @l@ that the predicate @p@ accepts."
1843 //filter :: (a -> <e> Boolean) -> [a] -> <e> [a]
1844 //filterJust :: [Maybe a] -> [a]
1846 foldl :: (a -> b -> <e> a) -> a -> [b] -> <e> a
1848 "Like `foldl` but assumes that the list is non-empty so the initial is not needed."
1849 foldl1 :: (a -> a -> <e> a) -> [a] -> <e> a
1850 //unfoldr :: (b -> <e> Maybe (a, b)) -> b -> <e> [a]
1852 "Sorts the list using the given comparator."
1853 sortWith :: (a -> a -> <e> Integer) -> [a] -> <e> [a]
1854 "Works like `index` but uses the given functions as hash codes and equality."
1855 indexWith :: (a -> Integer) -> (a -> a -> Boolean) -> [(a,b)] -> a -> Maybe b
1856 groupWith :: (b -> Integer) -> (b -> b -> Boolean) -> (a -> <e> b) -> (a -> <e> c) -> [a] -> <e> [(b, [c])]
1857 "Works like `unique` but uses the given function for equality tests."
1858 uniqueWith :: (a -> a -> Boolean) -> [a] -> [a]
1859 "Works like `\\\\` but uses the given function for equality tests."
1860 deleteAllBy :: (a -> a -> Boolean) -> [a] -> [a] -> [a]
1862 //range :: Integer -> Integer -> [Integer]
1864 //build :: (forall a. a -> (a -> b -> <e> a) -> <e> a) -> <e> [b]
1866 "`elem el lst` return true, if `el` occurs in the list `lst`."
1867 elem :: a -> [a] -> Boolean
1871 loop i | i < len = if el == l!i
1876 "`elemMaybe v1 (Just v2)` returns true if `v1 == v2`. `elemMaybe v1 Nothing` is always false."
1877 elemMaybe :: a -> Maybe a -> Boolean
1878 elemMaybe el m = match m with
1879 Just el2 -> el == el2
1883 Computes a list that contains only elements that belongs to both input lists.
1885 intersect :: [a] -> [a] -> [a]
1886 intersect a b = filter f a
1890 "Reverses a given list. For example, `reverse [1,2,3] = [3,2,1]`"
1891 reverse :: [a] -> [a]
1892 reverse l = [l!(len-i) | i <- [1..len]]
1897 Transposes the rows and columns of its argument. For example,
1899 transpose [[1,2,3],[4,5,6]] == [[1,4],[2,5],[3,6]]
1900 transpose [[1,2],[3,4,5]] == [[1,3],[2,4],[5]]
1902 transpose xss = [[xs!i | xs <- xss, i < length xs]
1903 | i <- [0..maximum [length xs | xs <- xss]-1]]
1905 "Works like `unfoldr` but generates the list from right to left."
1906 unfoldl :: (b -> <e> Maybe (a, b)) -> b -> <e> [a]
1907 unfoldl f seed = reverse $ unfoldr f seed
1909 "Removes the first element of the list, if the list is non-empty."
1911 tail l = if len < 2 then emptyList else subList l 1 len
1915 "Tries to find the given key from the list of key-value pairs and returns the corresponding value."
1916 lookup :: a -> [(a, b)] -> Maybe b
1921 (a,b) | a == el -> Just b
1922 | otherwise -> loop (i+1)
1926 "Conjunction over a list."
1928 and :: [Boolean] -> Boolean
1929 and = foldl (&&) True
1931 "Disjunction over a list."
1933 or :: [Boolean] -> Boolean
1934 or = foldl (||) False
1937 `any pred lst` tests whether the predicate `pred` holds some element of `lst`.
1938 It returns immediately when it encounters the first value satisfying the predicate.
1940 any :: (a -> <e> Boolean) -> [a] -> <e> Boolean
1944 `all pred lst` tests whether the predicate `pred` holds for all elements of `lst`.
1945 It returns immediately when it encounters the first value not satisfying the predicate.
1947 all :: (a -> <e> Boolean) -> [a] -> <e> Boolean
1951 Returns the first element of the list satisfying the given condition,
1952 or `Nothing` if there is no such element.
1954 findFirst :: (a -> <e> Boolean) -> [a] -> <e> Maybe a
1955 findFirst p l = loop 0
1959 then let el = l!i in
1968 Sorts the given list using its default order.
1971 sort :: Ord a => [a] -> [a]
1972 sort = sortWith compare
1975 Sorts the lists by the values computed by the first function.
1978 sortBy snd [(1,5), (2,3), (3,4)] = [(2,3), (3,4), (1,5)]
1981 sortBy :: Ord b => (a -> <e> b) -> [a] -> <e> [a]
1982 sortBy f l = sortWith (\x y -> compare (f x) (f y)) l
1983 // This is faster if f is slow, but will generate more auxiliary structures
1984 //sortBy f l = map snd (sortWith (\(x,_) (y,_) -> compare x y) [(f x, x) | x <- l])
1987 Given a list of key-value pairs, the function produces a function that finds a value
1988 efficiently for the given key.
1990 index :: [(a,b)] -> a -> Maybe b
1991 index = indexWith hashCode (==)
1994 Given a list of values and a function computing a key for each value, the function produces a function that finds a value
1995 effeciently for the given key.
1997 indexBy :: (a -> b) -> [a] -> b -> Maybe a
1998 indexBy f l = index [(f x, x) | x <- l]
2000 "Groups a list values by a key computed by the given function."
2001 groupBy :: (a -> <e> b) -> [a] -> <e> [(b, [a])]
2002 groupBy f l = groupWith hashCode (==) f id l
2004 "Groups a list of key-value pairs by the keys."
2005 group :: [(a,b)] -> [(a, [b])]
2006 group = groupWith hashCode (==) fst snd
2008 "Removes duplicates (all but the first occurrence) from the list but otherwise preserves the order of the elements."
2009 unique :: [a] -> [a]
2010 unique = uniqueWith (==)
2012 "Like `unique`, but uses the given function for finding the key values used for uniqueness testing."
2013 uniqueBy :: (a -> b) -> [a] -> [a]
2014 uniqueBy f = uniqueWith (\a b -> f a == f b)
2016 //sortAndUniqueBy :: Ord b => (a -> b) -> [a] -> [a]
2017 //sortAndUniqueBy f = map snd . uniqueWith (\a b -> fst a == fst b) . sortBy fst . map (\x -> (f x, x))
2019 "`a \\\\ b` removes all elements of `b` from the list `a`."
2020 (\\) :: [a] -> [a] -> [a]
2021 (\\) = deleteAllBy (==)
2025 importJava "java.lang.Object" where
2026 "A data type that can represent any value."
2031 showDynamic :: Dynamic -> String
2033 instance Show Dynamic where
2036 "Converts a value to `Dynamic` type."
2037 toDynamic :: a -> Dynamic
2038 toDynamic = Java.unsafeCoerce
2040 "Converts a `Dynamic` value to a required value, or fails if the conversion is not possible."
2041 importJava "org.simantics.scl.compiler.runtime.ValueConversion" where
2042 fromDynamic :: Typeable a => Dynamic -> a
2046 importJava "org.simantics.scl.runtime.procedure.Ref" where
2047 "A mutable reference to a value of type `a`."
2050 "Creates a new reference with the given initial value."
2052 ref :: a -> <Proc> (Ref a)
2054 "Returns the current value of the reference."
2056 getRef :: Ref a -> <Proc> a
2058 "Sets a new value for the reference."
2059 @JavaName "<set>value"
2060 (:=) :: Ref a -> a -> <Proc> ()
2062 instance Show (Ref a) where
2063 show _ = "<reference>"
2065 importJava "org.simantics.scl.runtime.reporting.SCLReporting" where
2066 "Prints the given string to the console."
2068 printString :: String -> <Proc> ()
2069 "Prints an error message to the console."
2070 printError :: String -> <Proc> ()
2071 "Reports that certain amount of work has been done for the current task."
2072 didWork :: Double -> <Proc> ()
2074 `printingToFile "fileName" expression` executes the `expression` so that all its console prints
2075 are written to the file given as a first parameter.
2077 printingToFile :: String -> (<e> a) -> <e> a
2079 `printErrorsAsNormalPrints expression` executes the `expression` so that all its error prints
2080 are printed as normal prints. This is useful mainly in testing scripts for checking that the implementations
2081 give proper error messages with invalid inputs.
2083 printErrorsAsNormalPrints :: (<e> a) -> <e> a
2085 `disablePrintingForCommand expression` executes the `expression` so that it does not print return values.
2086 Errors are printed normally.
2088 disablePrintingForCommand :: (<e> a) -> <e> a
2091 importJava "org.simantics.scl.runtime.procedure.Procedures" where
2092 "Returns `True` if the current thread has been interrupted."
2093 isInterrupted :: <Proc> Boolean
2094 "Checks whether the current thread has been interrupted and throws an exception if it is."
2095 checkInterrupted :: <Proc> ()
2096 "Generates a random identifier."
2097 generateUID :: <Proc> String
2099 "Executes the given expression and catches certain class of exceptions (specified by the catch handler that is given as a second parameter.)"
2101 catch :: VecComp ex => (<e> a) -> (ex -> <e> a) -> <e> a
2103 importJava "java.lang.Throwable" where
2107 showThrowable :: Throwable -> String
2108 importJava "java.lang.Exception" where
2112 showException :: Exception -> String
2114 instance Show Throwable where
2115 show = showThrowable
2116 instance Show Exception where
2117 show = showException
2119 "Prints the given value in the console."
2121 print :: Show a => a -> <Proc> ()
2122 print v = printString (showForPrinting v)
2124 instance Show TypeRep where
2125 sb <+ (TApply (TCon "Builtin" "[]") b) =
2126 sb << "[" <+ b << "]"
2127 sb <+ (TApply (TApply (TCon "Builtin" "(,)") c1) c2) =
2128 sb << "(" <+ c1 << "," <+ c2 << ")"
2129 sb <+ (TApply (TApply (TApply (TCon "Builtin" "(,,)") c1) c2) c3) =
2130 sb << "(" <+ c1 << "," <+ c2 << "," <+ c3 << ")"
2131 sb <+ (TApply (TApply (TApply (TApply (TCon "Builtin" "(,,,)") c1) c2) c3) c4) =
2132 sb << "(" <+ c1 << "," <+ c2 << "," <+ c3 << "," <+ c4 << ")"
2134 sb <+ (TCon _ name) = sb << name
2135 sb <+ (TApply a b) = sb <+ Par 1 a << " " <+ Par 2 b
2136 sb <+ (TFun a b) = sb <+ Par 1 a << " -> " <+ b
2138 precedence (TCon _ _) = 0
2139 precedence (TFun _ _) = 2
2140 precedence (TApply a _) = if isSpecialType a then 0 else 1
2142 isSpecialType (TCon "Builtin" "[]") = True
2143 isSpecialType (TCon "Builtin" "()") = True
2144 isSpecialType (TCon "Builtin" "(,)") = True
2145 isSpecialType (TCon "Builtin" "(,,)") = True
2146 isSpecialType (TCon "Builtin" "(,,,)") = True
2147 isSpecialType (TApply a _) = isSpecialType a
2152 importJava "java.util.Arrays" where
2155 byteArrayToString :: ByteArray -> String
2157 instance Show ByteArray where
2158 show = byteArrayToString
2163 importJava "org.simantics.scl.compiler.types.Type" where
2165 showType :: Type -> String
2167 importJava "org.simantics.scl.compiler.types.Types" where
2168 removeForAll :: Type -> Type
2170 instance Show Type where